Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r146-tall-177961074200450.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is GPUForwardProgress-PT-20b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074200450
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 7.3K Mar 7 11:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Mar 7 11:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Mar 7 11:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 7 11:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 10:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 10:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 10:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 10:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Mar 7 11:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 191K Mar 7 11:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Mar 7 11:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Mar 7 11:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 103K 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 GPUForwardProgress-PT-20b-CTLFireability-2024-00
FORMULA_NAME GPUForwardProgress-PT-20b-CTLFireability-2024-01
FORMULA_NAME GPUForwardProgress-PT-20b-CTLFireability-2024-02
FORMULA_NAME GPUForwardProgress-PT-20b-CTLFireability-2024-03
FORMULA_NAME GPUForwardProgress-PT-20b-CTLFireability-2024-04
FORMULA_NAME GPUForwardProgress-PT-20b-CTLFireability-2024-05
FORMULA_NAME GPUForwardProgress-PT-20b-CTLFireability-2024-06
FORMULA_NAME GPUForwardProgress-PT-20b-CTLFireability-2024-07
FORMULA_NAME GPUForwardProgress-PT-20b-CTLFireability-2024-08
FORMULA_NAME GPUForwardProgress-PT-20b-CTLFireability-2024-09
FORMULA_NAME GPUForwardProgress-PT-20b-CTLFireability-2024-10
FORMULA_NAME GPUForwardProgress-PT-20b-CTLFireability-2024-11
FORMULA_NAME GPUForwardProgress-PT-20b-CTLFireability-2024-12
FORMULA_NAME GPUForwardProgress-PT-20b-CTLFireability-2024-13
FORMULA_NAME GPUForwardProgress-PT-20b-CTLFireability-2024-14
FORMULA_NAME GPUForwardProgress-PT-20b-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779727526011

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-20b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-25 16:45:27] [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 16:45:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 16:45:27] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2026-05-25 16:45:27] [INFO ] Transformed 416 places.
[2026-05-25 16:45:27] [INFO ] Transformed 437 transitions.
[2026-05-25 16:45:27] [INFO ] Found NUPN structural information;
[2026-05-25 16:45:27] [INFO ] Parsed PT model containing 416 places and 437 transitions and 1077 arcs in 180 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Support contains 95 out of 416 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 416/416 places, 437/437 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 415 transition count 437
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 36 place count 380 transition count 402
Iterating global reduction 1 with 35 rules applied. Total rules applied 71 place count 380 transition count 402
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 82 place count 369 transition count 391
Iterating global reduction 1 with 11 rules applied. Total rules applied 93 place count 369 transition count 391
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 101 place count 369 transition count 383
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 102 place count 368 transition count 382
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 368 transition count 382
Applied a total of 103 rules in 110 ms. Remains 368 /416 variables (removed 48) and now considering 382/437 (removed 55) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3814553839105647464.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14923839818576741097.kers'
[2026-05-25 16:45:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3814553839105647464.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14923839818576741097.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 382 rows 368 cols 965 entries
Finished phase 1 with 346 SingleSign rule and 1 generalized
[2026-05-25 16:45:27] [INFO ] Computed 21 invariants in 1 ms
Computed 21 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14923839818576741097.kers
Total runtime 2 ms.
[2026-05-25 16:45:27] [INFO ] Implicit Places using invariants in 299 ms returned []
[2026-05-25 16:45:27] [INFO ] Invariant cache hit.
[2026-05-25 16:45:28] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 622 ms to find 0 implicit places.
Running 381 sub problems to find dead transitions.
[2026-05-25 16:45:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/367 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/367 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 2 (OVERLAPS) 382/749 variables, 367/388 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/749 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 4 (OVERLAPS) 1/750 variables, 1/389 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/750 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 381 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 750/750 variables, and 389 constraints, problems are : Problem set: 0 solved, 381 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 368/368 constraints, PredecessorRefiner: 381/381 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 381 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/367 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/367 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 2 (OVERLAPS) 382/749 variables, 367/388 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/749 variables, 381/769 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/749 variables, 0/769 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 5 (OVERLAPS) 1/750 variables, 1/770 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/750 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 381 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 750/750 variables, and 770 constraints, problems are : Problem set: 0 solved, 381 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 368/368 constraints, PredecessorRefiner: 381/381 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60159ms problems are : Problem set: 0 solved, 381 unsolved
Search for dead transitions found 0 dead transitions in 60173ms
Starting structural reductions in LTL mode, iteration 1 : 368/416 places, 382/437 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60939 ms. Remains : 368/416 places, 382/437 transitions.
Starting structural reductions in LTL mode, iteration 0 : 368/368 places, 382/382 transitions.
Applied a total of 0 rules in 7 ms. Remains 368 /368 variables (removed 0) and now considering 382/382 (removed 0) transitions.
[2026-05-25 16:46:28] [INFO ] Invariant cache hit.
[2026-05-25 16:46:28] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-25 16:46:28] [INFO ] Invariant cache hit.
[2026-05-25 16:46:28] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 310 ms. Remains : 368/368 places, 382/382 transitions.
Support contains 95 out of 368 places after structural reductions.
[2026-05-25 16:46:28] [INFO ] Flatten gal took : 48 ms
[2026-05-25 16:46:28] [INFO ] Flatten gal took : 20 ms
[2026-05-25 16:46:28] [INFO ] Input system was already deterministic with 382 transitions.
Support contains 90 out of 368 places (down from 95) after GAL structural reductions.
RANDOM walk for 40000 steps (228 resets) in 1832 ms. (21 steps per ms) remains 19/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 55 ms. (71 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
[2026-05-25 16:46:29] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 331/367 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/367 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 382/749 variables, 367/388 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/749 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Problem AtomicPropp8 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/750 variables, 1/389 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/750 variables, 0/389 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 0/750 variables, 0/389 constraints. Problems are: Problem set: 1 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 750/750 variables, and 389 constraints, problems are : Problem set: 1 solved, 18 unsolved in 965 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 368/368 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 335/367 variables, 21/21 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/367 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 382/749 variables, 367/388 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/749 variables, 18/406 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/749 variables, 0/406 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 1/750 variables, 1/407 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/750 variables, 0/407 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 0/750 variables, 0/407 constraints. Problems are: Problem set: 1 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 750/750 variables, and 407 constraints, problems are : Problem set: 1 solved, 18 unsolved in 2963 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 368/368 constraints, PredecessorRefiner: 18/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3936ms problems are : Problem set: 1 solved, 18 unsolved
Fused 18 Parikh solutions to 15 different solutions.
Parikh walk visited 17 properties in 3689 ms.
Support contains 1 out of 368 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 368/368 places, 382/382 transitions.
Graph (trivial) has 317 edges and 368 vertex of which 6 / 368 are part of one of the 1 SCC in 5 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 564 edges and 363 vertex of which 339 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 180 transitions
Trivial Post-agglo rules discarded 180 transitions
Performed 180 trivial Post agglomeration. Transition count delta: 180
Iterating post reduction 0 with 182 rules applied. Total rules applied 184 place count 339 transition count 190
Reduce places removed 180 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 198 rules applied. Total rules applied 382 place count 159 transition count 172
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 388 place count 153 transition count 172
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 388 place count 153 transition count 129
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 474 place count 110 transition count 129
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 495 place count 89 transition count 108
Iterating global reduction 3 with 21 rules applied. Total rules applied 516 place count 89 transition count 108
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 516 place count 89 transition count 107
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 518 place count 88 transition count 107
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 640 place count 27 transition count 46
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 72 edges and 27 vertex of which 26 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 642 place count 26 transition count 45
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 643 place count 26 transition count 44
Discarding 18 places :
Symmetric choice reduction at 5 with 18 rule applications. Total rules 661 place count 8 transition count 8
Iterating global reduction 5 with 18 rules applied. Total rules applied 679 place count 8 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 682 place count 6 transition count 7
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 7 edges and 6 vertex of which 5 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 2 rules applied. Total rules applied 684 place count 5 transition count 6
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 685 place count 5 transition count 5
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 686 place count 5 transition count 5
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 687 place count 5 transition count 4
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 688 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 689 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 689 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 691 place count 2 transition count 2
Applied a total of 691 rules in 46 ms. Remains 2 /368 variables (removed 366) and now considering 2/382 (removed 380) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 2/368 places, 2/382 transitions.
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2026-05-25 16:46:37] [INFO ] Flatten gal took : 15 ms
[2026-05-25 16:46:37] [INFO ] Flatten gal took : 16 ms
[2026-05-25 16:46:37] [INFO ] Input system was already deterministic with 382 transitions.
Computed a total of 69 stabilizing places and 69 stable transitions
Graph (complete) has 571 edges and 368 vertex of which 344 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.8 ms
Starting structural reductions in LTL mode, iteration 0 : 368/368 places, 382/382 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 353 transition count 367
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 353 transition count 367
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 35 place count 353 transition count 362
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 39 place count 349 transition count 358
Iterating global reduction 1 with 4 rules applied. Total rules applied 43 place count 349 transition count 358
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 47 place count 349 transition count 354
Applied a total of 47 rules in 34 ms. Remains 349 /368 variables (removed 19) and now considering 354/382 (removed 28) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14174574942779404720.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-66699386257427678.kers'
[2026-05-25 16:46:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14174574942779404720.kers, --Pflows, --basisKERS=/tmp/petrispot-output-66699386257427678.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 354 rows 349 cols 909 entries
Finished phase 1 with 327 SingleSign rule and 1 generalized
[2026-05-25 16:46:37] [INFO ] Computed 21 invariants in 1 ms
Computed 21 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-66699386257427678.kers
Total runtime 2 ms.
[2026-05-25 16:46:37] [INFO ] Implicit Places using invariants in 100 ms returned []
[2026-05-25 16:46:37] [INFO ] Invariant cache hit.
[2026-05-25 16:46:37] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
Running 353 sub problems to find dead transitions.
[2026-05-25 16:46:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/348 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/348 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (OVERLAPS) 354/702 variables, 348/369 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/702 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 4 (OVERLAPS) 1/703 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/703 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 353 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 703/703 variables, and 370 constraints, problems are : Problem set: 0 solved, 353 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 349/349 constraints, PredecessorRefiner: 353/353 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 353 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/348 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/348 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (OVERLAPS) 354/702 variables, 348/369 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/702 variables, 353/722 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/702 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 5 (OVERLAPS) 1/703 variables, 1/723 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/703 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 353 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 703/703 variables, and 723 constraints, problems are : Problem set: 0 solved, 353 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 349/349 constraints, PredecessorRefiner: 353/353 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60080ms problems are : Problem set: 0 solved, 353 unsolved
Search for dead transitions found 0 dead transitions in 60082ms
Starting structural reductions in LTL mode, iteration 1 : 349/368 places, 354/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60406 ms. Remains : 349/368 places, 354/382 transitions.
[2026-05-25 16:47:37] [INFO ] Flatten gal took : 14 ms
[2026-05-25 16:47:37] [INFO ] Flatten gal took : 12 ms
[2026-05-25 16:47:37] [INFO ] Input system was already deterministic with 354 transitions.
[2026-05-25 16:47:37] [INFO ] Flatten gal took : 15 ms
[2026-05-25 16:47:37] [INFO ] Flatten gal took : 11 ms
[2026-05-25 16:47:37] [INFO ] Time to serialize gal into /tmp/CTLFireability3127884354968631684.gal : 7 ms
[2026-05-25 16:47:37] [INFO ] Time to serialize properties into /tmp/CTLFireability16158408067220839672.ctl : 3 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/CTLFireability3127884354968631684.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16158408067220839672.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 16:48:08] [INFO ] Flatten gal took : 14 ms
[2026-05-25 16:48:08] [INFO ] Applying decomposition
[2026-05-25 16:48:08] [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/graph10978376553537856691.txt' '-o' '/tmp/graph10978376553537856691.bin' '-w' '/tmp/graph10978376553537856691.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10978376553537856691.bin' '-l' '-1' '-v' '-w' '/tmp/graph10978376553537856691.weights' '-q' '0' '-e' '0.001'
[2026-05-25 16:48:08] [INFO ] Decomposing Gal with order
[2026-05-25 16:48:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 16:48:08] [INFO ] Removed a total of 98 redundant transitions.
[2026-05-25 16:48:08] [INFO ] Flatten gal took : 77 ms
[2026-05-25 16:48:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2026-05-25 16:48:08] [INFO ] Time to serialize gal into /tmp/CTLFireability7939560005134319125.gal : 9 ms
[2026-05-25 16:48:08] [INFO ] Time to serialize properties into /tmp/CTLFireability5253634834885377352.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7939560005134319125.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5253634834885377352.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,2.91957e+25,0.184074,12044,822,23,15980,245,613,19954,35,476,0


Converting to forward existential form...Done !
original formula: EG(((EF(EX((i3.i0.u22.p64==0))) + (i13.i0.u84.p244==1)) + (EF(AG((i6.i0.u42.p121==0))) * ((i2.u21.p55==1) + (E(((i1.i1.u12.p30==1)||(((i1...292
=> equivalent forward existential formula: [FwdG(Init,((E(TRUE U EX((i3.i0.u22.p64==0))) + (i13.i0.u84.p244==1)) + (E(TRUE U !(E(TRUE U !((i6.i0.u42.p121==...359
Reverse transition relation is NOT exact ! Due to transitions t312, i1.i0.t298, i1.i0.t307, i2.t293, i2.t285, i3.t277, i3.i1.u26.t270, i4.t263, i4.i2.t256,...738
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
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 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 a local SCC at level 21
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 368/368 places, 382/382 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 352 transition count 366
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 352 transition count 366
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 37 place count 352 transition count 361
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 40 place count 349 transition count 358
Iterating global reduction 1 with 3 rules applied. Total rules applied 43 place count 349 transition count 358
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 46 place count 349 transition count 355
Applied a total of 46 rules in 41 ms. Remains 349 /368 variables (removed 19) and now considering 355/382 (removed 27) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10307267807557285895.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9124945965985286748.kers'
[2026-05-25 16:48:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10307267807557285895.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9124945965985286748.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 355 rows 349 cols 911 entries
Finished phase 1 with 327 SingleSign rule and 1 generalized
[2026-05-25 16:48:38] [INFO ] Computed 21 invariants in 1 ms
Computed 21 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9124945965985286748.kers
Total runtime 2 ms.
[2026-05-25 16:48:38] [INFO ] Implicit Places using invariants in 192 ms returned []
[2026-05-25 16:48:38] [INFO ] Invariant cache hit.
[2026-05-25 16:48:38] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
Running 354 sub problems to find dead transitions.
[2026-05-25 16:48:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/348 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/348 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 2 (OVERLAPS) 355/703 variables, 348/369 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/703 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 4 (OVERLAPS) 1/704 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/704 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 354 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 704/704 variables, and 370 constraints, problems are : Problem set: 0 solved, 354 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 349/349 constraints, PredecessorRefiner: 354/354 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 354 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/348 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/348 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 2 (OVERLAPS) 355/703 variables, 348/369 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/703 variables, 354/723 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/703 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 5 (OVERLAPS) 1/704 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/704 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 354 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 704/704 variables, and 724 constraints, problems are : Problem set: 0 solved, 354 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 349/349 constraints, PredecessorRefiner: 354/354 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60098ms problems are : Problem set: 0 solved, 354 unsolved
Search for dead transitions found 0 dead transitions in 60104ms
Starting structural reductions in LTL mode, iteration 1 : 349/368 places, 355/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60602 ms. Remains : 349/368 places, 355/382 transitions.
[2026-05-25 16:49:39] [INFO ] Flatten gal took : 20 ms
[2026-05-25 16:49:39] [INFO ] Flatten gal took : 13 ms
[2026-05-25 16:49:39] [INFO ] Input system was already deterministic with 355 transitions.
[2026-05-25 16:49:39] [INFO ] Flatten gal took : 8 ms
[2026-05-25 16:49:39] [INFO ] Flatten gal took : 8 ms
[2026-05-25 16:49:39] [INFO ] Time to serialize gal into /tmp/CTLFireability13860453748129857224.gal : 2 ms
[2026-05-25 16:49:39] [INFO ] Time to serialize properties into /tmp/CTLFireability7919987974075103599.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/CTLFireability13860453748129857224.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7919987974075103599.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 16:50:09] [INFO ] Flatten gal took : 18 ms
[2026-05-25 16:50:09] [INFO ] Applying decomposition
[2026-05-25 16:50:09] [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/graph4373196010095653730.txt' '-o' '/tmp/graph4373196010095653730.bin' '-w' '/tmp/graph4373196010095653730.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4373196010095653730.bin' '-l' '-1' '-v' '-w' '/tmp/graph4373196010095653730.weights' '-q' '0' '-e' '0.001'
[2026-05-25 16:50:09] [INFO ] Decomposing Gal with order
[2026-05-25 16:50:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 16:50:09] [INFO ] Removed a total of 100 redundant transitions.
[2026-05-25 16:50:09] [INFO ] Flatten gal took : 33 ms
[2026-05-25 16:50:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2026-05-25 16:50:09] [INFO ] Time to serialize gal into /tmp/CTLFireability7024626593838760738.gal : 22 ms
[2026-05-25 16:50:09] [INFO ] Time to serialize properties into /tmp/CTLFireability17003573888801816565.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/CTLFireability7024626593838760738.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17003573888801816565.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,2.92031e+25,0.301792,13208,891,27,18082,329,625,23816,36,934,0


Converting to forward existential form...Done !
original formula: (EG((((EG((i9.i1.u62.p165==1)) * A((i2.i1.u19.p45==1) U (i15.i1.u103.p279==1))) * (((i19.i1.u131.p359!=1)||(i4.i2.u30.p75!=1))&&(i3.i1.u2...434
=> equivalent forward existential formula: ([FwdG(Init,(((EG((i9.i1.u62.p165==1)) * !((E(!((i15.i1.u103.p279==1)) U (!((i2.i1.u19.p45==1)) * !((i15.i1.u103...756
Reverse transition relation is NOT exact ! Due to transitions t313, i1.t308, i1.i2.t301, i2.i1.t286, i2.i1.u18.t295, i3.i0.t270, i3.i0.t279, i4.t263, i4.i2...754
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
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 a local SCC at level 1
Fast SCC detection found a local SCC at level 21
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 368/368 places, 382/382 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 350 transition count 364
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 350 transition count 364
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 42 place count 350 transition count 358
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 345 transition count 353
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 345 transition count 353
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 57 place count 345 transition count 348
Applied a total of 57 rules in 20 ms. Remains 345 /368 variables (removed 23) and now considering 348/382 (removed 34) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11497162530447535660.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6875557326026424470.kers'
[2026-05-25 16:50:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11497162530447535660.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6875557326026424470.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 348 rows 345 cols 897 entries
Finished phase 1 with 323 SingleSign rule and 1 generalized
[2026-05-25 16:50:39] [INFO ] Computed 21 invariants in 1 ms
Computed 21 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6875557326026424470.kers
Total runtime 2 ms.
[2026-05-25 16:50:39] [INFO ] Implicit Places using invariants in 172 ms returned []
[2026-05-25 16:50:39] [INFO ] Invariant cache hit.
[2026-05-25 16:50:39] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
Running 347 sub problems to find dead transitions.
[2026-05-25 16:50:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/344 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/344 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 2 (OVERLAPS) 348/692 variables, 344/365 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/692 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 4 (OVERLAPS) 1/693 variables, 1/366 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/693 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 347 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 693/693 variables, and 366 constraints, problems are : Problem set: 0 solved, 347 unsolved in 30012 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 345/345 constraints, PredecessorRefiner: 347/347 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 347 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/344 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/344 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 2 (OVERLAPS) 348/692 variables, 344/365 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/692 variables, 347/712 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/692 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 5 (OVERLAPS) 1/693 variables, 1/713 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/693 variables, 0/713 constraints. Problems are: Problem set: 0 solved, 347 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 693/693 variables, and 713 constraints, problems are : Problem set: 0 solved, 347 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 345/345 constraints, PredecessorRefiner: 347/347 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60072ms problems are : Problem set: 0 solved, 347 unsolved
Search for dead transitions found 0 dead transitions in 60073ms
Starting structural reductions in LTL mode, iteration 1 : 345/368 places, 348/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60577 ms. Remains : 345/368 places, 348/382 transitions.
[2026-05-25 16:51:40] [INFO ] Flatten gal took : 8 ms
[2026-05-25 16:51:40] [INFO ] Flatten gal took : 7 ms
[2026-05-25 16:51:40] [INFO ] Input system was already deterministic with 348 transitions.
[2026-05-25 16:51:40] [INFO ] Flatten gal took : 6 ms
[2026-05-25 16:51:40] [INFO ] Flatten gal took : 6 ms
[2026-05-25 16:51:40] [INFO ] Time to serialize gal into /tmp/CTLFireability17627181320042399394.gal : 2 ms
[2026-05-25 16:51:40] [INFO ] Time to serialize properties into /tmp/CTLFireability14197095130566107497.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/CTLFireability17627181320042399394.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14197095130566107497.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.
Detected timeout of ITS tools.
[2026-05-25 16:52:10] [INFO ] Flatten gal took : 10 ms
[2026-05-25 16:52:10] [INFO ] Applying decomposition
[2026-05-25 16:52:10] [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/graph1964647009672306641.txt' '-o' '/tmp/graph1964647009672306641.bin' '-w' '/tmp/graph1964647009672306641.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1964647009672306641.bin' '-l' '-1' '-v' '-w' '/tmp/graph1964647009672306641.weights' '-q' '0' '-e' '0.001'
[2026-05-25 16:52:10] [INFO ] Decomposing Gal with order
[2026-05-25 16:52:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 16:52:10] [INFO ] Removed a total of 107 redundant transitions.
[2026-05-25 16:52:10] [INFO ] Flatten gal took : 15 ms
[2026-05-25 16:52:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2026-05-25 16:52:10] [INFO ] Time to serialize gal into /tmp/CTLFireability2513438003568672076.gal : 4 ms
[2026-05-25 16:52:10] [INFO ] Time to serialize properties into /tmp/CTLFireability2125385508773127699.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/CTLFireability2513438003568672076.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2125385508773127699.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,2.26934e+25,0.282795,15572,787,37,22704,427,612,30945,44,1072,0


Converting to forward existential form...Done !
original formula: EF(AX(((i16.i2.u117.p304==1)&&(((i12.i0.u87.p221!=1)||(i20.i0.u137.p368!=1))||((i21.i1.u147.p397!=1)||(i21.i1.u148.p412!=1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(((i16.i2.u117.p304==1)&&(((i12.i0.u87.p221!=1)||(i20.i0.u137.p368!=1))||((i21.i1.u147...204
Reverse transition relation is NOT exact ! Due to transitions t306, i1.t301, i1.i2.t294, i2.t288, i2.i1.t281, i3.t274, i3.i2.t267, i4.t260, i4.i2.t253, i5....746
(forward)formula 0,1,0.462212,17892,1,0,23323,427,3090,39409,177,1072,124175
FORMULA GPUForwardProgress-PT-20b-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 368/368 places, 382/382 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 350 transition count 364
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 350 transition count 364
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 42 place count 350 transition count 358
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 48 place count 344 transition count 352
Iterating global reduction 1 with 6 rules applied. Total rules applied 54 place count 344 transition count 352
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 60 place count 344 transition count 346
Applied a total of 60 rules in 12 ms. Remains 344 /368 variables (removed 24) and now considering 346/382 (removed 36) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10483717523258581950.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14049334457167754065.kers'
[2026-05-25 16:52:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10483717523258581950.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14049334457167754065.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 346 rows 344 cols 893 entries
Finished phase 1 with 322 SingleSign rule and 1 generalized
[2026-05-25 16:52:10] [INFO ] Computed 21 invariants in 1 ms
Computed 21 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14049334457167754065.kers
Total runtime 2 ms.
[2026-05-25 16:52:10] [INFO ] Implicit Places using invariants in 94 ms returned []
[2026-05-25 16:52:10] [INFO ] Invariant cache hit.
[2026-05-25 16:52:11] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
Running 345 sub problems to find dead transitions.
[2026-05-25 16:52:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/343 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 2 (OVERLAPS) 346/689 variables, 343/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/689 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 4 (OVERLAPS) 1/690 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/690 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 690/690 variables, and 365 constraints, problems are : Problem set: 0 solved, 345 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 345/345 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 345 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/343 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 2 (OVERLAPS) 346/689 variables, 343/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/689 variables, 345/709 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/689 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 5 (OVERLAPS) 1/690 variables, 1/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/690 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 690/690 variables, and 710 constraints, problems are : Problem set: 0 solved, 345 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 345/345 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60070ms problems are : Problem set: 0 solved, 345 unsolved
Search for dead transitions found 0 dead transitions in 60072ms
Starting structural reductions in LTL mode, iteration 1 : 344/368 places, 346/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60416 ms. Remains : 344/368 places, 346/382 transitions.
[2026-05-25 16:53:11] [INFO ] Flatten gal took : 6 ms
[2026-05-25 16:53:11] [INFO ] Flatten gal took : 5 ms
[2026-05-25 16:53:11] [INFO ] Input system was already deterministic with 346 transitions.
[2026-05-25 16:53:11] [INFO ] Flatten gal took : 5 ms
[2026-05-25 16:53:11] [INFO ] Flatten gal took : 5 ms
[2026-05-25 16:53:11] [INFO ] Time to serialize gal into /tmp/CTLFireability17680576025867087064.gal : 2 ms
[2026-05-25 16:53:11] [INFO ] Time to serialize properties into /tmp/CTLFireability4839491482484851258.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/CTLFireability17680576025867087064.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4839491482484851258.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 16:53:41] [INFO ] Flatten gal took : 11 ms
[2026-05-25 16:53:41] [INFO ] Applying decomposition
[2026-05-25 16:53:41] [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/graph10972119438553939211.txt' '-o' '/tmp/graph10972119438553939211.bin' '-w' '/tmp/graph10972119438553939211.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10972119438553939211.bin' '-l' '-1' '-v' '-w' '/tmp/graph10972119438553939211.weights' '-q' '0' '-e' '0.001'
[2026-05-25 16:53:41] [INFO ] Decomposing Gal with order
[2026-05-25 16:53:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 16:53:41] [INFO ] Removed a total of 105 redundant transitions.
[2026-05-25 16:53:41] [INFO ] Flatten gal took : 17 ms
[2026-05-25 16:53:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-25 16:53:41] [INFO ] Time to serialize gal into /tmp/CTLFireability6606866903066163818.gal : 3 ms
[2026-05-25 16:53:41] [INFO ] Time to serialize properties into /tmp/CTLFireability5378670732021367509.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/CTLFireability6606866903066163818.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5378670732021367509.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,2.12845e+25,0.231741,13372,886,27,18610,306,537,24901,35,731,0


Converting to forward existential form...Done !
original formula: AF(AX((i0.i1.i0.u4.p12==1)))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!((i0.i1.i0.u4.p12==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t304, i1.t299, i1.u14.t292, i2.t286, i2.t279, i3.t272, i3.u27.t265, i4.t258, i4.u33.t251, i5....662
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
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 7
Fast SCC detection found a local SCC at level 21
(forward)formula 0,0,29.9157,676556,1,0,1.51324e+06,306,3210,1.05543e+06,155,731,1417291
FORMULA GPUForwardProgress-PT-20b-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 368/368 places, 382/382 transitions.
Graph (trivial) has 315 edges and 368 vertex of which 6 / 368 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 565 edges and 363 vertex of which 339 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.2 ms
Discarding 24 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 177 transitions
Trivial Post-agglo rules discarded 177 transitions
Performed 177 trivial Post agglomeration. Transition count delta: 177
Iterating post reduction 0 with 177 rules applied. Total rules applied 179 place count 338 transition count 195
Reduce places removed 177 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 195 rules applied. Total rules applied 374 place count 161 transition count 177
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 381 place count 155 transition count 176
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 382 place count 154 transition count 176
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 43 Pre rules applied. Total rules applied 382 place count 154 transition count 133
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 468 place count 111 transition count 133
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 487 place count 92 transition count 114
Iterating global reduction 4 with 19 rules applied. Total rules applied 506 place count 92 transition count 114
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 588 place count 51 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 589 place count 51 transition count 72
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 590 place count 50 transition count 71
Iterating global reduction 5 with 1 rules applied. Total rules applied 591 place count 50 transition count 71
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 593 place count 49 transition count 70
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 594 place count 49 transition count 70
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 595 place count 48 transition count 69
Applied a total of 595 rules in 39 ms. Remains 48 /368 variables (removed 320) and now considering 69/382 (removed 313) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7915216223924771358.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11491158326984204450.kers'
[2026-05-25 16:54:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7915216223924771358.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11491158326984204450.kers]
Normalized transition count is 68 out of 69 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 68 rows 48 cols 177 entries
Finished phase 1 with 48 SingleSign rule and 0 generalized
[2026-05-25 16:54:11] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11491158326984204450.kers
Total runtime 1 ms.
[2026-05-25 16:54:11] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-05-25 16:54:11] [INFO ] Invariant cache hit.
[2026-05-25 16:54:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 16:54:11] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2026-05-25 16:54:11] [INFO ] Redundant transitions in 1 ms returned []
Running 48 sub problems to find dead transitions.
[2026-05-25 16:54:11] [INFO ] Invariant cache hit.
[2026-05-25 16:54:11] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 68/96 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 20/116 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 1/117 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/117 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/117 variables, and 49 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1078 ms.
Refiners :[State Equation: 48/48 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 68/96 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 9/37 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 20/116 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 39/96 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 1/117 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 0/117 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/117 variables, and 97 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1152 ms.
Refiners :[State Equation: 48/48 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2241ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 2241ms
Starting structural reductions in SI_CTL mode, iteration 1 : 48/368 places, 69/382 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2393 ms. Remains : 48/368 places, 69/382 transitions.
[2026-05-25 16:54:13] [INFO ] Flatten gal took : 3 ms
[2026-05-25 16:54:13] [INFO ] Flatten gal took : 1 ms
[2026-05-25 16:54:13] [INFO ] Input system was already deterministic with 69 transitions.
[2026-05-25 16:54:13] [INFO ] Flatten gal took : 1 ms
[2026-05-25 16:54:13] [INFO ] Flatten gal took : 1 ms
[2026-05-25 16:54:13] [INFO ] Time to serialize gal into /tmp/CTLFireability17557516634416180583.gal : 0 ms
[2026-05-25 16:54:13] [INFO ] Time to serialize properties into /tmp/CTLFireability5173040492474206264.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/CTLFireability17557516634416180583.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5173040492474206264.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.38218e+11,0.170356,10436,2,785,5,45295,6,0,261,28483,0


Converting to forward existential form...Done !
original formula: AF(((p78==1) + AF((p89==1))))
=> equivalent forward existential formula: [FwdG(Init,!(((p78==1) + !(EG(!((p89==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t8, t9, t12, t14, t17, t18, t20, t22, t24, t26, t28, t30, t33, t34, t36, t38, t40, t4...276
(forward)formula 0,0,5.40967,179480,1,0,678,1.06636e+06,165,415,1667,1.25947e+06,722
FORMULA GPUForwardProgress-PT-20b-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 368/368 places, 382/382 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 355 transition count 369
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 355 transition count 369
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 31 place count 355 transition count 364
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 34 place count 352 transition count 361
Iterating global reduction 1 with 3 rules applied. Total rules applied 37 place count 352 transition count 361
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 40 place count 352 transition count 358
Applied a total of 40 rules in 42 ms. Remains 352 /368 variables (removed 16) and now considering 358/382 (removed 24) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13055353165078796885.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4365899332127055980.kers'
[2026-05-25 16:54:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13055353165078796885.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4365899332127055980.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 358 rows 352 cols 917 entries
Finished phase 1 with 330 SingleSign rule and 1 generalized
[2026-05-25 16:54:19] [INFO ] Computed 21 invariants in 4 ms
Computed 21 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-4365899332127055980.kers
Total runtime 5 ms.
[2026-05-25 16:54:19] [INFO ] Implicit Places using invariants in 97 ms returned []
[2026-05-25 16:54:19] [INFO ] Invariant cache hit.
[2026-05-25 16:54:19] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
Running 357 sub problems to find dead transitions.
[2026-05-25 16:54:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 2 (OVERLAPS) 358/709 variables, 351/372 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/709 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 4 (OVERLAPS) 1/710 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/710 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 357 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 710/710 variables, and 373 constraints, problems are : Problem set: 0 solved, 357 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 357/357 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 357 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 2 (OVERLAPS) 358/709 variables, 351/372 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/709 variables, 357/729 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/709 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 5 (OVERLAPS) 1/710 variables, 1/730 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/710 variables, 0/730 constraints. Problems are: Problem set: 0 solved, 357 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 710/710 variables, and 730 constraints, problems are : Problem set: 0 solved, 357 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 357/357 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60063ms problems are : Problem set: 0 solved, 357 unsolved
Search for dead transitions found 0 dead transitions in 60065ms
Starting structural reductions in LTL mode, iteration 1 : 352/368 places, 358/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60466 ms. Remains : 352/368 places, 358/382 transitions.
[2026-05-25 16:55:19] [INFO ] Flatten gal took : 5 ms
[2026-05-25 16:55:19] [INFO ] Flatten gal took : 5 ms
[2026-05-25 16:55:19] [INFO ] Input system was already deterministic with 358 transitions.
[2026-05-25 16:55:19] [INFO ] Flatten gal took : 5 ms
[2026-05-25 16:55:19] [INFO ] Flatten gal took : 6 ms
[2026-05-25 16:55:19] [INFO ] Time to serialize gal into /tmp/CTLFireability13574637549343156018.gal : 1 ms
[2026-05-25 16:55:19] [INFO ] Time to serialize properties into /tmp/CTLFireability2105902831271698974.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/CTLFireability13574637549343156018.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2105902831271698974.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 16:55:49] [INFO ] Flatten gal took : 8 ms
[2026-05-25 16:55:49] [INFO ] Applying decomposition
[2026-05-25 16:55:49] [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/graph2535228390159916338.txt' '-o' '/tmp/graph2535228390159916338.bin' '-w' '/tmp/graph2535228390159916338.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2535228390159916338.bin' '-l' '-1' '-v' '-w' '/tmp/graph2535228390159916338.weights' '-q' '0' '-e' '0.001'
[2026-05-25 16:55:49] [INFO ] Decomposing Gal with order
[2026-05-25 16:55:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 16:55:49] [INFO ] Removed a total of 102 redundant transitions.
[2026-05-25 16:55:49] [INFO ] Flatten gal took : 12 ms
[2026-05-25 16:55:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-25 16:55:49] [INFO ] Time to serialize gal into /tmp/CTLFireability9460600936941597597.gal : 3 ms
[2026-05-25 16:55:49] [INFO ] Time to serialize properties into /tmp/CTLFireability7024499252388263126.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/CTLFireability9460600936941597597.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7024499252388263126.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,3.51322e+25,0.180018,11284,701,29,14597,257,594,18477,36,546,0


Converting to forward existential form...Done !
original formula: E(EX(((!(EF((((i11.i0.u80.p224==1)&&(i20.u141.p397==1))&&(i20.u145.p412==1)))) + AX((i16.i1.u115.p319!=1))) + !(AG((i18.i0.u127.p352==1))...654
=> equivalent forward existential formula: [(((FwdU(Init,EX(((!(E(TRUE U (((i11.i0.u80.p224==1)&&(i20.u141.p397==1))&&(i20.u145.p412==1)))) + !(EX(!((i16.i...1820
Reverse transition relation is NOT exact ! Due to transitions t316, i0.t311, i0.i1.u8.t304, i1.t298, i1.i2.u19.t291, i2.t284, i2.i2.t277, i3.t270, i3.i2.t2...731
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 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 a local SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
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 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 7
Fast SCC detection found a local SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 368/368 places, 382/382 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 352 transition count 366
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 352 transition count 366
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 38 place count 352 transition count 360
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 44 place count 346 transition count 354
Iterating global reduction 1 with 6 rules applied. Total rules applied 50 place count 346 transition count 354
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 56 place count 346 transition count 348
Applied a total of 56 rules in 21 ms. Remains 346 /368 variables (removed 22) and now considering 348/382 (removed 34) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7267140171134636882.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15358724341459009740.kers'
[2026-05-25 16:56:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7267140171134636882.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15358724341459009740.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 348 rows 346 cols 897 entries
Finished phase 1 with 324 SingleSign rule and 1 generalized
[2026-05-25 16:56:19] [INFO ] Computed 21 invariants in 3 ms
Computed 21 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-15358724341459009740.kers
Total runtime 17 ms.
[2026-05-25 16:56:20] [INFO ] Implicit Places using invariants in 108 ms returned []
[2026-05-25 16:56:20] [INFO ] Invariant cache hit.
[2026-05-25 16:56:20] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
Running 347 sub problems to find dead transitions.
[2026-05-25 16:56:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/345 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/345 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 2 (OVERLAPS) 348/693 variables, 345/366 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/693 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 4 (OVERLAPS) 1/694 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/694 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 347 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 694/694 variables, and 367 constraints, problems are : Problem set: 0 solved, 347 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 346/346 constraints, PredecessorRefiner: 347/347 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 347 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/345 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/345 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 2 (OVERLAPS) 348/693 variables, 345/366 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/693 variables, 347/713 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/693 variables, 0/713 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 5 (OVERLAPS) 1/694 variables, 1/714 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/694 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 347 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 694/694 variables, and 714 constraints, problems are : Problem set: 0 solved, 347 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 346/346 constraints, PredecessorRefiner: 347/347 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60071ms problems are : Problem set: 0 solved, 347 unsolved
Search for dead transitions found 0 dead transitions in 60072ms
Starting structural reductions in LTL mode, iteration 1 : 346/368 places, 348/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60459 ms. Remains : 346/368 places, 348/382 transitions.
[2026-05-25 16:57:20] [INFO ] Flatten gal took : 4 ms
[2026-05-25 16:57:20] [INFO ] Flatten gal took : 4 ms
[2026-05-25 16:57:20] [INFO ] Input system was already deterministic with 348 transitions.
[2026-05-25 16:57:20] [INFO ] Flatten gal took : 4 ms
[2026-05-25 16:57:20] [INFO ] Flatten gal took : 4 ms
[2026-05-25 16:57:20] [INFO ] Time to serialize gal into /tmp/CTLFireability7045447722963944094.gal : 2 ms
[2026-05-25 16:57:20] [INFO ] Time to serialize properties into /tmp/CTLFireability2188184713787874859.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/CTLFireability7045447722963944094.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2188184713787874859.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 16:57:50] [INFO ] Flatten gal took : 8 ms
[2026-05-25 16:57:50] [INFO ] Applying decomposition
[2026-05-25 16:57:50] [INFO ] Flatten gal took : 4 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/graph14947315530432708758.txt' '-o' '/tmp/graph14947315530432708758.bin' '-w' '/tmp/graph14947315530432708758.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14947315530432708758.bin' '-l' '-1' '-v' '-w' '/tmp/graph14947315530432708758.weights' '-q' '0' '-e' '0.001'
[2026-05-25 16:57:50] [INFO ] Decomposing Gal with order
[2026-05-25 16:57:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 16:57:50] [INFO ] Removed a total of 102 redundant transitions.
[2026-05-25 16:57:50] [INFO ] Flatten gal took : 14 ms
[2026-05-25 16:57:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-25 16:57:50] [INFO ] Time to serialize gal into /tmp/CTLFireability8981795080223807117.gal : 20 ms
[2026-05-25 16:57:50] [INFO ] Time to serialize properties into /tmp/CTLFireability12317615404461691626.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/CTLFireability8981795080223807117.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12317615404461691626.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,2.41956e+25,0.306352,12000,769,28,15969,303,594,19189,36,637,0


Converting to forward existential form...Done !
original formula: (EX(((i21.u142.p383==1)&&(i21.u141.p403==1))) + !(A(!(EG((((i14.i1.u99.p265==1)&&(i13.i0.u93.p251==1))||((i11.i2.u75.p218==1)&&(i1.i0.u13...394
=> equivalent forward existential formula: ([(EY(Init) * ((i21.u142.p383==1)&&(i21.u141.p403==1)))] != FALSE + ((([((FwdU((FwdU(Init,!((!((E(!(E((((i3.i2.u...3035
Reverse transition relation is NOT exact ! Due to transitions t306, i1.t301, i1.i1.u10.t294, i2.i1.t281, i2.i1.u17.t288, i3.t274, i3.i0.t267, i4.t260, i4.i...738
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
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 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 a local SCC at level 21
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 368/368 places, 382/382 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 351 transition count 365
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 351 transition count 365
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 40 place count 351 transition count 359
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 45 place count 346 transition count 354
Iterating global reduction 1 with 5 rules applied. Total rules applied 50 place count 346 transition count 354
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 55 place count 346 transition count 349
Applied a total of 55 rules in 26 ms. Remains 346 /368 variables (removed 22) and now considering 349/382 (removed 33) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-407239654402214506.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11352518739235764751.kers'
[2026-05-25 16:58:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-407239654402214506.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11352518739235764751.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 349 rows 346 cols 899 entries
Finished phase 1 with 324 SingleSign rule and 1 generalized
[2026-05-25 16:58:20] [INFO ] Computed 21 invariants in 1 ms
Computed 21 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11352518739235764751.kers
Total runtime 3 ms.
[2026-05-25 16:58:20] [INFO ] Implicit Places using invariants in 92 ms returned []
[2026-05-25 16:58:20] [INFO ] Invariant cache hit.
[2026-05-25 16:58:21] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
Running 348 sub problems to find dead transitions.
[2026-05-25 16:58:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/345 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/345 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (OVERLAPS) 349/694 variables, 345/366 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/694 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 1/695 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/695 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 348 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 695/695 variables, and 367 constraints, problems are : Problem set: 0 solved, 348 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 346/346 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 348 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/345 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/345 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (OVERLAPS) 349/694 variables, 345/366 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/694 variables, 348/714 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/694 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (OVERLAPS) 1/695 variables, 1/715 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/695 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 348 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 695/695 variables, and 715 constraints, problems are : Problem set: 0 solved, 348 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 346/346 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60069ms problems are : Problem set: 0 solved, 348 unsolved
Search for dead transitions found 0 dead transitions in 60071ms
Starting structural reductions in LTL mode, iteration 1 : 346/368 places, 349/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60391 ms. Remains : 346/368 places, 349/382 transitions.
[2026-05-25 16:59:21] [INFO ] Flatten gal took : 4 ms
[2026-05-25 16:59:21] [INFO ] Flatten gal took : 3 ms
[2026-05-25 16:59:21] [INFO ] Input system was already deterministic with 349 transitions.
[2026-05-25 16:59:21] [INFO ] Flatten gal took : 4 ms
[2026-05-25 16:59:21] [INFO ] Flatten gal took : 4 ms
[2026-05-25 16:59:21] [INFO ] Time to serialize gal into /tmp/CTLFireability1979174833318995706.gal : 2 ms
[2026-05-25 16:59:21] [INFO ] Time to serialize properties into /tmp/CTLFireability16468882491119094191.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/CTLFireability1979174833318995706.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16468882491119094191.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 16:59:51] [INFO ] Flatten gal took : 5 ms
[2026-05-25 16:59:51] [INFO ] Applying decomposition
[2026-05-25 16:59:51] [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/graph17153707502122712408.txt' '-o' '/tmp/graph17153707502122712408.bin' '-w' '/tmp/graph17153707502122712408.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17153707502122712408.bin' '-l' '-1' '-v' '-w' '/tmp/graph17153707502122712408.weights' '-q' '0' '-e' '0.001'
[2026-05-25 16:59:51] [INFO ] Decomposing Gal with order
[2026-05-25 16:59:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 16:59:51] [INFO ] Removed a total of 102 redundant transitions.
[2026-05-25 16:59:51] [INFO ] Flatten gal took : 14 ms
[2026-05-25 16:59:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-25 16:59:51] [INFO ] Time to serialize gal into /tmp/CTLFireability13512824321201601034.gal : 4 ms
[2026-05-25 16:59:51] [INFO ] Time to serialize properties into /tmp/CTLFireability7376183633580018913.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/CTLFireability13512824321201601034.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7376183633580018913.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,2.41024e+25,0.314628,16100,923,28,25016,297,548,32905,36,664,0


Converting to forward existential form...Done !
original formula: E((E(AX((E((i12.u84.p227==1) U (i21.u139.p394==1)) + EF((i21.u140.p393==1)))) U !((AG((i6.u43.p118==1)) * (((i9.u65.p177==1)||(i21.u140.p...321
=> equivalent forward existential formula: [(FwdU(Init,(E(!(EX(!((E((i12.u84.p227==1) U (i21.u139.p394==1)) + E(TRUE U (i21.u140.p393==1)))))) U !((!(E(TRU...415
Reverse transition relation is NOT exact ! Due to transitions t307, i1.t302, i1.t295, i2.t289, i2.u15.t282, i3.t275, i3.t268, i4.t261, i4.t254, i5.t247, i5...657
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
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 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found a local SCC at level 21
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 an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found a local SCC at level 21
(forward)formula 0,1,10.7559,288148,1,0,723907,334,4803,493121,193,961,879421
FORMULA GPUForwardProgress-PT-20b-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 SI_CTL mode, iteration 0 : 368/368 places, 382/382 transitions.
Graph (trivial) has 315 edges and 368 vertex of which 6 / 368 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 565 edges and 363 vertex of which 339 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.2 ms
Discarding 24 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 177 transitions
Trivial Post-agglo rules discarded 177 transitions
Performed 177 trivial Post agglomeration. Transition count delta: 177
Iterating post reduction 0 with 177 rules applied. Total rules applied 179 place count 338 transition count 195
Reduce places removed 177 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 194 rules applied. Total rules applied 373 place count 161 transition count 178
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 380 place count 155 transition count 177
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 381 place count 154 transition count 177
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 43 Pre rules applied. Total rules applied 381 place count 154 transition count 134
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 467 place count 111 transition count 134
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 487 place count 91 transition count 114
Iterating global reduction 4 with 20 rules applied. Total rules applied 507 place count 91 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 508 place count 91 transition count 113
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 508 place count 91 transition count 112
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 510 place count 90 transition count 112
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 5 with 82 rules applied. Total rules applied 592 place count 49 transition count 71
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 593 place count 49 transition count 70
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 594 place count 48 transition count 69
Iterating global reduction 6 with 1 rules applied. Total rules applied 595 place count 48 transition count 69
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 597 place count 47 transition count 68
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 598 place count 46 transition count 67
Applied a total of 598 rules in 27 ms. Remains 46 /368 variables (removed 322) and now considering 67/382 (removed 315) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14970522957292072386.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13017002363663432727.kers'
[2026-05-25 17:00:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14970522957292072386.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13017002363663432727.kers]
Normalized transition count is 66 out of 67 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 66 rows 46 cols 171 entries
Finished phase 1 with 46 SingleSign rule and 0 generalized
[2026-05-25 17:00:02] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13017002363663432727.kers
Total runtime 1 ms.
[2026-05-25 17:00:02] [INFO ] Implicit Places using invariants in 33 ms returned []
[2026-05-25 17:00:02] [INFO ] Invariant cache hit.
[2026-05-25 17:00:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 17:00:02] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2026-05-25 17:00:02] [INFO ] Redundant transitions in 1 ms returned []
Running 46 sub problems to find dead transitions.
[2026-05-25 17:00:02] [INFO ] Invariant cache hit.
[2026-05-25 17:00:02] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (OVERLAPS) 66/92 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (OVERLAPS) 20/112 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (OVERLAPS) 1/113 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 0/113 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/113 variables, and 47 constraints, problems are : Problem set: 0 solved, 46 unsolved in 949 ms.
Refiners :[State Equation: 46/46 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (OVERLAPS) 66/92 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 20/112 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 40/92 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 1/113 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (OVERLAPS) 0/113 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/113 variables, and 93 constraints, problems are : Problem set: 0 solved, 46 unsolved in 1029 ms.
Refiners :[State Equation: 46/46 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1981ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 1981ms
Starting structural reductions in SI_CTL mode, iteration 1 : 46/368 places, 67/382 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2098 ms. Remains : 46/368 places, 67/382 transitions.
[2026-05-25 17:00:04] [INFO ] Flatten gal took : 3 ms
[2026-05-25 17:00:04] [INFO ] Flatten gal took : 3 ms
[2026-05-25 17:00:04] [INFO ] Input system was already deterministic with 67 transitions.
[2026-05-25 17:00:04] [INFO ] Flatten gal took : 1 ms
[2026-05-25 17:00:04] [INFO ] Flatten gal took : 1 ms
[2026-05-25 17:00:04] [INFO ] Time to serialize gal into /tmp/CTLFireability7906124892760663931.gal : 1 ms
[2026-05-25 17:00:04] [INFO ] Time to serialize properties into /tmp/CTLFireability2309542045179355000.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/CTLFireability7906124892760663931.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2309542045179355000.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.28191e+11,0.610646,27648,2,761,5,174393,6,0,251,103346,0


Converting to forward existential form...Done !
original formula: AF((p226==1))
=> equivalent forward existential formula: [FwdG(Init,!((p226==1)))] = FALSE
Hit Full ! (commute/partial/dont) 64/0/3
(forward)formula 0,0,1.07256,29088,1,0,10,180873,20,4,1326,110514,8
FORMULA GPUForwardProgress-PT-20b-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 368/368 places, 382/382 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 350 transition count 364
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 350 transition count 364
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 42 place count 350 transition count 358
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 48 place count 344 transition count 352
Iterating global reduction 1 with 6 rules applied. Total rules applied 54 place count 344 transition count 352
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 60 place count 344 transition count 346
Applied a total of 60 rules in 18 ms. Remains 344 /368 variables (removed 24) and now considering 346/382 (removed 36) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13582647862722898974.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2047637115513383752.kers'
[2026-05-25 17:00:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13582647862722898974.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2047637115513383752.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 346 rows 344 cols 893 entries
Finished phase 1 with 322 SingleSign rule and 1 generalized
[2026-05-25 17:00:05] [INFO ] Computed 21 invariants in 1 ms
Computed 21 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2047637115513383752.kers
Total runtime 2 ms.
[2026-05-25 17:00:05] [INFO ] Implicit Places using invariants in 96 ms returned []
[2026-05-25 17:00:05] [INFO ] Invariant cache hit.
[2026-05-25 17:00:05] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
Running 345 sub problems to find dead transitions.
[2026-05-25 17:00:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/343 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 2 (OVERLAPS) 346/689 variables, 343/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/689 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 4 (OVERLAPS) 1/690 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/690 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 690/690 variables, and 365 constraints, problems are : Problem set: 0 solved, 345 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 345/345 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 345 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/343 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 2 (OVERLAPS) 346/689 variables, 343/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/689 variables, 345/709 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/689 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 5 (OVERLAPS) 1/690 variables, 1/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/690 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 690/690 variables, and 710 constraints, problems are : Problem set: 0 solved, 345 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 345/345 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60063ms problems are : Problem set: 0 solved, 345 unsolved
Search for dead transitions found 0 dead transitions in 60065ms
Starting structural reductions in LTL mode, iteration 1 : 344/368 places, 346/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60412 ms. Remains : 344/368 places, 346/382 transitions.
[2026-05-25 17:01:05] [INFO ] Flatten gal took : 6 ms
[2026-05-25 17:01:05] [INFO ] Flatten gal took : 6 ms
[2026-05-25 17:01:05] [INFO ] Input system was already deterministic with 346 transitions.
[2026-05-25 17:01:05] [INFO ] Flatten gal took : 4 ms
[2026-05-25 17:01:05] [INFO ] Flatten gal took : 3 ms
[2026-05-25 17:01:05] [INFO ] Time to serialize gal into /tmp/CTLFireability5370752862135737810.gal : 1 ms
[2026-05-25 17:01:05] [INFO ] Time to serialize properties into /tmp/CTLFireability6218731438583670762.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/CTLFireability5370752862135737810.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6218731438583670762.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 17:01:35] [INFO ] Flatten gal took : 4 ms
[2026-05-25 17:01:35] [INFO ] Applying decomposition
[2026-05-25 17:01:35] [INFO ] Flatten gal took : 4 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/graph6009776397325390855.txt' '-o' '/tmp/graph6009776397325390855.bin' '-w' '/tmp/graph6009776397325390855.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6009776397325390855.bin' '-l' '-1' '-v' '-w' '/tmp/graph6009776397325390855.weights' '-q' '0' '-e' '0.001'
[2026-05-25 17:01:35] [INFO ] Decomposing Gal with order
[2026-05-25 17:01:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 17:01:35] [INFO ] Removed a total of 101 redundant transitions.
[2026-05-25 17:01:35] [INFO ] Flatten gal took : 11 ms
[2026-05-25 17:01:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-25 17:01:35] [INFO ] Time to serialize gal into /tmp/CTLFireability14389151560638973540.gal : 3 ms
[2026-05-25 17:01:35] [INFO ] Time to serialize properties into /tmp/CTLFireability10822976931727471125.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/CTLFireability14389151560638973540.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10822976931727471125.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,2.12845e+25,0.240951,14116,1024,28,19676,313,555,27285,36,807,0


Converting to forward existential form...Done !
original formula: AF(EX(AG(((i19.u126.p358==1)||(i12.u81.p231==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(E(TRUE U !(((i19.u126.p358==1)||(i12.u81.p231==1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t304, i1.t230, i1.t223, i2.t299, i2.u14.t292, i3.t279, i3.u16.t286, i4.t272, i4.u26.t265, i5....664
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
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 21
(forward)formula 0,0,10.6606,283900,1,0,703138,325,4393,454404,184,1104,867094
FORMULA GPUForwardProgress-PT-20b-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 368/368 places, 382/382 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 351 transition count 365
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 351 transition count 365
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 39 place count 351 transition count 360
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 44 place count 346 transition count 355
Iterating global reduction 1 with 5 rules applied. Total rules applied 49 place count 346 transition count 355
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 54 place count 346 transition count 350
Applied a total of 54 rules in 12 ms. Remains 346 /368 variables (removed 22) and now considering 350/382 (removed 32) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-162099478900928974.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4324284176001799886.kers'
[2026-05-25 17:01:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-162099478900928974.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4324284176001799886.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 350 rows 346 cols 901 entries
Finished phase 1 with 324 SingleSign rule and 1 generalized
[2026-05-25 17:01:46] [INFO ] Computed 21 invariants in 1 ms
Computed 21 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4324284176001799886.kers
Total runtime 2 ms.
[2026-05-25 17:01:46] [INFO ] Implicit Places using invariants in 106 ms returned []
[2026-05-25 17:01:46] [INFO ] Invariant cache hit.
[2026-05-25 17:01:46] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
Running 349 sub problems to find dead transitions.
[2026-05-25 17:01:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/345 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/345 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 2 (OVERLAPS) 350/695 variables, 345/366 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/695 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 4 (OVERLAPS) 1/696 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/696 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 349 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 Real declared 696/696 variables, and 367 constraints, problems are : Problem set: 0 solved, 349 unsolved in 30011 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 346/346 constraints, PredecessorRefiner: 349/349 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 349 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/345 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/345 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 2 (OVERLAPS) 350/695 variables, 345/366 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/695 variables, 349/715 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/695 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 5 (OVERLAPS) 1/696 variables, 1/716 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/696 variables, 0/716 constraints. Problems are: Problem set: 0 solved, 349 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 696/696 variables, and 716 constraints, problems are : Problem set: 0 solved, 349 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 346/346 constraints, PredecessorRefiner: 349/349 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60056ms problems are : Problem set: 0 solved, 349 unsolved
Search for dead transitions found 0 dead transitions in 60057ms
Starting structural reductions in LTL mode, iteration 1 : 346/368 places, 350/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60436 ms. Remains : 346/368 places, 350/382 transitions.
[2026-05-25 17:02:47] [INFO ] Flatten gal took : 4 ms
[2026-05-25 17:02:47] [INFO ] Flatten gal took : 4 ms
[2026-05-25 17:02:47] [INFO ] Input system was already deterministic with 350 transitions.
[2026-05-25 17:02:47] [INFO ] Flatten gal took : 4 ms
[2026-05-25 17:02:47] [INFO ] Flatten gal took : 3 ms
[2026-05-25 17:02:47] [INFO ] Time to serialize gal into /tmp/CTLFireability11297522580066546084.gal : 1 ms
[2026-05-25 17:02:47] [INFO ] Time to serialize properties into /tmp/CTLFireability17321616281578432979.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/CTLFireability11297522580066546084.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17321616281578432979.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.
Detected timeout of ITS tools.
[2026-05-25 17:03:17] [INFO ] Flatten gal took : 3 ms
[2026-05-25 17:03:17] [INFO ] Applying decomposition
[2026-05-25 17:03:17] [INFO ] Flatten gal took : 4 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/graph5725322318988688175.txt' '-o' '/tmp/graph5725322318988688175.bin' '-w' '/tmp/graph5725322318988688175.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5725322318988688175.bin' '-l' '-1' '-v' '-w' '/tmp/graph5725322318988688175.weights' '-q' '0' '-e' '0.001'
[2026-05-25 17:03:17] [INFO ] Decomposing Gal with order
[2026-05-25 17:03:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 17:03:17] [INFO ] Removed a total of 49 redundant transitions.
[2026-05-25 17:03:17] [INFO ] Flatten gal took : 29 ms
[2026-05-25 17:03:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-25 17:03:17] [INFO ] Time to serialize gal into /tmp/CTLFireability13372388958531083442.gal : 6 ms
[2026-05-25 17:03:17] [INFO ] Time to serialize properties into /tmp/CTLFireability8241262998236541525.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/CTLFireability13372388958531083442.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8241262998236541525.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 368/368 places, 382/382 transitions.
Graph (trivial) has 314 edges and 368 vertex of which 6 / 368 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 565 edges and 363 vertex of which 339 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.2 ms
Discarding 24 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 175 transitions
Trivial Post-agglo rules discarded 175 transitions
Performed 175 trivial Post agglomeration. Transition count delta: 175
Iterating post reduction 0 with 175 rules applied. Total rules applied 177 place count 338 transition count 197
Reduce places removed 175 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 192 rules applied. Total rules applied 369 place count 163 transition count 180
Reduce places removed 6 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 9 rules applied. Total rules applied 378 place count 157 transition count 177
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 382 place count 154 transition count 176
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 43 Pre rules applied. Total rules applied 382 place count 154 transition count 133
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 468 place count 111 transition count 133
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 488 place count 91 transition count 113
Iterating global reduction 4 with 20 rules applied. Total rules applied 508 place count 91 transition count 113
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 588 place count 51 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 589 place count 51 transition count 72
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 590 place count 50 transition count 71
Iterating global reduction 5 with 1 rules applied. Total rules applied 591 place count 50 transition count 71
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 593 place count 49 transition count 70
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 594 place count 48 transition count 69
Applied a total of 594 rules in 43 ms. Remains 48 /368 variables (removed 320) and now considering 69/382 (removed 313) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12228246447965992996.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6158068432446502426.kers'
[2026-05-25 17:03:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12228246447965992996.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6158068432446502426.kers]
Normalized transition count is 68 out of 69 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 68 rows 48 cols 175 entries
Finished phase 1 with 48 SingleSign rule and 0 generalized
[2026-05-25 17:03:47] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6158068432446502426.kers
Total runtime 0 ms.
[2026-05-25 17:03:47] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-05-25 17:03:47] [INFO ] Invariant cache hit.
[2026-05-25 17:03:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 17:03:47] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2026-05-25 17:03:47] [INFO ] Redundant transitions in 0 ms returned []
Running 48 sub problems to find dead transitions.
[2026-05-25 17:03:47] [INFO ] Invariant cache hit.
[2026-05-25 17:03:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 68/96 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 20/116 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 1/117 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/117 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/117 variables, and 49 constraints, problems are : Problem set: 0 solved, 48 unsolved in 947 ms.
Refiners :[State Equation: 48/48 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 68/96 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 8/36 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 20/116 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 40/96 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 1/117 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 0/117 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/117 variables, and 97 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1062 ms.
Refiners :[State Equation: 48/48 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2051ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 2052ms
Starting structural reductions in SI_CTL mode, iteration 1 : 48/368 places, 69/382 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2213 ms. Remains : 48/368 places, 69/382 transitions.
[2026-05-25 17:03:49] [INFO ] Flatten gal took : 1 ms
[2026-05-25 17:03:49] [INFO ] Flatten gal took : 5 ms
[2026-05-25 17:03:49] [INFO ] Input system was already deterministic with 69 transitions.
[2026-05-25 17:03:49] [INFO ] Flatten gal took : 1 ms
[2026-05-25 17:03:49] [INFO ] Flatten gal took : 1 ms
[2026-05-25 17:03:49] [INFO ] Time to serialize gal into /tmp/CTLFireability16210617488747319270.gal : 0 ms
[2026-05-25 17:03:49] [INFO ] Time to serialize properties into /tmp/CTLFireability8192930260181850487.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/CTLFireability16210617488747319270.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8192930260181850487.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.38218e+11,0.694492,29408,2,791,5,189952,6,0,261,108645,0


Converting to forward existential form...Done !
original formula: EF(AG(((p270==1)||(p265==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((p270==1)||(p265==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t6, t8, t10, t12, t14, t16, t19, t20, t22, t24, t26, t28, t30, t34, t35, t37, t39, t4...276
(forward)formula 0,0,0.778598,29500,1,0,169,189952,159,72,1702,108645,147
FORMULA GPUForwardProgress-PT-20b-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 368/368 places, 382/382 transitions.
Graph (trivial) has 315 edges and 368 vertex of which 6 / 368 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 565 edges and 363 vertex of which 339 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 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 177 transitions
Trivial Post-agglo rules discarded 177 transitions
Performed 177 trivial Post agglomeration. Transition count delta: 177
Iterating post reduction 0 with 177 rules applied. Total rules applied 179 place count 338 transition count 195
Reduce places removed 177 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 192 rules applied. Total rules applied 371 place count 161 transition count 180
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 376 place count 156 transition count 180
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 376 place count 156 transition count 137
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 462 place count 113 transition count 137
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 481 place count 94 transition count 118
Iterating global reduction 3 with 19 rules applied. Total rules applied 500 place count 94 transition count 118
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 582 place count 53 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 583 place count 53 transition count 76
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 584 place count 52 transition count 75
Iterating global reduction 4 with 1 rules applied. Total rules applied 585 place count 52 transition count 75
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 587 place count 51 transition count 74
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 588 place count 51 transition count 74
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 589 place count 50 transition count 73
Applied a total of 589 rules in 17 ms. Remains 50 /368 variables (removed 318) and now considering 73/382 (removed 309) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9234431010393684177.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9131427464401325498.kers'
[2026-05-25 17:03:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9234431010393684177.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9131427464401325498.kers]
Normalized transition count is 72 out of 73 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 72 rows 50 cols 185 entries
Finished phase 1 with 50 SingleSign rule and 0 generalized
[2026-05-25 17:03:50] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9131427464401325498.kers
Total runtime 0 ms.
[2026-05-25 17:03:50] [INFO ] Implicit Places using invariants in 24 ms returned []
[2026-05-25 17:03:50] [INFO ] Invariant cache hit.
[2026-05-25 17:03:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 17:03:50] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2026-05-25 17:03:50] [INFO ] Redundant transitions in 1 ms returned []
Running 51 sub problems to find dead transitions.
[2026-05-25 17:03:50] [INFO ] Invariant cache hit.
[2026-05-25 17:03:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (OVERLAPS) 72/102 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (OVERLAPS) 20/122 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (OVERLAPS) 1/123 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (OVERLAPS) 0/123 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 51 constraints, problems are : Problem set: 0 solved, 51 unsolved in 1094 ms.
Refiners :[State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 51 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (OVERLAPS) 72/102 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 11/41 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (OVERLAPS) 20/122 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 40/101 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (OVERLAPS) 1/123 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 9 (OVERLAPS) 0/123 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 102 constraints, problems are : Problem set: 0 solved, 51 unsolved in 1113 ms.
Refiners :[State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2231ms problems are : Problem set: 0 solved, 51 unsolved
Search for dead transitions found 0 dead transitions in 2232ms
Starting structural reductions in SI_CTL mode, iteration 1 : 50/368 places, 73/382 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2346 ms. Remains : 50/368 places, 73/382 transitions.
[2026-05-25 17:03:52] [INFO ] Flatten gal took : 1 ms
[2026-05-25 17:03:52] [INFO ] Flatten gal took : 1 ms
[2026-05-25 17:03:52] [INFO ] Input system was already deterministic with 73 transitions.
[2026-05-25 17:03:52] [INFO ] Flatten gal took : 1 ms
[2026-05-25 17:03:52] [INFO ] Flatten gal took : 1 ms
[2026-05-25 17:03:52] [INFO ] Time to serialize gal into /tmp/CTLFireability2655196557660187770.gal : 1 ms
[2026-05-25 17:03:52] [INFO ] Time to serialize properties into /tmp/CTLFireability11664268416568545942.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/CTLFireability2655196557660187770.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11664268416568545942.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,5.52849e+11,0.692504,29940,2,885,5,187216,6,0,273,115435,0


Converting to forward existential form...Done !
original formula: (EF((p318==1)) * EF((p40==0)))
=> equivalent forward existential formula: [(FwdU((Init * E(TRUE U (p318==1))),TRUE) * (p40==0))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t10, t12, t14, t16, t18, t20, t22, t24, t26, t28, t30, t32, t34, t36, t38, t40, t42, ...278
(forward)formula 0,1,1.34518,37380,1,0,176,229700,168,78,1853,167558,161
FORMULA GPUForwardProgress-PT-20b-CTLFireability-2024-12 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 : 368/368 places, 382/382 transitions.
Graph (trivial) has 307 edges and 368 vertex of which 6 / 368 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 565 edges and 363 vertex of which 339 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 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 172 transitions
Trivial Post-agglo rules discarded 172 transitions
Performed 172 trivial Post agglomeration. Transition count delta: 172
Iterating post reduction 0 with 172 rules applied. Total rules applied 174 place count 338 transition count 200
Reduce places removed 172 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 189 rules applied. Total rules applied 363 place count 166 transition count 183
Reduce places removed 6 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 10 rules applied. Total rules applied 373 place count 160 transition count 179
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 377 place count 156 transition count 179
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 41 Pre rules applied. Total rules applied 377 place count 156 transition count 138
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 459 place count 115 transition count 138
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 477 place count 97 transition count 120
Iterating global reduction 4 with 18 rules applied. Total rules applied 495 place count 97 transition count 120
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 577 place count 56 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 578 place count 56 transition count 78
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 579 place count 55 transition count 77
Iterating global reduction 5 with 1 rules applied. Total rules applied 580 place count 55 transition count 77
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 582 place count 54 transition count 76
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 583 place count 54 transition count 76
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 584 place count 53 transition count 75
Applied a total of 584 rules in 16 ms. Remains 53 /368 variables (removed 315) and now considering 75/382 (removed 307) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7453133579519217491.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6691538877534770622.kers'
[2026-05-25 17:03:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7453133579519217491.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6691538877534770622.kers]
Normalized transition count is 74 out of 75 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 74 rows 53 cols 236 entries
Finished phase 1 with 53 SingleSign rule and 0 generalized
[2026-05-25 17:03:54] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6691538877534770622.kers
Total runtime 0 ms.
[2026-05-25 17:03:54] [INFO ] Implicit Places using invariants in 34 ms returned []
[2026-05-25 17:03:54] [INFO ] Invariant cache hit.
[2026-05-25 17:03:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 17:03:54] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2026-05-25 17:03:54] [INFO ] Redundant transitions in 1 ms returned []
Running 73 sub problems to find dead transitions.
[2026-05-25 17:03:54] [INFO ] Invariant cache hit.
[2026-05-25 17:03:54] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 74/125 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (OVERLAPS) 2/127 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 1/128 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 0/128 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 54 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1674 ms.
Refiners :[State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 74/125 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 2/127 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 67/126 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 1/128 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (OVERLAPS) 0/128 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 127 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1979 ms.
Refiners :[State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3695ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 3695ms
Starting structural reductions in SI_CTL mode, iteration 1 : 53/368 places, 75/382 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3832 ms. Remains : 53/368 places, 75/382 transitions.
[2026-05-25 17:03:57] [INFO ] Flatten gal took : 4 ms
[2026-05-25 17:03:57] [INFO ] Flatten gal took : 1 ms
[2026-05-25 17:03:57] [INFO ] Input system was already deterministic with 75 transitions.
[2026-05-25 17:03:57] [INFO ] Flatten gal took : 1 ms
[2026-05-25 17:03:57] [INFO ] Flatten gal took : 1 ms
[2026-05-25 17:03:57] [INFO ] Time to serialize gal into /tmp/CTLFireability18209226077281863403.gal : 1 ms
[2026-05-25 17:03:57] [INFO ] Time to serialize properties into /tmp/CTLFireability17163862696034461517.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/CTLFireability18209226077281863403.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17163862696034461517.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.37681e+12,1.08062,40024,2,873,5,226328,6,0,287,184770,0


Converting to forward existential form...Done !
original formula: AG(E(!(AG((((p278==1)&&(p397==1))&&((p412==1)&&(p208==1))))) U AF(((p282==1) + AG((p172==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(!(!(E(TRUE U !((((p278==1)&&(p397==1))&&((p412==1)&&(p208==1))))))) U !(EG(!(((p282==1) ...198
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t10, t12, t14, t17, t18, t20, t22, t24, t26, t28, t31, t34, t36, t38, t40, t42, t44, ...283
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,3.07158,84628,1,0,777,529133,182,453,2111,552027,743
FORMULA GPUForwardProgress-PT-20b-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 368/368 places, 382/382 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 350 transition count 364
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 350 transition count 364
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 42 place count 350 transition count 358
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 48 place count 344 transition count 352
Iterating global reduction 1 with 6 rules applied. Total rules applied 54 place count 344 transition count 352
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 60 place count 344 transition count 346
Applied a total of 60 rules in 16 ms. Remains 344 /368 variables (removed 24) and now considering 346/382 (removed 36) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10812028676624562154.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17264903074531108087.kers'
[2026-05-25 17:04:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10812028676624562154.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17264903074531108087.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 346 rows 344 cols 893 entries
Finished phase 1 with 322 SingleSign rule and 1 generalized
[2026-05-25 17:04:01] [INFO ] Computed 21 invariants in 1 ms
Computed 21 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17264903074531108087.kers
Total runtime 2 ms.
[2026-05-25 17:04:01] [INFO ] Implicit Places using invariants in 102 ms returned []
[2026-05-25 17:04:01] [INFO ] Invariant cache hit.
[2026-05-25 17:04:01] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
Running 345 sub problems to find dead transitions.
[2026-05-25 17:04:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/343 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 2 (OVERLAPS) 346/689 variables, 343/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/689 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 4 (OVERLAPS) 1/690 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/690 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 690/690 variables, and 365 constraints, problems are : Problem set: 0 solved, 345 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 345/345 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 345 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/343 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 2 (OVERLAPS) 346/689 variables, 343/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/689 variables, 345/709 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/689 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 5 (OVERLAPS) 1/690 variables, 1/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/690 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 690/690 variables, and 710 constraints, problems are : Problem set: 0 solved, 345 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 345/345 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60068ms problems are : Problem set: 0 solved, 345 unsolved
Search for dead transitions found 0 dead transitions in 60068ms
Starting structural reductions in LTL mode, iteration 1 : 344/368 places, 346/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60461 ms. Remains : 344/368 places, 346/382 transitions.
[2026-05-25 17:05:01] [INFO ] Flatten gal took : 5 ms
[2026-05-25 17:05:01] [INFO ] Flatten gal took : 4 ms
[2026-05-25 17:05:01] [INFO ] Input system was already deterministic with 346 transitions.
[2026-05-25 17:05:01] [INFO ] Flatten gal took : 3 ms
[2026-05-25 17:05:01] [INFO ] Flatten gal took : 3 ms
[2026-05-25 17:05:01] [INFO ] Time to serialize gal into /tmp/CTLFireability9677001422068873148.gal : 1 ms
[2026-05-25 17:05:01] [INFO ] Time to serialize properties into /tmp/CTLFireability14118318523025353568.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/CTLFireability9677001422068873148.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14118318523025353568.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 17:05:31] [INFO ] Flatten gal took : 4 ms
[2026-05-25 17:05:31] [INFO ] Applying decomposition
[2026-05-25 17:05:31] [INFO ] Flatten gal took : 4 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/graph3706625103369397967.txt' '-o' '/tmp/graph3706625103369397967.bin' '-w' '/tmp/graph3706625103369397967.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3706625103369397967.bin' '-l' '-1' '-v' '-w' '/tmp/graph3706625103369397967.weights' '-q' '0' '-e' '0.001'
[2026-05-25 17:05:31] [INFO ] Decomposing Gal with order
[2026-05-25 17:05:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 17:05:31] [INFO ] Removed a total of 48 redundant transitions.
[2026-05-25 17:05:31] [INFO ] Flatten gal took : 10 ms
[2026-05-25 17:05:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2026-05-25 17:05:31] [INFO ] Time to serialize gal into /tmp/CTLFireability4136733742158102920.gal : 2 ms
[2026-05-25 17:05:31] [INFO ] Time to serialize properties into /tmp/CTLFireability1718431311519624894.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/CTLFireability4136733742158102920.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1718431311519624894.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 368/368 places, 382/382 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 351 transition count 365
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 351 transition count 365
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 40 place count 351 transition count 359
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 45 place count 346 transition count 354
Iterating global reduction 1 with 5 rules applied. Total rules applied 50 place count 346 transition count 354
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 55 place count 346 transition count 349
Applied a total of 55 rules in 18 ms. Remains 346 /368 variables (removed 22) and now considering 349/382 (removed 33) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7683735616529316520.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15671088843508649587.kers'
[2026-05-25 17:06:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7683735616529316520.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15671088843508649587.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 349 rows 346 cols 899 entries
Finished phase 1 with 324 SingleSign rule and 1 generalized
[2026-05-25 17:06:01] [INFO ] Computed 21 invariants in 4 ms
Computed 21 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-15671088843508649587.kers
Total runtime 5 ms.
[2026-05-25 17:06:01] [INFO ] Implicit Places using invariants in 89 ms returned []
[2026-05-25 17:06:01] [INFO ] Invariant cache hit.
[2026-05-25 17:06:02] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
Running 348 sub problems to find dead transitions.
[2026-05-25 17:06:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/345 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/345 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (OVERLAPS) 349/694 variables, 345/366 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/694 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 1/695 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/695 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 348 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 Real declared 695/695 variables, and 367 constraints, problems are : Problem set: 0 solved, 348 unsolved in 30011 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 346/346 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 348 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/345 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/345 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (OVERLAPS) 349/694 variables, 345/366 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/694 variables, 348/714 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/694 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (OVERLAPS) 1/695 variables, 1/715 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/695 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 348 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 695/695 variables, and 715 constraints, problems are : Problem set: 0 solved, 348 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 346/346 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60053ms problems are : Problem set: 0 solved, 348 unsolved
Search for dead transitions found 0 dead transitions in 60054ms
Starting structural reductions in LTL mode, iteration 1 : 346/368 places, 349/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60366 ms. Remains : 346/368 places, 349/382 transitions.
[2026-05-25 17:07:02] [INFO ] Flatten gal took : 5 ms
[2026-05-25 17:07:02] [INFO ] Flatten gal took : 4 ms
[2026-05-25 17:07:02] [INFO ] Input system was already deterministic with 349 transitions.
[2026-05-25 17:07:02] [INFO ] Flatten gal took : 3 ms
[2026-05-25 17:07:02] [INFO ] Flatten gal took : 3 ms
[2026-05-25 17:07:02] [INFO ] Time to serialize gal into /tmp/CTLFireability16954659870735228483.gal : 1 ms
[2026-05-25 17:07:02] [INFO ] Time to serialize properties into /tmp/CTLFireability1932228904082180998.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/CTLFireability16954659870735228483.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1932228904082180998.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 17:07:32] [INFO ] Flatten gal took : 4 ms
[2026-05-25 17:07:32] [INFO ] Applying decomposition
[2026-05-25 17:07:32] [INFO ] Flatten gal took : 4 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/graph12934040261546017181.txt' '-o' '/tmp/graph12934040261546017181.bin' '-w' '/tmp/graph12934040261546017181.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12934040261546017181.bin' '-l' '-1' '-v' '-w' '/tmp/graph12934040261546017181.weights' '-q' '0' '-e' '0.001'
[2026-05-25 17:07:32] [INFO ] Decomposing Gal with order
[2026-05-25 17:07:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 17:07:32] [INFO ] Removed a total of 101 redundant transitions.
[2026-05-25 17:07:32] [INFO ] Flatten gal took : 11 ms
[2026-05-25 17:07:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-25 17:07:32] [INFO ] Time to serialize gal into /tmp/CTLFireability895284189198141174.gal : 2 ms
[2026-05-25 17:07:32] [INFO ] Time to serialize properties into /tmp/CTLFireability9323366215551965882.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/CTLFireability895284189198141174.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9323366215551965882.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,2.41024e+25,0.229228,14048,1155,30,19833,327,570,26840,35,812,0


Converting to forward existential form...Done !
original formula: AX(A(EF((i19.u128.p358==1)) U (EG((i10.u68.p184==1)) + EG(AG((i0.i1.i1.u8.p19==1))))))
=> equivalent forward existential formula: ([(((FwdU(EY(Init),!((EG((i10.u68.p184==1)) + EG(!(E(TRUE U !((i0.i1.i1.u8.p19==1)))))))) * !(E(TRUE U (i19.u128...349
Reverse transition relation is NOT exact ! Due to transitions t307, i1.t191, i1.u61.t184, i2.t302, i2.t295, i3.t289, i3.t282, i4.t275, i4.u28.t268, i5.t261...666
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
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 21
Detected timeout of ITS tools.
[2026-05-25 17:08:02] [INFO ] Flatten gal took : 9 ms
[2026-05-25 17:08:02] [INFO ] Flatten gal took : 4 ms
[2026-05-25 17:08:02] [INFO ] Applying decomposition
[2026-05-25 17:08:02] [INFO ] Flatten gal took : 4 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/graph3795472851170858318.txt' '-o' '/tmp/graph3795472851170858318.bin' '-w' '/tmp/graph3795472851170858318.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3795472851170858318.bin' '-l' '-1' '-v' '-w' '/tmp/graph3795472851170858318.weights' '-q' '0' '-e' '0.001'
[2026-05-25 17:08:02] [INFO ] Decomposing Gal with order
[2026-05-25 17:08:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 17:08:02] [INFO ] Removed a total of 102 redundant transitions.
[2026-05-25 17:08:02] [INFO ] Flatten gal took : 10 ms
[2026-05-25 17:08:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-25 17:08:02] [INFO ] Time to serialize gal into /tmp/CTLFireability18072284279124657464.gal : 3 ms
[2026-05-25 17:08:02] [INFO ] Time to serialize properties into /tmp/CTLFireability3857547158697411540.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/CTLFireability18072284279124657464.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3857547158697411540.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 7 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,9.42424e+25,0.267933,16504,1145,26,26047,246,602,34509,38,470,0


Converting to forward existential form...Done !
original formula: EG(((EF(EX((i4.u29.p64==0))) + (i13.u89.p244==1)) + (EF(AG((i1.u44.p121==0))) * ((i3.u16.p55==1) + (E(((i2.u11.p30==1)||(((i12.u82.p224==...268
=> equivalent forward existential formula: [FwdG(Init,((E(TRUE U EX((i4.u29.p64==0))) + (i13.u89.p244==1)) + (E(TRUE U !(E(TRUE U !((i1.u44.p121==0))))) * ...335
Reverse transition relation is NOT exact ! Due to transitions t340, i1.t255, i1.t248, i2.t335, i2.t326, i3.t321, i3.t310, i4.t293, i4.u29.t302, i5.t287, i5...645
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
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 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 a local SCC at level 21
(forward)formula 0,1,29.2045,694004,1,0,1.53225e+06,264,4541,1.21012e+06,193,724,1475983
FORMULA GPUForwardProgress-PT-20b-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (EG((((EG((i9.u67.p165==1)) * A((i3.u19.p45==1) U (i15.u105.p279==1))) * (((i19.u137.p359!=1)||(i5.u30.p75!=1))&&(i4.u24.p59==1))) * (((i...386
=> equivalent forward existential formula: ([FwdG(Init,(((EG((i9.u67.p165==1)) * !((E(!((i15.u105.p279==1)) U (!((i3.u19.p45==1)) * !((i15.u105.p279==1))))...684
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
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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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 a local SCC at level 21
(forward)formula 1,0,58.3908,1350624,1,0,2.79741e+06,279,5041,2.87306e+06,214,779,2637717
FORMULA GPUForwardProgress-PT-20b-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: E(EX(((!(EF((((i12.u82.p224==1)&&(i21.u153.p397==1))&&(i21.u151.p412==1)))) + AX((i17.u117.p319!=1))) + !(AG((i19.u132.p352==1))))) U (A(...603
=> equivalent forward existential formula: [(((FwdU(Init,EX(((!(E(TRUE U (((i12.u82.p224==1)&&(i21.u153.p397==1))&&(i21.u151.p412==1)))) + !(EX(!((i17.u117...1661
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 21
(forward)formula 2,0,85.061,1896544,1,0,3.87666e+06,290,5244,4.13511e+06,215,796,3568578
FORMULA GPUForwardProgress-PT-20b-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (EX(((i21.u153.p383==1)&&(i21.u150.p403==1))) + !(A(!(EG((((i14.u97.p265==1)&&(i13.u94.p251==1))||((i11.u75.p218==1)&&(i2.u11.p31==1)))))...361
=> equivalent forward existential formula: ([(EY(Init) * ((i21.u153.p383==1)&&(i21.u150.p403==1)))] != FALSE + ((([((FwdU((FwdU(Init,!((!((E(!(E((((i4.u27....2804
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
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 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 21
(forward)formula 3,1,190.224,2197760,1,0,4.44656e+06,290,2637,4.86587e+06,119,801,2783632
FORMULA GPUForwardProgress-PT-20b-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (EF(((EF((i7.u51.p131==1)) + A((i10.u71.p192==1) U (i11.u80.p215==1))) + ((i13.u90.p247==1) + EF((i20.u143.p377==1))))) * EF(AX((AG(((((i...299
=> equivalent forward existential formula: [(FwdU((Init * E(TRUE U ((E(TRUE U (i7.u51.p131==1)) + !((E(!((i11.u80.p215==1)) U (!((i10.u71.p192==1)) * !((i1...450
(forward)formula 4,1,195.289,2197760,1,0,4.44656e+06,311,3626,4.86587e+06,144,820,3023055
FORMULA GPUForwardProgress-PT-20b-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AX(AX(E(EF(!((((i16.u114.p302==1)&&(i21.u153.p397==1))&&(i21.u151.p412==1)))) U ((i11.u76.p211==1)&&(!((i13.u94.p251==1)&&(i6.u40.p103==1...162
=> equivalent forward existential formula: [(EY(EY(Init)) * !(E(E(TRUE U !((((i16.u114.p302==1)&&(i21.u153.p397==1))&&(i21.u151.p412==1)))) U ((i11.u76.p21...215
(forward)formula 5,1,195.307,2197760,1,0,4.44656e+06,311,3641,4.86587e+06,144,820,3026369
FORMULA GPUForwardProgress-PT-20b-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AX(A(EF((i19.u137.p358==1)) U (EG((i10.u68.p184==1)) + EG(AG((i0.i1.i1.u9.p19==1))))))
=> equivalent forward existential formula: ([(((FwdU(EY(Init),!((EG((i10.u68.p184==1)) + EG(!(E(TRUE U !((i0.i1.i1.u9.p19==1)))))))) * !(E(TRUE U (i19.u137...349
(forward)formula 6,0,239.196,2420972,1,0,4.69178e+06,314,1346,5.0402e+06,77,827,676470
FORMULA GPUForwardProgress-PT-20b-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Total runtime 1594991 ms.

BK_STOP 1779729122148

--------------------
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="GPUForwardProgress-PT-20b"
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 GPUForwardProgress-PT-20b, 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 r146-tall-177961074200450"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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