Execution Chart

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

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r178-oct2-177969020000242.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 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 MedleyA-PT-19, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969020000242
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 700K
-rw-r--r-- 1 mcc users 8.0K Mar 7 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Mar 7 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Mar 7 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Mar 7 18:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 11:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 11:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 11:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Mar 7 18:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Mar 7 18:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Mar 7 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Mar 7 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 184K Mar 3 18:30 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 MedleyA-PT-19-CTLFireability-2024-00
FORMULA_NAME MedleyA-PT-19-CTLFireability-2024-01
FORMULA_NAME MedleyA-PT-19-CTLFireability-2024-02
FORMULA_NAME MedleyA-PT-19-CTLFireability-2024-03
FORMULA_NAME MedleyA-PT-19-CTLFireability-2024-04
FORMULA_NAME MedleyA-PT-19-CTLFireability-2024-05
FORMULA_NAME MedleyA-PT-19-CTLFireability-2024-06
FORMULA_NAME MedleyA-PT-19-CTLFireability-2024-07
FORMULA_NAME MedleyA-PT-19-CTLFireability-2024-08
FORMULA_NAME MedleyA-PT-19-CTLFireability-2024-09
FORMULA_NAME MedleyA-PT-19-CTLFireability-2024-10
FORMULA_NAME MedleyA-PT-19-CTLFireability-2024-11
FORMULA_NAME MedleyA-PT-19-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-19-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-19-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-19-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779701329373

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-19
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-25 09:28:50] [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-05-25 09:28:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 09:28:50] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2026-05-25 09:28:50] [INFO ] Transformed 272 places.
[2026-05-25 09:28:50] [INFO ] Transformed 586 transitions.
[2026-05-25 09:28:50] [INFO ] Found NUPN structural information;
[2026-05-25 09:28:50] [INFO ] Parsed PT model containing 272 places and 586 transitions and 2889 arcs in 208 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 3 transitions.
Support contains 105 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 583/583 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 267 transition count 583
Discarding 49 places :
Symmetric choice reduction at 1 with 49 rule applications. Total rules 51 place count 218 transition count 528
Iterating global reduction 1 with 49 rules applied. Total rules applied 100 place count 218 transition count 528
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 217 transition count 526
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 217 transition count 526
Applied a total of 102 rules in 51 ms. Remains 217 /269 variables (removed 52) and now considering 526/583 (removed 57) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15304932710530898695.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9616525969751086966.kers'
[2026-05-25 09:28:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15304932710530898695.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9616525969751086966.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 526 rows 217 cols 2767 entries
Finished phase 1 with 187 SingleSign rule and 8 generalized
[2026-05-25 09:28:51] [INFO ] Computed 22 invariants in 2 ms
Computed 22 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9616525969751086966.kers
Total runtime 3 ms.
[2026-05-25 09:28:51] [INFO ] Implicit Places using invariants in 261 ms returned []
[2026-05-25 09:28:51] [INFO ] Invariant cache hit.
[2026-05-25 09:28:51] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 541 ms to find 0 implicit places.
Running 525 sub problems to find dead transitions.
[2026-05-25 09:28:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 525 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/216 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 525 unsolved
Problem TDEAD217 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD500 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/217 variables, 12/22 constraints. Problems are: Problem set: 120 solved, 405 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 7/29 constraints. Problems are: Problem set: 120 solved, 405 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 3/32 constraints. Problems are: Problem set: 120 solved, 405 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 2/34 constraints. Problems are: Problem set: 120 solved, 405 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 0/34 constraints. Problems are: Problem set: 120 solved, 405 unsolved
At refinement iteration 7 (OVERLAPS) 526/743 variables, 217/251 constraints. Problems are: Problem set: 120 solved, 405 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 743/743 variables, and 251 constraints, problems are : Problem set: 120 solved, 405 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 525/525 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 120 solved, 405 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 10/10 constraints. Problems are: Problem set: 120 solved, 405 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/216 variables, 0/10 constraints. Problems are: Problem set: 120 solved, 405 unsolved
At refinement iteration 2 (OVERLAPS) 1/217 variables, 12/22 constraints. Problems are: Problem set: 120 solved, 405 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 12/34 constraints. Problems are: Problem set: 120 solved, 405 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 0/34 constraints. Problems are: Problem set: 120 solved, 405 unsolved
At refinement iteration 5 (OVERLAPS) 526/743 variables, 217/251 constraints. Problems are: Problem set: 120 solved, 405 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/743 variables, 405/656 constraints. Problems are: Problem set: 120 solved, 405 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 743/743 variables, and 672 constraints, problems are : Problem set: 120 solved, 405 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 405/525 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60734ms problems are : Problem set: 120 solved, 405 unsolved
Search for dead transitions found 120 dead transitions in 60749ms
Found 120 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 120 transitions
Dead transitions reduction (with SMT) removed 120 transitions
Starting structural reductions in LTL mode, iteration 1 : 217/269 places, 406/583 transitions.
Applied a total of 0 rules in 3 ms. Remains 217 /217 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61395 ms. Remains : 217/269 places, 406/583 transitions.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 406/406 transitions.
Applied a total of 0 rules in 4 ms. Remains 217 /217 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5267798212832484178.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4640621482033799974.kers'
[2026-05-25 09:29:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5267798212832484178.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4640621482033799974.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 406 rows 217 cols 1839 entries
Finished phase 1 with 187 SingleSign rule and 8 generalized
[2026-05-25 09:29:52] [INFO ] Computed 22 invariants in 1 ms
Computed 22 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4640621482033799974.kers
Total runtime 2 ms.
[2026-05-25 09:29:52] [INFO ] Implicit Places using invariants in 99 ms returned []
[2026-05-25 09:29:52] [INFO ] Invariant cache hit.
[2026-05-25 09:29:52] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
Running 405 sub problems to find dead transitions.
[2026-05-25 09:29:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/216 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 2 (OVERLAPS) 1/217 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 15/37 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 405 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 217/623 variables, and 40 constraints, problems are : Problem set: 0 solved, 405 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/217 constraints, PredecessorRefiner: 405/405 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 405 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/216 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 2 (OVERLAPS) 1/217 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 18/40 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 5 (OVERLAPS) 406/623 variables, 217/257 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/623 variables, 405/662 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/623 variables, 20/682 constraints. Problems are: Problem set: 0 solved, 405 unsolved
SMT process timed out in 60221ms, After SMT, problems are : Problem set: 0 solved, 405 unsolved
Search for dead transitions found 0 dead transitions in 60228ms
Finished structural reductions in LTL mode , in 1 iterations and 60486 ms. Remains : 217/217 places, 406/406 transitions.
Support contains 105 out of 217 places after structural reductions.
[2026-05-25 09:30:53] [INFO ] Flatten gal took : 77 ms
[2026-05-25 09:30:53] [INFO ] Flatten gal took : 30 ms
[2026-05-25 09:30:53] [INFO ] Input system was already deterministic with 406 transitions.
Support contains 101 out of 217 places (down from 105) after GAL structural reductions.
RANDOM walk for 40000 steps (18 resets) in 1981 ms. (20 steps per ms) remains 71/98 properties
BEST_FIRST walk for 4003 steps (11 resets) in 53 ms. (74 steps per ms) remains 69/71 properties
BEST_FIRST walk for 4004 steps (13 resets) in 22 ms. (174 steps per ms) remains 68/69 properties
BEST_FIRST walk for 4003 steps (10 resets) in 29 ms. (133 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (11 resets) in 47 ms. (83 steps per ms) remains 67/68 properties
BEST_FIRST walk for 4002 steps (12 resets) in 59 ms. (66 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (10 resets) in 26 ms. (148 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (9 resets) in 24 ms. (160 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (11 resets) in 22 ms. (174 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (11 resets) in 24 ms. (160 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (10 resets) in 22 ms. (174 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (11 resets) in 26 ms. (148 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (11 resets) in 43 ms. (91 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (11 resets) in 19 ms. (200 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (10 resets) in 32 ms. (121 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (11 resets) in 20 ms. (190 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (9 resets) in 16 ms. (235 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (9 resets) in 17 ms. (222 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (11 resets) in 20 ms. (190 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (10 resets) in 17 ms. (222 steps per ms) remains 65/67 properties
BEST_FIRST walk for 4003 steps (10 resets) in 19 ms. (200 steps per ms) remains 64/65 properties
BEST_FIRST walk for 4002 steps (11 resets) in 18 ms. (210 steps per ms) remains 63/64 properties
BEST_FIRST walk for 4004 steps (11 resets) in 17 ms. (222 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (12 resets) in 16 ms. (235 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (11 resets) in 16 ms. (235 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (9 resets) in 19 ms. (200 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (10 resets) in 14 ms. (266 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (9 resets) in 23 ms. (166 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (12 resets) in 20 ms. (190 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4001 steps (10 resets) in 18 ms. (210 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (10 resets) in 19 ms. (200 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (11 resets) in 15 ms. (250 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (11 resets) in 21 ms. (181 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (12 resets) in 27 ms. (142 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (12 resets) in 15 ms. (250 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (10 resets) in 20 ms. (190 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (10 resets) in 14 ms. (266 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (10 resets) in 13 ms. (285 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (12 resets) in 15 ms. (250 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (12 resets) in 20 ms. (190 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4001 steps (10 resets) in 21 ms. (181 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (10 resets) in 16 ms. (235 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (12 resets) in 20 ms. (190 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (9 resets) in 18 ms. (210 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (10 resets) in 14 ms. (266 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (10 resets) in 15 ms. (250 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (14 resets) in 18 ms. (210 steps per ms) remains 61/63 properties
BEST_FIRST walk for 4003 steps (12 resets) in 19 ms. (200 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (11 resets) in 19 ms. (200 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (11 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (11 resets) in 15 ms. (250 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (11 resets) in 18 ms. (210 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (9 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (11 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (9 resets) in 17 ms. (222 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (12 resets) in 19 ms. (200 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (13 resets) in 20 ms. (190 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (9 resets) in 19 ms. (200 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (13 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (11 resets) in 14 ms. (266 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (12 resets) in 20 ms. (190 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (12 resets) in 19 ms. (200 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (10 resets) in 18 ms. (210 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (13 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
[2026-05-25 09:30:54] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp81 is UNSAT
Problem AtomicPropp85 is UNSAT
Problem AtomicPropp87 is UNSAT
Problem AtomicPropp88 is UNSAT
At refinement iteration 1 (OVERLAPS) 119/188 variables, 12/12 constraints. Problems are: Problem set: 10 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 1/13 constraints. Problems are: Problem set: 10 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 0/13 constraints. Problems are: Problem set: 10 solved, 51 unsolved
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp86 is UNSAT
At refinement iteration 4 (OVERLAPS) 15/203 variables, 10/23 constraints. Problems are: Problem set: 16 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 0/23 constraints. Problems are: Problem set: 16 solved, 45 unsolved
At refinement iteration 6 (OVERLAPS) 395/598 variables, 203/226 constraints. Problems are: Problem set: 16 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/598 variables, 1/227 constraints. Problems are: Problem set: 16 solved, 45 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/598 variables, 1/228 constraints. Problems are: Problem set: 16 solved, 45 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/598 variables, 0/228 constraints. Problems are: Problem set: 16 solved, 45 unsolved
At refinement iteration 10 (OVERLAPS) 17/615 variables, 9/237 constraints. Problems are: Problem set: 16 solved, 45 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/615 variables, 0/237 constraints. Problems are: Problem set: 16 solved, 45 unsolved
At refinement iteration 12 (OVERLAPS) 8/623 variables, 5/242 constraints. Problems are: Problem set: 16 solved, 45 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/623 variables, 1/243 constraints. Problems are: Problem set: 16 solved, 45 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/623 variables, 0/243 constraints. Problems are: Problem set: 16 solved, 45 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/623 variables, and 243 constraints, problems are : Problem set: 16 solved, 45 unsolved in 5021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 61/60 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 16 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 16 solved, 45 unsolved
Problem AtomicPropp20 is UNSAT
At refinement iteration 1 (OVERLAPS) 122/184 variables, 12/12 constraints. Problems are: Problem set: 17 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 2/14 constraints. Problems are: Problem set: 17 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 4/18 constraints. Problems are: Problem set: 17 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 1/19 constraints. Problems are: Problem set: 17 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 3/22 constraints. Problems are: Problem set: 17 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/22 constraints. Problems are: Problem set: 17 solved, 44 unsolved
Problem AtomicPropp7 is UNSAT
At refinement iteration 7 (OVERLAPS) 19/203 variables, 10/32 constraints. Problems are: Problem set: 18 solved, 43 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 1/33 constraints. Problems are: Problem set: 18 solved, 43 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/33 constraints. Problems are: Problem set: 18 solved, 43 unsolved
At refinement iteration 10 (OVERLAPS) 395/598 variables, 203/236 constraints. Problems are: Problem set: 18 solved, 43 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/598 variables, 20/256 constraints. Problems are: Problem set: 18 solved, 43 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/598 variables, 4/260 constraints. Problems are: Problem set: 18 solved, 43 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/598 variables, 1/261 constraints. Problems are: Problem set: 18 solved, 43 unsolved
SMT process timed out in 10099ms, After SMT, problems are : Problem set: 18 solved, 43 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 62 out of 217 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 217/217 places, 406/406 transitions.
Graph (complete) has 739 edges and 217 vertex of which 214 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 214 transition count 389
Reduce places removed 13 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 201 transition count 387
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 32 place count 199 transition count 387
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 32 place count 199 transition count 379
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 48 place count 191 transition count 379
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 64 place count 175 transition count 358
Iterating global reduction 3 with 16 rules applied. Total rules applied 80 place count 175 transition count 358
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 116 place count 157 transition count 340
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -43
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 128 place count 151 transition count 383
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 3 with 36 rules applied. Total rules applied 164 place count 151 transition count 347
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 170 place count 151 transition count 341
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 176 place count 145 transition count 341
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 186 place count 145 transition count 331
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 189 place count 145 transition count 328
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 192 place count 142 transition count 328
Partial Free-agglomeration rule applied 19 times.
Drop transitions (Partial Free agglomeration) removed 19 transitions
Iterating global reduction 5 with 19 rules applied. Total rules applied 211 place count 142 transition count 328
Applied a total of 211 rules in 115 ms. Remains 142 /217 variables (removed 75) and now considering 328/406 (removed 78) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 142/217 places, 328/406 transitions.
RANDOM walk for 40000 steps (32 resets) in 390 ms. (102 steps per ms) remains 40/43 properties
BEST_FIRST walk for 4003 steps (18 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (20 resets) in 12 ms. (308 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (18 resets) in 13 ms. (285 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (14 resets) in 19 ms. (200 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4000 steps (15 resets) in 19 ms. (200 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (19 resets) in 25 ms. (153 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (23 resets) in 14 ms. (266 steps per ms) remains 36/40 properties
BEST_FIRST walk for 4003 steps (28 resets) in 13 ms. (285 steps per ms) remains 35/36 properties
BEST_FIRST walk for 4003 steps (25 resets) in 15 ms. (250 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (14 resets) in 14 ms. (266 steps per ms) remains 28/35 properties
BEST_FIRST walk for 4003 steps (21 resets) in 12 ms. (307 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (21 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (25 resets) in 13 ms. (285 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (21 resets) in 16 ms. (235 steps per ms) remains 27/28 properties
BEST_FIRST walk for 4003 steps (26 resets) in 9 ms. (400 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (30 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (15 resets) in 11 ms. (333 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (19 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (22 resets) in 11 ms. (333 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (27 resets) in 10 ms. (364 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (24 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (22 resets) in 8 ms. (444 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (29 resets) in 10 ms. (363 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (13 resets) in 8 ms. (444 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (22 resets) in 10 ms. (363 steps per ms) remains 26/27 properties
BEST_FIRST walk for 4001 steps (23 resets) in 10 ms. (363 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (21 resets) in 10 ms. (363 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (31 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (23 resets) in 8 ms. (444 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (26 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5406166219405018713.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11620236400935118797.kers'
[2026-05-25 09:31:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5406166219405018713.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11620236400935118797.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 328 rows 142 cols 1734 entries
Finished phase 1 with 112 SingleSign rule and 7 generalized
[2026-05-25 09:31:04] [INFO ] Computed 23 invariants in 1 ms
Computed 23 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11620236400935118797.kers
Total runtime 1 ms.
[2026-05-25 09:31:04] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 87/131 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 10/141 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (OVERLAPS) 328/469 variables, 141/166 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/469 variables, 8/174 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/469 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (OVERLAPS) 1/470 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/470 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 11 (OVERLAPS) 0/470 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 175 constraints, problems are : Problem set: 0 solved, 26 unsolved in 1432 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 142/142 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 87/131 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 10/141 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 328/469 variables, 141/168 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/469 variables, 8/176 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/469 variables, 13/189 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/469 variables, 2/191 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/469 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/469 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 13 (OVERLAPS) 1/470 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/470 variables, 13/206 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/470 variables, 2/208 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/470 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 17 (OVERLAPS) 0/470 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/470 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/470 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/470 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 21 (OVERLAPS) 0/470 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/470 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 23 (OVERLAPS) 0/470 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/470 variables, and 212 constraints, problems are : Problem set: 0 solved, 26 unsolved in 27432 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 142/142 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 28908ms problems are : Problem set: 0 solved, 26 unsolved
Parikh walk visited 21 properties in 11732 ms.
Support contains 19 out of 142 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 142/142 places, 328/328 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 142 transition count 319
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 19 place count 133 transition count 318
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 132 transition count 318
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 20 place count 132 transition count 316
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 24 place count 130 transition count 316
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 29 place count 125 transition count 310
Iterating global reduction 3 with 5 rules applied. Total rules applied 34 place count 125 transition count 310
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 31 rules applied. Total rules applied 65 place count 109 transition count 295
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 71 place count 106 transition count 321
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 79 place count 106 transition count 313
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 84 place count 106 transition count 308
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 89 place count 101 transition count 308
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 4 with 7 rules applied. Total rules applied 96 place count 101 transition count 355
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 111 place count 94 transition count 347
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 112 place count 94 transition count 346
Applied a total of 112 rules in 65 ms. Remains 94 /142 variables (removed 48) and now considering 346/328 (removed -18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 94/142 places, 346/328 transitions.
RANDOM walk for 40000 steps (24 resets) in 99 ms. (400 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (15 resets) in 49 ms. (800 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (51 resets) in 55 ms. (714 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (23 resets) in 56 ms. (701 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (185 resets) in 67 ms. (588 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (38 resets) in 62 ms. (634 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 754191 steps, run timeout after 3001 ms. (steps per millisecond=251 ) properties seen :0 out of 5
Probabilistic random walk after 754191 steps, saw 146997 distinct states, run finished after 3008 ms. (steps per millisecond=250 ) 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-10845405747508665807.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2697198165419818314.kers'
[2026-05-25 09:31:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10845405747508665807.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2697198165419818314.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 346 rows 94 cols 2146 entries
Finished phase 1 with 66 SingleSign rule and 6 generalized
[2026-05-25 09:31:48] [INFO ] Computed 22 invariants in 1 ms
Computed 22 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2697198165419818314.kers
Total runtime 2 ms.
[2026-05-25 09:31:48] [INFO ] State equation strengthened by 17 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 47/66 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 16/82 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 11/93 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 346/439 variables, 93/115 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 17/132 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1/440 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/440 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/440 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 440/440 variables, and 133 constraints, problems are : Problem set: 0 solved, 5 unsolved in 381 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 94/94 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 47/66 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 16/82 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 11/93 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 346/439 variables, 93/115 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 17/132 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/439 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/439 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 1/440 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/440 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/440 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/440 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/440 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 440/440 variables, and 139 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1925 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 94/94 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 2328ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 1 properties in 537 ms.
Support contains 15 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 346/346 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 94 transition count 345
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 93 transition count 345
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 91 transition count 343
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 91 transition count 342
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 9 place count 90 transition count 344
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 10 place count 90 transition count 343
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 11 place count 89 transition count 343
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 13 place count 89 transition count 398
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 23 place count 87 transition count 390
Applied a total of 23 rules in 25 ms. Remains 87 /94 variables (removed 7) and now considering 390/346 (removed -44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 87/94 places, 390/346 transitions.
RANDOM walk for 40000 steps (23 resets) in 119 ms. (333 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (19 resets) in 99 ms. (400 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (23 resets) in 87 ms. (454 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (74 resets) in 54 ms. (727 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (13 resets) in 91 ms. (434 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 656153 steps, run timeout after 3001 ms. (steps per millisecond=218 ) properties seen :0 out of 4
Probabilistic random walk after 656153 steps, saw 130882 distinct states, run finished after 3001 ms. (steps per millisecond=218 ) 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-16081504119232975133.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5584028381631036320.kers'
[2026-05-25 09:31:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16081504119232975133.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5584028381631036320.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 390 rows 87 cols 2489 entries
Finished phase 1 with 59 SingleSign rule and 6 generalized
[2026-05-25 09:31:54] [INFO ] Computed 22 invariants in 1 ms
Computed 22 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5584028381631036320.kers
Total runtime 1 ms.
[2026-05-25 09:31:54] [INFO ] State equation strengthened by 16 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 42/57 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 18/75 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 11/86 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 390/476 variables, 86/108 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 16/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/476 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1/477 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/477 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/477 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 477/477 variables, and 125 constraints, problems are : Problem set: 0 solved, 4 unsolved in 306 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 87/87 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 42/57 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 18/75 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 11/86 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 390/476 variables, 86/108 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 16/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/476 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/476 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/477 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/477 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/477 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/477 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/477 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 477/477 variables, and 130 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1018 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 87/87 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 1335ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 434 ms.
Support contains 15 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 390/390 transitions.
Applied a total of 0 rules in 6 ms. Remains 87 /87 variables (removed 0) and now considering 390/390 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 87/87 places, 390/390 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 390/390 transitions.
Applied a total of 0 rules in 6 ms. Remains 87 /87 variables (removed 0) and now considering 390/390 (removed 0) transitions.
[2026-05-25 09:31:56] [INFO ] Invariant cache hit.
[2026-05-25 09:31:56] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-25 09:31:56] [INFO ] Invariant cache hit.
[2026-05-25 09:31:56] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-25 09:31:56] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
[2026-05-25 09:31:57] [INFO ] Redundant transitions in 79 ms returned []
Running 382 sub problems to find dead transitions.
[2026-05-25 09:31:57] [INFO ] Invariant cache hit.
[2026-05-25 09:31:57] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 4 (OVERLAPS) 390/477 variables, 87/109 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 16/125 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/477 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/477 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 8 (OVERLAPS) 0/477 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 382 unsolved
No progress, stopping.
After SMT solving in domain Real declared 477/477 variables, and 127 constraints, problems are : Problem set: 0 solved, 382 unsolved in 26959 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 87/87 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 382 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 4 (OVERLAPS) 390/477 variables, 87/109 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 16/125 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/477 variables, 382/507 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/477 variables, 2/509 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 477/477 variables, and 509 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 87/87 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 57424ms problems are : Problem set: 0 solved, 382 unsolved
Search for dead transitions found 0 dead transitions in 57425ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57818 ms. Remains : 87/87 places, 390/390 transitions.
Successfully simplified 18 atomic propositions for a total of 16 simplifications.
FORMULA MedleyA-PT-19-CTLFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 09:32:54] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2026-05-25 09:32:54] [INFO ] Flatten gal took : 23 ms
FORMULA MedleyA-PT-19-CTLFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-19-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 09:32:54] [INFO ] Flatten gal took : 20 ms
[2026-05-25 09:32:54] [INFO ] Input system was already deterministic with 406 transitions.
Support contains 67 out of 217 places (down from 92) after GAL structural reductions.
FORMULA MedleyA-PT-19-CTLFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 22 stabilizing places and 24 stable transitions
Graph (complete) has 739 edges and 217 vertex of which 214 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.5 ms
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 406/406 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 185 transition count 367
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 185 transition count 367
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 184 transition count 365
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 184 transition count 365
Applied a total of 66 rules in 8 ms. Remains 184 /217 variables (removed 33) and now considering 365/406 (removed 41) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4876109760784858170.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13350268105022506535.kers'
[2026-05-25 09:32:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4876109760784858170.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13350268105022506535.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 365 rows 184 cols 1757 entries
Finished phase 1 with 154 SingleSign rule and 8 generalized
[2026-05-25 09:32:54] [INFO ] Computed 22 invariants in 1 ms
Computed 22 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13350268105022506535.kers
Total runtime 2 ms.
[2026-05-25 09:32:54] [INFO ] Implicit Places using invariants in 68 ms returned []
[2026-05-25 09:32:54] [INFO ] Invariant cache hit.
[2026-05-25 09:32:54] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
Running 364 sub problems to find dead transitions.
[2026-05-25 09:32:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (OVERLAPS) 1/184 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (OVERLAPS) 365/549 variables, 184/216 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 6/222 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/549 variables, 3/225 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 549/549 variables, and 225 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 364 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (OVERLAPS) 1/184 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (OVERLAPS) 365/549 variables, 184/222 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 364/586 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/549 variables, 1/587 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/549 variables, 3/590 constraints. Problems are: Problem set: 0 solved, 364 unsolved
SMT process timed out in 60208ms, After SMT, problems are : Problem set: 0 solved, 364 unsolved
Search for dead transitions found 0 dead transitions in 60208ms
Starting structural reductions in LTL mode, iteration 1 : 184/217 places, 365/406 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60498 ms. Remains : 184/217 places, 365/406 transitions.
[2026-05-25 09:33:55] [INFO ] Flatten gal took : 23 ms
[2026-05-25 09:33:55] [INFO ] Flatten gal took : 18 ms
[2026-05-25 09:33:55] [INFO ] Input system was already deterministic with 365 transitions.
[2026-05-25 09:33:55] [INFO ] Flatten gal took : 12 ms
[2026-05-25 09:33:55] [INFO ] Flatten gal took : 11 ms
[2026-05-25 09:33:55] [INFO ] Time to serialize gal into /tmp/CTLFireability15369696678615434270.gal : 11 ms
[2026-05-25 09:33:55] [INFO ] Time to serialize properties into /tmp/CTLFireability109145753732117616.ctl : 9 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/CTLFireability15369696678615434270.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability109145753732117616.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,5.64709e+11,26.8862,706148,2,51236,5,2.51261e+06,6,0,1101,2.65108e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-25 09:34:25] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:34:25] [INFO ] Applying decomposition
[2026-05-25 09:34:25] [INFO ] Flatten gal took : 9 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/graph18023236536262012860.txt' '-o' '/tmp/graph18023236536262012860.bin' '-w' '/tmp/graph18023236536262012860.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph18023236536262012860.bin' '-l' '-1' '-v' '-w' '/tmp/graph18023236536262012860.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:34:25] [INFO ] Decomposing Gal with order
[2026-05-25 09:34:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:34:25] [INFO ] Removed a total of 544 redundant transitions.
[2026-05-25 09:34:25] [INFO ] Flatten gal took : 86 ms
[2026-05-25 09:34:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 92 labels/synchronizations in 29 ms.
[2026-05-25 09:34:25] [INFO ] Time to serialize gal into /tmp/CTLFireability9490432254968451631.gal : 5 ms
[2026-05-25 09:34:25] [INFO ] Time to serialize properties into /tmp/CTLFireability669899279514690864.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/CTLFireability9490432254968451631.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability669899279514690864.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 -...261
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,5.64709e+11,0.256423,15084,1278,169,23430,1717,474,36744,108,6069,0


Converting to forward existential form...Done !
original formula: AF(AX(((i2.u16.p76==1) + EG(EF((((i2.u3.p26==0)||(i3.u13.p56==0))||((i8.u38.p182==0)||(i8.u38.p234==0))))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(((i2.u16.p76==1) + EG(E(TRUE U (((i2.u3.p26==0)||(i3.u13.p56==0))||((i8.u38.p182==0)||(i8.u3...184
Reverse transition relation is NOT exact ! Due to transitions t29, t77, t124, i0.i3.u54.t18, i0.i3.u54.t19, i2.t137, i2.t135, i2.t132, i2.t131, i2.t123, i2...859
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 406/406 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 187 transition count 370
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 187 transition count 370
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 186 transition count 368
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 186 transition count 368
Applied a total of 62 rules in 26 ms. Remains 186 /217 variables (removed 31) and now considering 368/406 (removed 38) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1717708107713496121.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3345422647564308878.kers'
[2026-05-25 09:34:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1717708107713496121.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3345422647564308878.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 368 rows 186 cols 1763 entries
Finished phase 1 with 156 SingleSign rule and 8 generalized
[2026-05-25 09:34:55] [INFO ] Computed 22 invariants in 2 ms
Computed 22 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-3345422647564308878.kers
Total runtime 3 ms.
[2026-05-25 09:34:55] [INFO ] Implicit Places using invariants in 133 ms returned []
[2026-05-25 09:34:56] [INFO ] Invariant cache hit.
[2026-05-25 09:34:56] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
Running 367 sub problems to find dead transitions.
[2026-05-25 09:34:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (OVERLAPS) 1/186 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (OVERLAPS) 368/554 variables, 186/218 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/554 variables, 6/224 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/554 variables, 3/227 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 554/554 variables, and 227 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 186/186 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 367 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (OVERLAPS) 1/186 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (OVERLAPS) 368/554 variables, 186/224 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/554 variables, 367/591 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/554 variables, 4/595 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 554/554 variables, and 596 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 186/186 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/3 constraints]
After SMT, in 60196ms problems are : Problem set: 0 solved, 367 unsolved
Search for dead transitions found 0 dead transitions in 60197ms
Starting structural reductions in LTL mode, iteration 1 : 186/217 places, 368/406 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60548 ms. Remains : 186/217 places, 368/406 transitions.
[2026-05-25 09:35:56] [INFO ] Flatten gal took : 28 ms
[2026-05-25 09:35:56] [INFO ] Flatten gal took : 29 ms
[2026-05-25 09:35:56] [INFO ] Input system was already deterministic with 368 transitions.
[2026-05-25 09:35:56] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:35:56] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:35:56] [INFO ] Time to serialize gal into /tmp/CTLFireability734403921077976047.gal : 3 ms
[2026-05-25 09:35:56] [INFO ] Time to serialize properties into /tmp/CTLFireability17828592088637433595.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/CTLFireability734403921077976047.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17828592088637433595.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.
Detected timeout of ITS tools.
[2026-05-25 09:36:26] [INFO ] Flatten gal took : 26 ms
[2026-05-25 09:36:26] [INFO ] Applying decomposition
[2026-05-25 09:36:26] [INFO ] Flatten gal took : 8 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/graph17018576875698022201.txt' '-o' '/tmp/graph17018576875698022201.bin' '-w' '/tmp/graph17018576875698022201.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17018576875698022201.bin' '-l' '-1' '-v' '-w' '/tmp/graph17018576875698022201.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:36:26] [INFO ] Decomposing Gal with order
[2026-05-25 09:36:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:36:26] [INFO ] Removed a total of 615 redundant transitions.
[2026-05-25 09:36:26] [INFO ] Flatten gal took : 22 ms
[2026-05-25 09:36:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 19 ms.
[2026-05-25 09:36:26] [INFO ] Time to serialize gal into /tmp/CTLFireability1533396591230448632.gal : 2 ms
[2026-05-25 09:36:26] [INFO ] Time to serialize properties into /tmp/CTLFireability272566381457138932.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/CTLFireability1533396591230448632.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability272566381457138932.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 -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.89017e+11,1.41161,52800,1885,169,94850,1906,533,196245,111,8782,0


Converting to forward existential form...Done !
original formula: ((AF(AX((((i3.u4.p26==1)&&(i2.u12.p50==1))&&((i9.u38.p182==1)&&(i9.u49.p234==1))))) * AF((i9.u54.p239==1))) + (A(((i0.i1.u2.p3==1)&&(!(((...375
=> equivalent forward existential formula: (([(FwdU((Init * !((!(EG(!(!(EX(!((((i3.u4.p26==1)&&(i2.u12.p50==1))&&((i9.u38.p182==1)&&(i9.u49.p234==1))))))))...891
Reverse transition relation is NOT exact ! Due to transitions t38, t43, t45, t78, t125, i0.i3.u55.t18, i0.i3.u55.t19, i2.t153, i2.t151, i2.t145, i2.t142, i...968
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
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 406/406 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 185 transition count 367
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 185 transition count 367
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 184 transition count 365
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 184 transition count 365
Applied a total of 66 rules in 7 ms. Remains 184 /217 variables (removed 33) and now considering 365/406 (removed 41) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8682798586264720780.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9929913886481413739.kers'
[2026-05-25 09:36:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8682798586264720780.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9929913886481413739.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 365 rows 184 cols 1757 entries
Finished phase 1 with 154 SingleSign rule and 8 generalized
[2026-05-25 09:36:56] [INFO ] Computed 22 invariants in 1 ms
Computed 22 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9929913886481413739.kers
Total runtime 1 ms.
[2026-05-25 09:36:57] [INFO ] Implicit Places using invariants in 146 ms returned []
[2026-05-25 09:36:57] [INFO ] Invariant cache hit.
[2026-05-25 09:36:57] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
Running 364 sub problems to find dead transitions.
[2026-05-25 09:36:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (OVERLAPS) 1/184 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (OVERLAPS) 365/549 variables, 184/216 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 6/222 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 549/549 variables, and 224 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 364 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (OVERLAPS) 1/184 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (OVERLAPS) 365/549 variables, 184/222 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 364/586 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/549 variables, 1/587 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 549/549 variables, and 590 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/2 constraints]
After SMT, in 60192ms problems are : Problem set: 0 solved, 364 unsolved
Search for dead transitions found 0 dead transitions in 60194ms
Starting structural reductions in LTL mode, iteration 1 : 184/217 places, 365/406 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60636 ms. Remains : 184/217 places, 365/406 transitions.
[2026-05-25 09:37:57] [INFO ] Flatten gal took : 19 ms
[2026-05-25 09:37:57] [INFO ] Flatten gal took : 13 ms
[2026-05-25 09:37:57] [INFO ] Input system was already deterministic with 365 transitions.
[2026-05-25 09:37:57] [INFO ] Flatten gal took : 12 ms
[2026-05-25 09:37:57] [INFO ] Flatten gal took : 12 ms
[2026-05-25 09:37:57] [INFO ] Time to serialize gal into /tmp/CTLFireability6341579192137828119.gal : 3 ms
[2026-05-25 09:37:57] [INFO ] Time to serialize properties into /tmp/CTLFireability5432010537956618682.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/CTLFireability6341579192137828119.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5432010537956618682.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,5.64709e+11,27.005,707168,2,51236,5,2.51261e+06,6,0,1101,2.65108e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-25 09:38:27] [INFO ] Flatten gal took : 25 ms
[2026-05-25 09:38:27] [INFO ] Applying decomposition
[2026-05-25 09:38:27] [INFO ] Flatten gal took : 41 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/graph13226456972727264643.txt' '-o' '/tmp/graph13226456972727264643.bin' '-w' '/tmp/graph13226456972727264643.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13226456972727264643.bin' '-l' '-1' '-v' '-w' '/tmp/graph13226456972727264643.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:38:27] [INFO ] Decomposing Gal with order
[2026-05-25 09:38:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:38:27] [INFO ] Removed a total of 607 redundant transitions.
[2026-05-25 09:38:27] [INFO ] Flatten gal took : 31 ms
[2026-05-25 09:38:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 7 ms.
[2026-05-25 09:38:27] [INFO ] Time to serialize gal into /tmp/CTLFireability5619467146781641860.gal : 2 ms
[2026-05-25 09:38:27] [INFO ] Time to serialize properties into /tmp/CTLFireability4636944939332240093.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/CTLFireability5619467146781641860.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4636944939332240093.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,5.64709e+11,0.277831,13484,1102,130,18367,1218,564,36932,113,3806,0


Converting to forward existential form...Done !
original formula: AX(AF((i4.u23.p114==1)))
=> equivalent forward existential formula: [FwdG(EY(Init),!((i4.u23.p114==1)))] = FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
(forward)formula 0,0,1.11476,46468,1,0,84702,2513,2172,178526,485,9890,149932
FORMULA MedleyA-PT-19-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 406/406 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 186 transition count 368
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 186 transition count 368
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 185 transition count 366
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 185 transition count 366
Applied a total of 64 rules in 24 ms. Remains 185 /217 variables (removed 32) and now considering 366/406 (removed 40) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10970845912167968591.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4437849448226315632.kers'
[2026-05-25 09:38:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10970845912167968591.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4437849448226315632.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 366 rows 185 cols 1759 entries
Finished phase 1 with 155 SingleSign rule and 8 generalized
[2026-05-25 09:38:29] [INFO ] Computed 22 invariants in 4 ms
Computed 22 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-4437849448226315632.kers
Total runtime 4 ms.
[2026-05-25 09:38:29] [INFO ] Implicit Places using invariants in 113 ms returned []
[2026-05-25 09:38:29] [INFO ] Invariant cache hit.
[2026-05-25 09:38:29] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
Running 365 sub problems to find dead transitions.
[2026-05-25 09:38:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 366/551 variables, 185/217 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 6/223 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 551/551 variables, and 223 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 365 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 366/551 variables, 185/223 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 365/588 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 4/592 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/551 variables, and 592 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60192ms problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 60193ms
Starting structural reductions in LTL mode, iteration 1 : 185/217 places, 366/406 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60583 ms. Remains : 185/217 places, 366/406 transitions.
[2026-05-25 09:39:29] [INFO ] Flatten gal took : 20 ms
[2026-05-25 09:39:29] [INFO ] Flatten gal took : 16 ms
[2026-05-25 09:39:29] [INFO ] Input system was already deterministic with 366 transitions.
[2026-05-25 09:39:29] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:39:29] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:39:29] [INFO ] Time to serialize gal into /tmp/CTLFireability2041710118264171814.gal : 3 ms
[2026-05-25 09:39:29] [INFO ] Time to serialize properties into /tmp/CTLFireability5667686060372149483.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/CTLFireability2041710118264171814.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5667686060372149483.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.
Detected timeout of ITS tools.
[2026-05-25 09:39:59] [INFO ] Flatten gal took : 20 ms
[2026-05-25 09:39:59] [INFO ] Applying decomposition
[2026-05-25 09:39:59] [INFO ] Flatten gal took : 16 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/graph10817784185403584464.txt' '-o' '/tmp/graph10817784185403584464.bin' '-w' '/tmp/graph10817784185403584464.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10817784185403584464.bin' '-l' '-1' '-v' '-w' '/tmp/graph10817784185403584464.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:39:59] [INFO ] Decomposing Gal with order
[2026-05-25 09:39:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:39:59] [INFO ] Removed a total of 687 redundant transitions.
[2026-05-25 09:39:59] [INFO ] Flatten gal took : 26 ms
[2026-05-25 09:39:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 15 ms.
[2026-05-25 09:39:59] [INFO ] Time to serialize gal into /tmp/CTLFireability2739723385215306770.gal : 3 ms
[2026-05-25 09:39:59] [INFO ] Time to serialize properties into /tmp/CTLFireability6630497980274931264.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/CTLFireability2739723385215306770.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6630497980274931264.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,6.63673e+11,0.294833,16648,1088,48,26746,995,573,43005,70,4519,0


Converting to forward existential form...Done !
original formula: AX(EG((i3.u2.p11==0)))
=> equivalent forward existential formula: [(EY(Init) * !(EG((i3.u2.p11==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t29, t77, t124, i2.t150, i2.t148, i2.t139, i2.u7.t156, i2.u7.t157, i2.u10.t158, i2.u10.t159, ...929
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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 217/217 places, 406/406 transitions.
Graph (complete) has 739 edges and 217 vertex of which 214 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 213 transition count 368
Reduce places removed 34 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 40 rules applied. Total rules applied 75 place count 179 transition count 362
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 78 place count 176 transition count 362
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 78 place count 176 transition count 354
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 94 place count 168 transition count 354
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 123 place count 139 transition count 316
Iterating global reduction 3 with 29 rules applied. Total rules applied 152 place count 139 transition count 316
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 152 place count 139 transition count 314
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 156 place count 137 transition count 314
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 157 place count 136 transition count 312
Iterating global reduction 3 with 1 rules applied. Total rules applied 158 place count 136 transition count 312
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 53 rules applied. Total rules applied 211 place count 108 transition count 287
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 212 place count 107 transition count 285
Iterating global reduction 3 with 1 rules applied. Total rules applied 213 place count 107 transition count 285
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 216 place count 107 transition count 282
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 222 place count 104 transition count 279
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 224 place count 102 transition count 277
Applied a total of 224 rules in 44 ms. Remains 102 /217 variables (removed 115) and now considering 277/406 (removed 129) transitions.
[2026-05-25 09:40:30] [INFO ] Flow matrix only has 276 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3957822428325776506.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-985773558125417669.kers'
[2026-05-25 09:40:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3957822428325776506.kers, --Pflows, --basisKERS=/tmp/petrispot-output-985773558125417669.kers]
Normalized transition count is 275 out of 276 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 275 rows 102 cols 1202 entries
Finished phase 1 with 78 SingleSign rule and 5 generalized
[2026-05-25 09:40:30] [INFO ] Computed 19 invariants in 1 ms
Computed 19 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-985773558125417669.kers
Total runtime 1 ms.
[2026-05-25 09:40:30] [INFO ] Implicit Places using invariants in 68 ms returned []
[2026-05-25 09:40:30] [INFO ] Flow matrix only has 276 transitions (discarded 1 similar events)
[2026-05-25 09:40:30] [INFO ] Invariant cache hit.
[2026-05-25 09:40:30] [INFO ] State equation strengthened by 29 read => feed constraints.
[2026-05-25 09:40:30] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2026-05-25 09:40:30] [INFO ] Redundant transitions in 53 ms returned []
Running 267 sub problems to find dead transitions.
[2026-05-25 09:40:30] [INFO ] Flow matrix only has 276 transitions (discarded 1 similar events)
[2026-05-25 09:40:30] [INFO ] Invariant cache hit.
[2026-05-25 09:40:30] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (OVERLAPS) 4/102 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 5 (OVERLAPS) 275/377 variables, 102/121 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 28/149 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/377 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 8 (OVERLAPS) 1/378 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/378 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 10 (OVERLAPS) 0/378 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 267 unsolved
No progress, stopping.
After SMT solving in domain Real declared 378/378 variables, and 150 constraints, problems are : Problem set: 0 solved, 267 unsolved in 15175 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 102/102 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 267 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (OVERLAPS) 4/102 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 5 (OVERLAPS) 275/377 variables, 102/121 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 28/149 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/377 variables, 267/416 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/377 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 9 (OVERLAPS) 1/378 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/378 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 267 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
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 378/378 variables, and 417 constraints, problems are : Problem set: 0 solved, 267 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 102/102 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45302ms problems are : Problem set: 0 solved, 267 unsolved
Search for dead transitions found 0 dead transitions in 45302ms
Starting structural reductions in SI_CTL mode, iteration 1 : 102/217 places, 277/406 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 45593 ms. Remains : 102/217 places, 277/406 transitions.
[2026-05-25 09:41:15] [INFO ] Flatten gal took : 18 ms
[2026-05-25 09:41:15] [INFO ] Flatten gal took : 12 ms
[2026-05-25 09:41:15] [INFO ] Input system was already deterministic with 277 transitions.
[2026-05-25 09:41:15] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:41:15] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:41:15] [INFO ] Time to serialize gal into /tmp/CTLFireability12006284001386001992.gal : 2 ms
[2026-05-25 09:41:15] [INFO ] Time to serialize properties into /tmp/CTLFireability13003162600012952531.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/CTLFireability12006284001386001992.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13003162600012952531.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,4.77603e+09,3.65512,108768,2,6211,5,490495,6,0,677,397559,0


Converting to forward existential form...Done !
original formula: EG(((p104==0)||(p156==0)))
=> equivalent forward existential formula: [FwdG(Init,((p104==0)||(p156==0)))] != FALSE
Hit Full ! (commute/partial/dont) 205/0/72
(forward)formula 0,1,4.88382,108768,1,0,10,490495,19,4,4562,397559,8
FORMULA MedleyA-PT-19-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 217/217 places, 406/406 transitions.
Graph (complete) has 739 edges and 217 vertex of which 214 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 213 transition count 378
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 28 rules applied. Total rules applied 53 place count 189 transition count 374
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 57 place count 187 transition count 372
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 60 place count 185 transition count 371
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 60 place count 185 transition count 360
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 82 place count 174 transition count 360
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 107 place count 149 transition count 329
Iterating global reduction 4 with 25 rules applied. Total rules applied 132 place count 149 transition count 329
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 134 place count 147 transition count 325
Iterating global reduction 4 with 2 rules applied. Total rules applied 136 place count 147 transition count 325
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 176 place count 127 transition count 305
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 177 place count 126 transition count 303
Iterating global reduction 4 with 1 rules applied. Total rules applied 178 place count 126 transition count 303
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 180 place count 126 transition count 301
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 184 place count 124 transition count 299
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 185 place count 123 transition count 298
Applied a total of 185 rules in 84 ms. Remains 123 /217 variables (removed 94) and now considering 298/406 (removed 108) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17828897785304294646.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4249467072292980795.kers'
[2026-05-25 09:41:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17828897785304294646.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4249467072292980795.kers]
Normalized transition count is 297 out of 298 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 297 rows 123 cols 1523 entries
Finished phase 1 with 93 SingleSign rule and 8 generalized
[2026-05-25 09:41:20] [INFO ] Computed 22 invariants in 1 ms
Computed 22 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4249467072292980795.kers
Total runtime 2 ms.
[2026-05-25 09:41:20] [INFO ] Implicit Places using invariants in 84 ms returned [1, 36, 78]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 88 ms to find 3 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 120/217 places, 298/406 transitions.
Applied a total of 0 rules in 6 ms. Remains 120 /120 variables (removed 0) and now considering 298/298 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 178 ms. Remains : 120/217 places, 298/406 transitions.
[2026-05-25 09:41:20] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:41:20] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:41:20] [INFO ] Input system was already deterministic with 298 transitions.
[2026-05-25 09:41:20] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:41:20] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:41:20] [INFO ] Time to serialize gal into /tmp/CTLFireability3238833246423289370.gal : 2 ms
[2026-05-25 09:41:20] [INFO ] Time to serialize properties into /tmp/CTLFireability13483534302674439681.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/CTLFireability3238833246423289370.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13483534302674439681.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,3.37419e+10,20.7095,515740,2,23135,5,2.00837e+06,6,0,778,2.18446e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-25 09:41:50] [INFO ] Flatten gal took : 21 ms
[2026-05-25 09:41:50] [INFO ] Applying decomposition
[2026-05-25 09:41:51] [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/graph15743943193080989695.txt' '-o' '/tmp/graph15743943193080989695.bin' '-w' '/tmp/graph15743943193080989695.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15743943193080989695.bin' '-l' '-1' '-v' '-w' '/tmp/graph15743943193080989695.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:41:51] [INFO ] Decomposing Gal with order
[2026-05-25 09:41:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:41:51] [INFO ] Removed a total of 539 redundant transitions.
[2026-05-25 09:41:51] [INFO ] Flatten gal took : 22 ms
[2026-05-25 09:41:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 57 labels/synchronizations in 3 ms.
[2026-05-25 09:41:51] [INFO ] Time to serialize gal into /tmp/CTLFireability1103578362773792093.gal : 2 ms
[2026-05-25 09:41:51] [INFO ] Time to serialize properties into /tmp/CTLFireability14834421064475939008.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/CTLFireability1103578362773792093.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14834421064475939008.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,3.37419e+10,0.155666,10948,518,115,13137,1001,367,32921,140,2902,0


Converting to forward existential form...Done !
original formula: (E((((!((AF((i0.u2.p42==1)) * (i6.u0.p73!=1))) * AF((i3.u9.p109==1))) * EG(!(((i0.u4.p49==1)&&(i0.u5.p52==1))))) + EF(((((i3.u8.p104==1)&...478
=> equivalent forward existential formula: ([(Init * !(E((((!((!(EG(!((i0.u2.p42==1)))) * (i6.u0.p73!=1))) * !(EG(!((i3.u9.p109==1))))) * EG(!(((i0.u4.p49=...567
Reverse transition relation is NOT exact ! Due to transitions t100, t194, t215, t218, t221, t271, t288, t289, i0.t85, i0.t1, i0.u3.t84, i0.u7.t82, i2.t54, ...705
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 217/217 places, 406/406 transitions.
Graph (complete) has 739 edges and 217 vertex of which 214 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 213 transition count 372
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 36 rules applied. Total rules applied 67 place count 183 transition count 366
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 70 place count 180 transition count 366
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 70 place count 180 transition count 357
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 88 place count 171 transition count 357
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 118 place count 141 transition count 319
Iterating global reduction 3 with 30 rules applied. Total rules applied 148 place count 141 transition count 319
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 148 place count 141 transition count 318
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 150 place count 140 transition count 318
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 152 place count 138 transition count 314
Iterating global reduction 3 with 2 rules applied. Total rules applied 154 place count 138 transition count 314
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 198 place count 115 transition count 293
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 199 place count 114 transition count 291
Iterating global reduction 3 with 1 rules applied. Total rules applied 200 place count 114 transition count 291
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 203 place count 114 transition count 288
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 209 place count 111 transition count 285
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 210 place count 110 transition count 284
Applied a total of 210 rules in 70 ms. Remains 110 /217 variables (removed 107) and now considering 284/406 (removed 122) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7304053690003325493.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7704479910542762411.kers'
[2026-05-25 09:42:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7304053690003325493.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7704479910542762411.kers]
Normalized transition count is 283 out of 284 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 283 rows 110 cols 1411 entries
Finished phase 1 with 84 SingleSign rule and 6 generalized
[2026-05-25 09:42:21] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7704479910542762411.kers
Total runtime 2 ms.
[2026-05-25 09:42:21] [INFO ] Implicit Places using invariants in 114 ms returned []
[2026-05-25 09:42:21] [INFO ] Invariant cache hit.
[2026-05-25 09:42:21] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-25 09:42:21] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
[2026-05-25 09:42:21] [INFO ] Redundant transitions in 36 ms returned []
Running 272 sub problems to find dead transitions.
[2026-05-25 09:42:21] [INFO ] Invariant cache hit.
[2026-05-25 09:42:21] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (OVERLAPS) 4/108 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (OVERLAPS) 1/109 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 7 (OVERLAPS) 283/392 variables, 109/129 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/392 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 10 (OVERLAPS) 1/393 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/393 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 12 (OVERLAPS) 1/394 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/394 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/394 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 15 (OVERLAPS) 0/394 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 152 constraints, problems are : Problem set: 0 solved, 272 unsolved in 24494 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 110/110 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 272 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (OVERLAPS) 4/108 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (OVERLAPS) 1/109 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 7 (OVERLAPS) 283/392 variables, 109/129 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/392 variables, 272/421 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/392 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/392 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 12 (OVERLAPS) 1/393 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 393/394 variables, and 423 constraints, problems are : Problem set: 0 solved, 272 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 110/110 constraints, ReadFeed: 20/21 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 54634ms problems are : Problem set: 0 solved, 272 unsolved
Search for dead transitions found 0 dead transitions in 54635ms
Starting structural reductions in SI_CTL mode, iteration 1 : 110/217 places, 284/406 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 55011 ms. Remains : 110/217 places, 284/406 transitions.
[2026-05-25 09:43:16] [INFO ] Flatten gal took : 21 ms
[2026-05-25 09:43:16] [INFO ] Flatten gal took : 16 ms
[2026-05-25 09:43:16] [INFO ] Input system was already deterministic with 284 transitions.
[2026-05-25 09:43:16] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:43:16] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:43:16] [INFO ] Time to serialize gal into /tmp/CTLFireability4123008700073764952.gal : 1 ms
[2026-05-25 09:43:16] [INFO ] Time to serialize properties into /tmp/CTLFireability8547423059962403965.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/CTLFireability4123008700073764952.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8547423059962403965.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.26849e+10,4.72991,139924,2,7251,5,609029,6,0,720,502310,0


Converting to forward existential form...Done !
original formula: AF(EG(EF((!(A((((p182==1)&&(p234==1))&&((p238==1)&&(p263==1))) U (((p94==1)&&(p110==1))&&((p182==1)&&(p212==1))))) + ((p232==0)&&(((p26==...198
=> equivalent forward existential formula: [FwdG(Init,!(EG(E(TRUE U (!(!((E(!((((p94==1)&&(p110==1))&&((p182==1)&&(p212==1)))) U (!((((p182==1)&&(p234==1))...372
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t5, t8, t9, t24, t25, t26, t27, t34, t46, t48, t49, t57, t58, t73, t75, t76, t86, t87...431
Detected timeout of ITS tools.
[2026-05-25 09:43:46] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:43:46] [INFO ] Applying decomposition
[2026-05-25 09:43:46] [INFO ] Flatten gal took : 7 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/graph13464307301103230600.txt' '-o' '/tmp/graph13464307301103230600.bin' '-w' '/tmp/graph13464307301103230600.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13464307301103230600.bin' '-l' '-1' '-v' '-w' '/tmp/graph13464307301103230600.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:43:46] [INFO ] Decomposing Gal with order
[2026-05-25 09:43:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:43:46] [INFO ] Removed a total of 648 redundant transitions.
[2026-05-25 09:43:46] [INFO ] Flatten gal took : 13 ms
[2026-05-25 09:43:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 3 ms.
[2026-05-25 09:43:46] [INFO ] Time to serialize gal into /tmp/CTLFireability17599477489493126741.gal : 1 ms
[2026-05-25 09:43:46] [INFO ] Time to serialize properties into /tmp/CTLFireability14729740859234172252.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/CTLFireability17599477489493126741.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14729740859234172252.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.26849e+10,0.04448,5924,204,31,3935,168,313,5602,62,419,0


Converting to forward existential form...Done !
original formula: AF(EG(EF((!(A((((i5.u20.p182==1)&&(i5.u26.p234==1))&&((i7.u30.p238==1)&&(i7.u33.p263==1))) U (((i2.u10.p94==1)&&(i2.u12.p110==1))&&((i5.u...287
=> equivalent forward existential formula: [FwdG(Init,!(EG(E(TRUE U (!(!((E(!((((i2.u10.p94==1)&&(i2.u12.p110==1))&&((i5.u20.p182==1)&&(i6.u25.p212==1)))) ...517
Reverse transition relation is NOT exact ! Due to transitions t86, t95, t102, t120, t178, t188, t204, i0.t58, i0.u9.t57, i1.t76, i1.t1, i1.u1.t75, i1.u5.t7...423
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
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,1,1.12409,49000,1,0,76216,679,2091,174238,298,1640,90230
FORMULA MedleyA-PT-19-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 406/406 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 186 transition count 368
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 186 transition count 368
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 185 transition count 366
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 185 transition count 366
Applied a total of 64 rules in 4 ms. Remains 185 /217 variables (removed 32) and now considering 366/406 (removed 40) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17502075620974644059.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6736998605024876888.kers'
[2026-05-25 09:43:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17502075620974644059.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6736998605024876888.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 366 rows 185 cols 1759 entries
Finished phase 1 with 155 SingleSign rule and 8 generalized
[2026-05-25 09:43:47] [INFO ] Computed 22 invariants in 1 ms
Computed 22 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6736998605024876888.kers
Total runtime 3 ms.
[2026-05-25 09:43:47] [INFO ] Implicit Places using invariants in 98 ms returned []
[2026-05-25 09:43:47] [INFO ] Invariant cache hit.
[2026-05-25 09:43:47] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
Running 365 sub problems to find dead transitions.
[2026-05-25 09:43:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 366/551 variables, 185/217 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 6/223 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 551/551 variables, and 225 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 365 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 366/551 variables, 185/223 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 365/588 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 5/593 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/551 variables, 3/596 constraints. Problems are: Problem set: 0 solved, 365 unsolved
SMT process timed out in 60209ms, After SMT, problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 60212ms
Starting structural reductions in LTL mode, iteration 1 : 185/217 places, 366/406 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60530 ms. Remains : 185/217 places, 366/406 transitions.
[2026-05-25 09:44:48] [INFO ] Flatten gal took : 15 ms
[2026-05-25 09:44:48] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:44:48] [INFO ] Input system was already deterministic with 366 transitions.
[2026-05-25 09:44:48] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:44:48] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:44:48] [INFO ] Time to serialize gal into /tmp/CTLFireability9327298507500892080.gal : 2 ms
[2026-05-25 09:44:48] [INFO ] Time to serialize properties into /tmp/CTLFireability2747119692720281334.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/CTLFireability9327298507500892080.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2747119692720281334.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.
Detected timeout of ITS tools.
[2026-05-25 09:45:18] [INFO ] Flatten gal took : 17 ms
[2026-05-25 09:45:18] [INFO ] Applying decomposition
[2026-05-25 09:45:18] [INFO ] Flatten gal took : 15 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/graph2084763844309842500.txt' '-o' '/tmp/graph2084763844309842500.bin' '-w' '/tmp/graph2084763844309842500.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2084763844309842500.bin' '-l' '-1' '-v' '-w' '/tmp/graph2084763844309842500.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:45:18] [INFO ] Decomposing Gal with order
[2026-05-25 09:45:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:45:18] [INFO ] Removed a total of 679 redundant transitions.
[2026-05-25 09:45:18] [INFO ] Flatten gal took : 18 ms
[2026-05-25 09:45:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 3 ms.
[2026-05-25 09:45:18] [INFO ] Time to serialize gal into /tmp/CTLFireability15849019796121781315.gal : 2 ms
[2026-05-25 09:45:18] [INFO ] Time to serialize properties into /tmp/CTLFireability8345097051858777203.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/CTLFireability15849019796121781315.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8345097051858777203.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,6.6069e+11,1.52095,60772,1764,58,111307,898,584,281041,70,4249,0


Converting to forward existential form...Done !
original formula: EG(((E(EG(EF((i5.u21.p103==1))) U EF(AG((i2.u16.p66==1)))) * E(AG((((i7.u45.p205==1)&&(i7.u46.p208==1))||(i3.i1.i1.u55.p251==1))) U !((((...410
=> equivalent forward existential formula: [FwdG(Init,((E(EG(E(TRUE U (i5.u21.p103==1))) U E(TRUE U !(E(TRUE U !((i2.u16.p66==1)))))) * E(!(E(TRUE U !((((i...495
Reverse transition relation is NOT exact ! Due to transitions t9, t44, t77, t125, i0.u54.t20, i0.u54.t235, i1.t151, i1.t149, i1.t140, i1.u6.t159, i1.u6.t16...884
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 217/217 places, 406/406 transitions.
Graph (complete) has 739 edges and 217 vertex of which 214 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 213 transition count 373
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 35 rules applied. Total rules applied 65 place count 184 transition count 367
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 69 place count 181 transition count 366
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 70 place count 180 transition count 366
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 70 place count 180 transition count 357
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 88 place count 171 transition count 357
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 112 place count 147 transition count 326
Iterating global reduction 4 with 24 rules applied. Total rules applied 136 place count 147 transition count 326
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 136 place count 147 transition count 325
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 138 place count 146 transition count 325
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 188 place count 120 transition count 301
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 189 place count 119 transition count 299
Iterating global reduction 4 with 1 rules applied. Total rules applied 190 place count 119 transition count 299
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 193 place count 119 transition count 296
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 199 place count 116 transition count 293
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 201 place count 114 transition count 291
Applied a total of 201 rules in 25 ms. Remains 114 /217 variables (removed 103) and now considering 291/406 (removed 115) transitions.
[2026-05-25 09:45:48] [INFO ] Flow matrix only has 290 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-351611418903713300.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8317577826117212658.kers'
[2026-05-25 09:45:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-351611418903713300.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8317577826117212658.kers]
Normalized transition count is 289 out of 290 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 289 rows 114 cols 1243 entries
Finished phase 1 with 88 SingleSign rule and 6 generalized
[2026-05-25 09:45:48] [INFO ] Computed 20 invariants in 2 ms
Computed 20 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8317577826117212658.kers
Total runtime 3 ms.
[2026-05-25 09:45:48] [INFO ] Implicit Places using invariants in 98 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 99 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 113/217 places, 291/406 transitions.
Applied a total of 0 rules in 9 ms. Remains 113 /113 variables (removed 0) and now considering 291/291 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 134 ms. Remains : 113/217 places, 291/406 transitions.
[2026-05-25 09:45:48] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:45:48] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:45:48] [INFO ] Input system was already deterministic with 291 transitions.
[2026-05-25 09:45:48] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:45:48] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:45:48] [INFO ] Time to serialize gal into /tmp/CTLFireability8416961460002717152.gal : 1 ms
[2026-05-25 09:45:48] [INFO ] Time to serialize properties into /tmp/CTLFireability6670794540042334711.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/CTLFireability8416961460002717152.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6670794540042334711.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,7.92284e+09,6.2925,183692,2,8128,5,698442,6,0,737,635026,0


Converting to forward existential form...Done !
original formula: E(!(E((!(((p30==1)&&(p142==1))) * E((p66==1) U (p81==1))) U (EG((p149==1)) * (((p219!=1)||((p104==1)&&(p131==1)))||((p104==1)&&(p125==1))...171
=> equivalent forward existential formula: [(FwdU(Init,!(E((!(((p30==1)&&(p142==1))) * E((p66==1) U (p81==1))) U (EG((p149==1)) * (((p219!=1)||((p104==1)&&...217
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t5, t6, t7, t9, t10, t13, t15, t16, t17, t19, t21, t23, t24, t25, t26, t32, t35, t38,...386
Detected timeout of ITS tools.
[2026-05-25 09:46:18] [INFO ] Flatten gal took : 16 ms
[2026-05-25 09:46:18] [INFO ] Applying decomposition
[2026-05-25 09:46:18] [INFO ] Flatten gal took : 14 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/graph13894636086710551619.txt' '-o' '/tmp/graph13894636086710551619.bin' '-w' '/tmp/graph13894636086710551619.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13894636086710551619.bin' '-l' '-1' '-v' '-w' '/tmp/graph13894636086710551619.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:46:18] [INFO ] Decomposing Gal with order
[2026-05-25 09:46:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:46:18] [INFO ] Removed a total of 620 redundant transitions.
[2026-05-25 09:46:18] [INFO ] Flatten gal took : 30 ms
[2026-05-25 09:46:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 57 labels/synchronizations in 3 ms.
[2026-05-25 09:46:18] [INFO ] Time to serialize gal into /tmp/CTLFireability8360264841337977133.gal : 1 ms
[2026-05-25 09:46:18] [INFO ] Time to serialize properties into /tmp/CTLFireability8233383564087768113.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/CTLFireability8360264841337977133.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8233383564087768113.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,7.92284e+09,0.109401,9200,405,57,10798,612,397,17881,84,1779,0


Converting to forward existential form...Done !
original formula: E(!(E((!(((i0.u1.p30==1)&&(i2.u17.p142==1))) * E((i0.u7.p66==1) U (i3.u11.p81==1))) U (EG((i2.u16.p149==1)) * (((i5.i0.u27.p219!=1)||((i2...246
=> equivalent forward existential formula: [(FwdU(Init,!(E((!(((i0.u1.p30==1)&&(i2.u17.p142==1))) * E((i0.u7.p66==1) U (i3.u11.p81==1))) U (EG((i2.u16.p149...292
Reverse transition relation is NOT exact ! Due to transitions t5, t26, t124, t211, t278, t290, i0.t65, i0.t61, i0.u0.t84, i0.u1.t83, i0.u8.t60, i1.t78, i1....576
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 406/406 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 189 transition count 371
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 189 transition count 371
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 188 transition count 369
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 188 transition count 369
Applied a total of 58 rules in 36 ms. Remains 188 /217 variables (removed 29) and now considering 369/406 (removed 37) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18236008639680069236.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14040371520074526409.kers'
[2026-05-25 09:46:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18236008639680069236.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14040371520074526409.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 369 rows 188 cols 1765 entries
Finished phase 1 with 158 SingleSign rule and 8 generalized
[2026-05-25 09:46:48] [INFO ] Computed 22 invariants in 2 ms
Computed 22 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-14040371520074526409.kers
Total runtime 3 ms.
[2026-05-25 09:46:49] [INFO ] Implicit Places using invariants in 82 ms returned []
[2026-05-25 09:46:49] [INFO ] Invariant cache hit.
[2026-05-25 09:46:49] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
Running 368 sub problems to find dead transitions.
[2026-05-25 09:46:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (OVERLAPS) 369/557 variables, 188/222 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/557 variables, 6/228 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 557/557 variables, and 230 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 18/40 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (OVERLAPS) 369/557 variables, 188/228 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/557 variables, 368/596 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/557 variables, 7/603 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 557/557 variables, and 604 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/2 constraints]
After SMT, in 60176ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 60176ms
Starting structural reductions in LTL mode, iteration 1 : 188/217 places, 369/406 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60490 ms. Remains : 188/217 places, 369/406 transitions.
[2026-05-25 09:47:49] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:47:49] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:47:49] [INFO ] Input system was already deterministic with 369 transitions.
[2026-05-25 09:47:49] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:47:49] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:47:49] [INFO ] Time to serialize gal into /tmp/CTLFireability8367832793707128297.gal : 2 ms
[2026-05-25 09:47:49] [INFO ] Time to serialize properties into /tmp/CTLFireability11639931560289376311.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/CTLFireability8367832793707128297.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11639931560289376311.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.
Detected timeout of ITS tools.
[2026-05-25 09:48:19] [INFO ] Flatten gal took : 25 ms
[2026-05-25 09:48:19] [INFO ] Applying decomposition
[2026-05-25 09:48:19] [INFO ] Flatten gal took : 7 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/graph7107437720617752041.txt' '-o' '/tmp/graph7107437720617752041.bin' '-w' '/tmp/graph7107437720617752041.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7107437720617752041.bin' '-l' '-1' '-v' '-w' '/tmp/graph7107437720617752041.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:48:19] [INFO ] Decomposing Gal with order
[2026-05-25 09:48:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:48:19] [INFO ] Removed a total of 603 redundant transitions.
[2026-05-25 09:48:19] [INFO ] Flatten gal took : 16 ms
[2026-05-25 09:48:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 4 ms.
[2026-05-25 09:48:19] [INFO ] Time to serialize gal into /tmp/CTLFireability11408229196537979929.gal : 3 ms
[2026-05-25 09:48:19] [INFO ] Time to serialize properties into /tmp/CTLFireability12763241289255790656.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/CTLFireability11408229196537979929.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12763241289255790656.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,8.89774e+11,0.76361,33652,1950,215,59087,2270,593,138565,116,11338,0


Converting to forward existential form...Done !
original formula: AG((EX(((((i4.u21.p94==0)||(i4.u24.p110==0)) * EG((((i5.u22.p104==0)||(i5.u33.p156==0))||((i0.u54.p238==0)||(i0.u61.p268==0))))) * (AX((i...348
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!((E(!(!(E(TRUE U !((i3.u3.p13==1))))) U (!((EG((i5.u22.p99==1)) + EX((i5.u22.p102==1)...567
Reverse transition relation is NOT exact ! Due to transitions t9, t29, t77, t126, i0.t168, i0.t139, i0.t137, i0.t134, i0.t133, i0.t125, i0.u2.t167, i0.u4.t...1171
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 217/217 places, 406/406 transitions.
Graph (complete) has 739 edges and 217 vertex of which 214 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 213 transition count 373
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 35 rules applied. Total rules applied 65 place count 184 transition count 367
Reduce places removed 3 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 6 rules applied. Total rules applied 71 place count 181 transition count 364
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 74 place count 178 transition count 364
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 74 place count 178 transition count 356
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 90 place count 170 transition count 356
Discarding 26 places :
Symmetric choice reduction at 4 with 26 rule applications. Total rules 116 place count 144 transition count 323
Iterating global reduction 4 with 26 rules applied. Total rules applied 142 place count 144 transition count 323
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 142 place count 144 transition count 320
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 148 place count 141 transition count 320
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 51 rules applied. Total rules applied 199 place count 114 transition count 296
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 201 place count 112 transition count 292
Iterating global reduction 4 with 2 rules applied. Total rules applied 203 place count 112 transition count 292
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 206 place count 112 transition count 289
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 212 place count 109 transition count 286
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 213 place count 108 transition count 285
Applied a total of 213 rules in 28 ms. Remains 108 /217 variables (removed 109) and now considering 285/406 (removed 121) transitions.
[2026-05-25 09:48:49] [INFO ] Flow matrix only has 284 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1870159669791973011.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8165680563554658563.kers'
[2026-05-25 09:48:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1870159669791973011.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8165680563554658563.kers]
Normalized transition count is 283 out of 284 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 283 rows 108 cols 1153 entries
Finished phase 1 with 84 SingleSign rule and 5 generalized
[2026-05-25 09:48:49] [INFO ] Computed 19 invariants in 0 ms
Computed 19 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8165680563554658563.kers
Total runtime 1 ms.
[2026-05-25 09:48:49] [INFO ] Implicit Places using invariants in 51 ms returned []
[2026-05-25 09:48:49] [INFO ] Flow matrix only has 284 transitions (discarded 1 similar events)
[2026-05-25 09:48:49] [INFO ] Invariant cache hit.
[2026-05-25 09:48:49] [INFO ] State equation strengthened by 124 read => feed constraints.
[2026-05-25 09:48:49] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
[2026-05-25 09:48:50] [INFO ] Redundant transitions in 39 ms returned []
Running 284 sub problems to find dead transitions.
[2026-05-25 09:48:50] [INFO ] Flow matrix only has 284 transitions (discarded 1 similar events)
[2026-05-25 09:48:50] [INFO ] Invariant cache hit.
[2026-05-25 09:48:50] [INFO ] State equation strengthened by 124 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (OVERLAPS) 1/108 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 283/391 variables, 108/127 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 123/250 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 1/392 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 0/392 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 251 constraints, problems are : Problem set: 0 solved, 284 unsolved in 20721 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 108/108 constraints, ReadFeed: 124/124 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (OVERLAPS) 1/108 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 283/391 variables, 108/127 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 123/250 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 284/534 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (OVERLAPS) 1/392 variables, 1/535 constraints. Problems are: Problem set: 0 solved, 284 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 392/392 variables, and 535 constraints, problems are : Problem set: 0 solved, 284 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 108/108 constraints, ReadFeed: 124/124 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50880ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 50880ms
Starting structural reductions in SI_CTL mode, iteration 1 : 108/217 places, 285/406 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 51212 ms. Remains : 108/217 places, 285/406 transitions.
[2026-05-25 09:49:40] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:49:40] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:49:40] [INFO ] Input system was already deterministic with 285 transitions.
[2026-05-25 09:49:40] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:49:40] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:49:40] [INFO ] Time to serialize gal into /tmp/CTLFireability15112731190612678572.gal : 3 ms
[2026-05-25 09:49:40] [INFO ] Time to serialize properties into /tmp/CTLFireability15149489040647275189.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/CTLFireability15112731190612678572.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15149489040647275189.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,4.42368e+09,1.9338,66812,2,6708,5,274616,6,0,710,197161,0


Converting to forward existential form...Done !
original formula: (AG(EF(!(A((p159==1) U (p199==1))))) + EG(!(E((p73==1) U (p227==1)))))
=> equivalent forward existential formula: [(FwdU((Init * !(EG(!(E((p73==1) U (p227==1)))))),TRUE) * !(E(TRUE U !(!((E(!((p199==1)) U (!((p159==1)) * !((p1...198
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t5, t7, t10, t13, t25, t26, t27, t28, t34, t46, t48, t49, t55, t56, t59, t71, t73, t7...298
Detected timeout of ITS tools.
[2026-05-25 09:50:11] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:50:11] [INFO ] Applying decomposition
[2026-05-25 09:50:11] [INFO ] Flatten gal took : 5 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/graph6085673012321748587.txt' '-o' '/tmp/graph6085673012321748587.bin' '-w' '/tmp/graph6085673012321748587.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6085673012321748587.bin' '-l' '-1' '-v' '-w' '/tmp/graph6085673012321748587.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:50:11] [INFO ] Decomposing Gal with order
[2026-05-25 09:50:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:50:11] [INFO ] Removed a total of 553 redundant transitions.
[2026-05-25 09:50:11] [INFO ] Flatten gal took : 18 ms
[2026-05-25 09:50:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 4 ms.
[2026-05-25 09:50:11] [INFO ] Time to serialize gal into /tmp/CTLFireability9186045502531081679.gal : 2 ms
[2026-05-25 09:50:11] [INFO ] Time to serialize properties into /tmp/CTLFireability17839357182541951498.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/CTLFireability9186045502531081679.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17839357182541951498.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,4.42368e+09,0.053969,6440,265,116,4670,683,385,6414,137,1707,0


Converting to forward existential form...Done !
original formula: (AG(EF(!(A((i4.i1.u15.p159==1) U (i4.i0.u16.p199==1))))) + EG(!(E((i1.u5.p73==1) U (i5.i0.u21.p227==1)))))
=> equivalent forward existential formula: [(FwdU((Init * !(EG(!(E((i1.u5.p73==1) U (i5.i0.u21.p227==1)))))),TRUE) * !(E(TRUE U !(!((E(!((i4.i0.u16.p199==1...254
Reverse transition relation is NOT exact ! Due to transitions t87, t213, t228, t272, i0.t74, i0.t1, i0.u0.t73, i0.u4.t71, i1.u5.t55, i1.u5.t56, i1.u5.t59, ...444
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
(forward)formula 0,1,5.23744,148332,1,0,208572,10289,2375,893697,748,56155,129383
FORMULA MedleyA-PT-19-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 406/406 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 188 transition count 371
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 188 transition count 371
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 187 transition count 369
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 187 transition count 369
Applied a total of 60 rules in 20 ms. Remains 187 /217 variables (removed 30) and now considering 369/406 (removed 37) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15280151456518690182.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11711951915554680399.kers'
[2026-05-25 09:50:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15280151456518690182.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11711951915554680399.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 369 rows 187 cols 1765 entries
Finished phase 1 with 157 SingleSign rule and 8 generalized
[2026-05-25 09:50:16] [INFO ] Computed 22 invariants in 1 ms
Computed 22 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11711951915554680399.kers
Total runtime 2 ms.
[2026-05-25 09:50:16] [INFO ] Implicit Places using invariants in 161 ms returned []
[2026-05-25 09:50:16] [INFO ] Invariant cache hit.
[2026-05-25 09:50:16] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
Running 368 sub problems to find dead transitions.
[2026-05-25 09:50:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 1/187 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (OVERLAPS) 369/556 variables, 187/219 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/556 variables, 6/225 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 556/556 variables, and 227 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 187/187 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 1/187 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (OVERLAPS) 369/556 variables, 187/225 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/556 variables, 368/593 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/556 variables, 7/600 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/556 variables, 2/602 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 556/556 variables, and 602 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 187/187 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60184ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 60185ms
Starting structural reductions in LTL mode, iteration 1 : 187/217 places, 369/406 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60617 ms. Remains : 187/217 places, 369/406 transitions.
[2026-05-25 09:51:16] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:51:16] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:51:17] [INFO ] Input system was already deterministic with 369 transitions.
[2026-05-25 09:51:17] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:51:17] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:51:17] [INFO ] Time to serialize gal into /tmp/CTLFireability10158205476926938691.gal : 2 ms
[2026-05-25 09:51:17] [INFO ] Time to serialize properties into /tmp/CTLFireability5434899669458446175.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/CTLFireability10158205476926938691.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5434899669458446175.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.
Detected timeout of ITS tools.
[2026-05-25 09:51:47] [INFO ] Flatten gal took : 14 ms
[2026-05-25 09:51:47] [INFO ] Applying decomposition
[2026-05-25 09:51:47] [INFO ] Flatten gal took : 5 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/graph5207221425329236765.txt' '-o' '/tmp/graph5207221425329236765.bin' '-w' '/tmp/graph5207221425329236765.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5207221425329236765.bin' '-l' '-1' '-v' '-w' '/tmp/graph5207221425329236765.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:51:47] [INFO ] Decomposing Gal with order
[2026-05-25 09:51:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:51:47] [INFO ] Removed a total of 549 redundant transitions.
[2026-05-25 09:51:47] [INFO ] Flatten gal took : 15 ms
[2026-05-25 09:51:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 78 labels/synchronizations in 4 ms.
[2026-05-25 09:51:47] [INFO ] Time to serialize gal into /tmp/CTLFireability17554551263984033981.gal : 2 ms
[2026-05-25 09:51:47] [INFO ] Time to serialize properties into /tmp/CTLFireability3043373204420713549.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/CTLFireability17554551263984033981.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3043373204420713549.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,7.08372e+11,1.59083,61624,2769,398,111769,9926,573,237567,132,64352,0


Converting to forward existential form...Done !
original formula: EF(((EG(((AG((i4.u54.p242==1)) * (i6.i0.u28.p120==1)) * (((i4.u22.p104!=1)||(i4.u22.p156!=1))||((i9.u39.p182!=1)||(i8.i0.u47.p206!=1)))))...353
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * (EG(((!(E(TRUE U !((i4.u54.p242==1)))) * (i6.i0.u28.p120==1)) * (((i4.u22.p104!=1)||(i4.u22...626
Reverse transition relation is NOT exact ! Due to transitions t9, t29, t77, t127, i0.i4.t19, i0.i4.u56.t18, i1.t138, i1.t134, i1.t126, i1.u4.t164, i1.u15.t...1148
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
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Detected timeout of ITS tools.
[2026-05-25 09:52:17] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:52:17] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:52:17] [INFO ] Applying decomposition
[2026-05-25 09:52:17] [INFO ] Flatten gal took : 6 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/graph14493655324874267360.txt' '-o' '/tmp/graph14493655324874267360.bin' '-w' '/tmp/graph14493655324874267360.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14493655324874267360.bin' '-l' '-1' '-v' '-w' '/tmp/graph14493655324874267360.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:52:17] [INFO ] Decomposing Gal with order
[2026-05-25 09:52:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:52:17] [INFO ] Removed a total of 699 redundant transitions.
[2026-05-25 09:52:17] [INFO ] Flatten gal took : 17 ms
[2026-05-25 09:52:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 57 labels/synchronizations in 3 ms.
[2026-05-25 09:52:17] [INFO ] Time to serialize gal into /tmp/CTLFireability4858403435017850392.gal : 2 ms
[2026-05-25 09:52:17] [INFO ] Time to serialize properties into /tmp/CTLFireability6870183272560077312.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/CTLFireability4858403435017850392.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6870183272560077312.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 8 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,4.77679e+12,67.9515,1481044,17720,2211,2.12369e+06,91210,766,8.28462e+06,142,923292,0


Converting to forward existential form...Done !
original formula: AF(AX(((i1.i1.u18.p76==1) + EG(EF((((i1.i0.u4.p26==0)||(i3.u14.p56==0))||((i10.u41.p182==0)||(i10.u57.p234==0))))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(((i1.i1.u18.p76==1) + EG(E(TRUE U (((i1.i0.u4.p26==0)||(i3.u14.p56==0))||((i10.u41.p182==0)|...192
Reverse transition relation is NOT exact ! Due to transitions t22, t153, i0.u2.t200, i0.u2.t201, i0.u2.t202, i0.u5.t193, i0.u5.t194, i1.t170, i1.i0.t205, i...1766
Detected timeout of ITS tools.
[2026-05-25 10:20:05] [INFO ] Applying decomposition
[2026-05-25 10:20:05] [INFO ] Flatten gal took : 17 ms
[2026-05-25 10:20:05] [INFO ] Decomposing Gal with order
[2026-05-25 10:20:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:20:05] [INFO ] Removed a total of 604 redundant transitions.
[2026-05-25 10:20:05] [INFO ] Flatten gal took : 29 ms
[2026-05-25 10:20:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 98 labels/synchronizations in 6 ms.
[2026-05-25 10:20:05] [INFO ] Time to serialize gal into /tmp/CTLFireability3226420838777699239.gal : 14 ms
[2026-05-25 10:20:05] [INFO ] Time to serialize properties into /tmp/CTLFireability3731616569155412857.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/CTLFireability3226420838777699239.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3731616569155412857.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 8 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,4.77679e+12,4.90864,182656,2836,827,325717,8860,576,1.22871e+06,215,82323,0


Converting to forward existential form...Done !
original formula: AF(AX(((i0.i0.i0.i1.u11.p76==1) + EG(EF((((i0.i0.i0.u4.p26==0)||(i0.i0.i0.i1.i0.u10.p56==0))||((i0.i1.u22.p182==0)||(i0.i1.i1.u29.p234==0...163
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(((i0.i0.i0.i1.u11.p76==1) + EG(E(TRUE U (((i0.i0.i0.u4.p26==0)||(i0.i0.i0.i1.i0.u10.p56==0))...220
Reverse transition relation is NOT exact ! Due to transitions i0.i0.i0.u4.t195, i0.i0.i0.u4.t196, i0.i0.i0.u4.t197, i0.i0.i0.u4.t198, i0.i0.i0.u4.t199, i0....2987

BK_TIME_CONFINEMENT_REACHED

--------------------
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="MedleyA-PT-19"
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 MedleyA-PT-19, 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 r178-oct2-177969020000242"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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