About the Execution of ITS-Tools for CANConstruction-PT-010
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 11321.319 | 3600000.00 | 3722238.00 | 43001.20 | ????F?FF?TTT?TT? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r034-tall-177946842100618.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 CANConstruction-PT-010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946842100618
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 9.1K Mar 6 09:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Mar 6 09:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Mar 6 09:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 6 09:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Mar 15 07:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 15 07:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 07:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 6 09:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 6 09:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 6 09:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Mar 6 09:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 15 07:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 15 07:49 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 173K 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 CANConstruction-PT-010-CTLFireability-2024-00
FORMULA_NAME CANConstruction-PT-010-CTLFireability-2024-01
FORMULA_NAME CANConstruction-PT-010-CTLFireability-2024-02
FORMULA_NAME CANConstruction-PT-010-CTLFireability-2024-03
FORMULA_NAME CANConstruction-PT-010-CTLFireability-2024-04
FORMULA_NAME CANConstruction-PT-010-CTLFireability-2024-05
FORMULA_NAME CANConstruction-PT-010-CTLFireability-2024-06
FORMULA_NAME CANConstruction-PT-010-CTLFireability-2024-07
FORMULA_NAME CANConstruction-PT-010-CTLFireability-2024-08
FORMULA_NAME CANConstruction-PT-010-CTLFireability-2024-09
FORMULA_NAME CANConstruction-PT-010-CTLFireability-2024-10
FORMULA_NAME CANConstruction-PT-010-CTLFireability-2024-11
FORMULA_NAME CANConstruction-PT-010-CTLFireability-2024-12
FORMULA_NAME CANConstruction-PT-010-CTLFireability-2024-13
FORMULA_NAME CANConstruction-PT-010-CTLFireability-2024-14
FORMULA_NAME CANConstruction-PT-010-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1779631063206
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-24 13:57:44] [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-24 13:57:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 13:57:44] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2026-05-24 13:57:44] [INFO ] Transformed 322 places.
[2026-05-24 13:57:44] [INFO ] Transformed 480 transitions.
[2026-05-24 13:57:44] [INFO ] Parsed PT model containing 322 places and 480 transitions and 1400 arcs in 229 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Support contains 107 out of 322 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 480/480 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 271 transition count 378
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 271 transition count 378
Applied a total of 102 rules in 41 ms. Remains 271 /322 variables (removed 51) and now considering 378/480 (removed 102) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7549922724051566239.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6458301940119037181.kers'
[2026-05-24 13:57:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7549922724051566239.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6458301940119037181.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 378 rows 271 cols 816 entries
Finished phase 1 with 240 SingleSign rule and 10 generalized
[2026-05-24 13:57:44] [INFO ] Computed 21 invariants in 1 ms
Computed 21 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-6458301940119037181.kers
Total runtime 7 ms.
[2026-05-24 13:57:45] [INFO ] Implicit Places using invariants in 379 ms returned [12, 26, 96, 138]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 437 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 267/322 places, 378/480 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 264 transition count 375
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 264 transition count 375
Applied a total of 6 rules in 30 ms. Remains 264 /267 variables (removed 3) and now considering 375/378 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10248562641859299773.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11024686795582936974.kers'
[2026-05-24 13:57:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10248562641859299773.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11024686795582936974.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 375 rows 264 cols 795 entries
Finished phase 1 with 241 SingleSign rule and 6 generalized
[2026-05-24 13:57:45] [INFO ] Computed 17 invariants in 1 ms
Computed 17 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11024686795582936974.kers
Total runtime 2 ms.
[2026-05-24 13:57:45] [INFO ] Implicit Places using invariants in 118 ms returned []
[2026-05-24 13:57:45] [INFO ] Invariant cache hit.
[2026-05-24 13:57:45] [INFO ] State equation strengthened by 190 read => feed constraints.
[2026-05-24 13:57:45] [INFO ] Implicit Places using invariants and state equation in 542 ms returned []
Implicit Place search using SMT with State Equation took 677 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 264/322 places, 375/480 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1200 ms. Remains : 264/322 places, 375/480 transitions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 375/375 transitions.
Applied a total of 0 rules in 6 ms. Remains 264 /264 variables (removed 0) and now considering 375/375 (removed 0) transitions.
[2026-05-24 13:57:46] [INFO ] Invariant cache hit.
[2026-05-24 13:57:46] [INFO ] Implicit Places using invariants in 136 ms returned []
[2026-05-24 13:57:46] [INFO ] Invariant cache hit.
[2026-05-24 13:57:46] [INFO ] State equation strengthened by 190 read => feed constraints.
[2026-05-24 13:57:46] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 555 ms to find 0 implicit places.
Running 365 sub problems to find dead transitions.
[2026-05-24 13:57:46] [INFO ] Invariant cache hit.
[2026-05-24 13:57:46] [INFO ] State equation strengthened by 190 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/263 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 14/111 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 9 (OVERLAPS) 375/638 variables, 263/376 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/638 variables, 190/566 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 638/639 variables, and 566 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 263/264 constraints, ReadFeed: 190/190 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 96/96 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 365 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/263 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 96/113 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (OVERLAPS) 375/638 variables, 263/376 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/638 variables, 190/566 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/638 variables, 365/931 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/638 variables, 0/931 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 8 (OVERLAPS) 1/639 variables, 1/932 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 639/639 variables, and 932 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 264/264 constraints, ReadFeed: 190/190 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 96/96 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60180ms problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 60195ms
Finished structural reductions in LTL mode , in 1 iterations and 60782 ms. Remains : 264/264 places, 375/375 transitions.
Support contains 107 out of 264 places after structural reductions.
[2026-05-24 13:58:47] [INFO ] Flatten gal took : 72 ms
[2026-05-24 13:58:47] [INFO ] Flatten gal took : 42 ms
[2026-05-24 13:58:47] [INFO ] Input system was already deterministic with 375 transitions.
Support contains 105 out of 264 places (down from 107) after GAL structural reductions.
RANDOM walk for 40000 steps (235 resets) in 1581 ms. (25 steps per ms) remains 8/69 properties
BEST_FIRST walk for 40003 steps (29 resets) in 156 ms. (254 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40003 steps (23 resets) in 96 ms. (412 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 145 ms. (273 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (30 resets) in 101 ms. (392 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (20 resets) in 78 ms. (506 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (29 resets) in 68 ms. (579 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (29 resets) in 75 ms. (526 steps per ms) remains 4/4 properties
[2026-05-24 13:58:48] [INFO ] Invariant cache hit.
[2026-05-24 13:58:48] [INFO ] State equation strengthened by 190 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp39 is UNSAT
At refinement iteration 1 (OVERLAPS) 172/188 variables, 11/11 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 50/238 variables, 3/14 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 1/15 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 26/264 variables, 3/18 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/264 variables, 12/30 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 6/36 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/264 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 375/639 variables, 264/300 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/639 variables, 190/490 constraints. Problems are: Problem set: 1 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/639 variables, 0/490 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/639 variables, 0/490 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 639/639 variables, and 490 constraints, problems are : Problem set: 1 solved, 3 unsolved in 2731 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 264/264 constraints, ReadFeed: 190/190 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 126/135 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 101/236 variables, 3/12 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 1/13 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 28/264 variables, 5/18 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/264 variables, 18/36 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 4/40 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/264 variables, 0/40 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 375/639 variables, 264/304 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/639 variables, 190/494 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/639 variables, 3/497 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/639 variables, 0/497 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/639 variables, 0/497 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 639/639 variables, and 497 constraints, problems are : Problem set: 1 solved, 3 unsolved in 1022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 264/264 constraints, ReadFeed: 190/190 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3776ms problems are : Problem set: 1 solved, 3 unsolved
Parikh walk visited 0 properties in 28 ms.
Support contains 9 out of 264 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 264/264 places, 375/375 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 264 transition count 325
Reduce places removed 50 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 61 rules applied. Total rules applied 111 place count 214 transition count 314
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 122 place count 203 transition count 314
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 122 place count 203 transition count 309
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 132 place count 198 transition count 309
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 160 place count 170 transition count 253
Iterating global reduction 3 with 28 rules applied. Total rules applied 188 place count 170 transition count 253
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 191 place count 170 transition count 250
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 194 place count 167 transition count 250
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 214 place count 157 transition count 240
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -69
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 234 place count 147 transition count 309
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 235 place count 147 transition count 309
Applied a total of 235 rules in 213 ms. Remains 147 /264 variables (removed 117) and now considering 309/375 (removed 66) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 213 ms. Remains : 147/264 places, 309/375 transitions.
RANDOM walk for 40000 steps (656 resets) in 476 ms. (83 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (69 resets) in 92 ms. (430 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (62 resets) in 75 ms. (526 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (68 resets) in 85 ms. (465 steps per ms) remains 2/2 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14395142618250601794.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4676726809449964994.kers'
[2026-05-24 13:58:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14395142618250601794.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4676726809449964994.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 309 rows 147 cols 693 entries
Finished phase 1 with 124 SingleSign rule and 6 generalized
[2026-05-24 13:58:52] [INFO ] Computed 17 invariants in 0 ms
Computed 17 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4676726809449964994.kers
Total runtime 1 ms.
[2026-05-24 13:58:52] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 58/64 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 52/116 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 31/147 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 309/456 variables, 147/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/456 variables, 284/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/456 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/456 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/456 variables, and 455 constraints, problems are : Problem set: 0 solved, 2 unsolved in 938 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 147/147 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 58/64 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 52/116 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 31/147 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 309/456 variables, 147/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/456 variables, 284/456 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/456 variables, 2/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/456 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/456 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 456/456 variables, and 458 constraints, problems are : Problem set: 0 solved, 2 unsolved in 374 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 147/147 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1322ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 6 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 309/309 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 147 transition count 308
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 146 transition count 308
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 2 with 2 rules applied. Total rules applied 4 place count 145 transition count 307
Applied a total of 4 rules in 124 ms. Remains 145 /147 variables (removed 2) and now considering 307/309 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 145/147 places, 307/309 transitions.
RANDOM walk for 40000 steps (653 resets) in 309 ms. (129 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (68 resets) in 60 ms. (655 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (66 resets) in 24 ms. (1600 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1591924 steps, run timeout after 3001 ms. (steps per millisecond=530 ) properties seen :0 out of 2
Probabilistic random walk after 1591924 steps, saw 163328 distinct states, run finished after 3005 ms. (steps per millisecond=529 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12709278945571230396.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7681446766640938409.kers'
[2026-05-24 13:58:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12709278945571230396.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7681446766640938409.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 307 rows 145 cols 689 entries
Finished phase 1 with 122 SingleSign rule and 6 generalized
[2026-05-24 13:58:57] [INFO ] Computed 17 invariants in 1 ms
Computed 17 P flows in 20 ms.
Exported basis to /tmp/petrispot-output-7681446766640938409.kers
Total runtime 20 ms.
[2026-05-24 13:58:57] [INFO ] State equation strengthened by 285 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 42/48 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 52/100 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 45/145 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 307/452 variables, 145/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/452 variables, 285/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/452 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/452 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 452/452 variables, and 453 constraints, problems are : Problem set: 0 solved, 2 unsolved in 658 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 145/145 constraints, ReadFeed: 285/285 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 42/48 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 52/100 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 45/145 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 307/452 variables, 145/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/452 variables, 285/456 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/452 variables, 2/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/452 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/452 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 452/452 variables, and 458 constraints, problems are : Problem set: 0 solved, 2 unsolved in 550 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 145/145 constraints, ReadFeed: 285/285 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1271ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 6 out of 145 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 145/145 places, 307/307 transitions.
Applied a total of 0 rules in 21 ms. Remains 145 /145 variables (removed 0) and now considering 307/307 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 145/145 places, 307/307 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 145/145 places, 307/307 transitions.
Applied a total of 0 rules in 25 ms. Remains 145 /145 variables (removed 0) and now considering 307/307 (removed 0) transitions.
[2026-05-24 13:58:58] [INFO ] Invariant cache hit.
[2026-05-24 13:58:58] [INFO ] Implicit Places using invariants in 160 ms returned [14, 22, 28, 34, 43, 49]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 162 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 139/145 places, 307/307 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 137 transition count 305
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 137 transition count 305
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 24 place count 127 transition count 295
Applied a total of 24 rules in 102 ms. Remains 127 /139 variables (removed 12) and now considering 295/307 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11511920865364191955.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4832279156750371651.kers'
[2026-05-24 13:58:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11511920865364191955.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4832279156750371651.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 295 rows 127 cols 691 entries
Finished phase 1 with 116 SingleSign rule and 0 generalized
[2026-05-24 13:58:58] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4832279156750371651.kers
Total runtime 1 ms.
[2026-05-24 13:58:58] [INFO ] Implicit Places using invariants in 119 ms returned []
[2026-05-24 13:58:58] [INFO ] Invariant cache hit.
[2026-05-24 13:58:58] [INFO ] State equation strengthened by 280 read => feed constraints.
[2026-05-24 13:58:59] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 463 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 127/145 places, 295/307 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 752 ms. Remains : 127/145 places, 295/307 transitions.
RANDOM walk for 40000 steps (756 resets) in 125 ms. (317 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (75 resets) in 29 ms. (1333 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (73 resets) in 33 ms. (1176 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1776294 steps, run timeout after 3001 ms. (steps per millisecond=591 ) properties seen :0 out of 2
Probabilistic random walk after 1776294 steps, saw 169866 distinct states, run finished after 3001 ms. (steps per millisecond=591 ) properties seen :0
[2026-05-24 13:59:02] [INFO ] Invariant cache hit.
[2026-05-24 13:59:02] [INFO ] State equation strengthened by 280 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 115/121 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 6/127 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 295/422 variables, 127/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 280/421 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/422 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 421 constraints, problems are : Problem set: 0 solved, 2 unsolved in 491 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 127/127 constraints, ReadFeed: 280/280 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 115/121 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 6/127 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 295/422 variables, 127/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 280/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 2/424 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/422 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/422 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 422/422 variables, and 424 constraints, problems are : Problem set: 0 solved, 2 unsolved in 468 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 127/127 constraints, ReadFeed: 280/280 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 975ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 6 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 295/295 transitions.
Applied a total of 0 rules in 49 ms. Remains 127 /127 variables (removed 0) and now considering 295/295 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 127/127 places, 295/295 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 295/295 transitions.
Applied a total of 0 rules in 27 ms. Remains 127 /127 variables (removed 0) and now considering 295/295 (removed 0) transitions.
[2026-05-24 13:59:03] [INFO ] Invariant cache hit.
[2026-05-24 13:59:03] [INFO ] Implicit Places using invariants in 133 ms returned []
[2026-05-24 13:59:03] [INFO ] Invariant cache hit.
[2026-05-24 13:59:03] [INFO ] State equation strengthened by 280 read => feed constraints.
[2026-05-24 13:59:03] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 541 ms to find 0 implicit places.
[2026-05-24 13:59:03] [INFO ] Redundant transitions in 12 ms returned []
Running 285 sub problems to find dead transitions.
[2026-05-24 13:59:03] [INFO ] Invariant cache hit.
[2026-05-24 13:59:03] [INFO ] State equation strengthened by 280 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (OVERLAPS) 295/421 variables, 126/152 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/421 variables, 280/432 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/421 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 7 (OVERLAPS) 1/422 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 9 (OVERLAPS) 0/422 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 285 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 433 constraints, problems are : Problem set: 0 solved, 285 unsolved in 24210 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 127/127 constraints, ReadFeed: 280/280 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 285 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 15/26 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (OVERLAPS) 295/421 variables, 126/152 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/421 variables, 280/432 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/421 variables, 285/717 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/421 variables, 0/717 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 7 (OVERLAPS) 1/422 variables, 1/718 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 0/718 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 9 (OVERLAPS) 0/422 variables, 0/718 constraints. Problems are: Problem set: 0 solved, 285 unsolved
No progress, stopping.
After SMT solving in domain Int declared 422/422 variables, and 718 constraints, problems are : Problem set: 0 solved, 285 unsolved in 28576 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 127/127 constraints, ReadFeed: 280/280 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52835ms problems are : Problem set: 0 solved, 285 unsolved
Search for dead transitions found 0 dead transitions in 52836ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53436 ms. Remains : 127/127 places, 295/295 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 196 edges and 127 vertex of which 90 / 127 are part of one of the 9 SCC in 3 ms
Free SCC test removed 81 places
Drop transitions (Empty/Sink Transition effects.) removed 162 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 234 transitions.
Graph (complete) has 99 edges and 46 vertex of which 28 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 24 rules applied. Total rules applied 26 place count 28 transition count 29
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 42 place count 19 transition count 22
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 47 place count 14 transition count 17
Iterating global reduction 2 with 5 rules applied. Total rules applied 52 place count 14 transition count 17
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 14 transition count 16
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 55 place count 14 transition count 16
Applied a total of 55 rules in 12 ms. Remains 14 /127 variables (removed 113) and now considering 16/295 (removed 279) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-218322645425621382.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10951091047434250354.kers'
[2026-05-24 13:59:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-218322645425621382.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10951091047434250354.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 16 rows 14 cols 31 entries
Finished phase 1 with 13 SingleSign rule and 0 generalized
[2026-05-24 13:59:56] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10951091047434250354.kers
Total runtime 1 ms.
[2026-05-24 13:59:56] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-24 13:59:56] [INFO ] After 8ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-24 13:59:56] [INFO ] After 17ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
[2026-05-24 13:59:56] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 75 ms.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2026-05-24 13:59:56] [INFO ] Flatten gal took : 17 ms
[2026-05-24 13:59:56] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA CANConstruction-PT-010-CTLFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-24 13:59:56] [INFO ] Flatten gal took : 18 ms
[2026-05-24 13:59:56] [INFO ] Input system was already deterministic with 375 transitions.
Support contains 93 out of 264 places (down from 99) after GAL structural reductions.
Computed a total of 38 stabilizing places and 47 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 375/375 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 235 transition count 318
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 235 transition count 318
Applied a total of 58 rules in 6 ms. Remains 235 /264 variables (removed 29) and now considering 318/375 (removed 57) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13921382097656693940.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17572525206053262770.kers'
[2026-05-24 13:59:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13921382097656693940.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17572525206053262770.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 318 rows 235 cols 680 entries
Finished phase 1 with 212 SingleSign rule and 6 generalized
[2026-05-24 13:59:56] [INFO ] Computed 17 invariants in 1 ms
Computed 17 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17572525206053262770.kers
Total runtime 2 ms.
[2026-05-24 13:59:57] [INFO ] Implicit Places using invariants in 114 ms returned [36, 50, 64, 78, 104, 118]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 116 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 229/264 places, 318/375 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 223 transition count 312
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 223 transition count 312
Applied a total of 12 rules in 8 ms. Remains 223 /229 variables (removed 6) and now considering 312/318 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9683435361215070708.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11666876625463344297.kers'
[2026-05-24 13:59:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9683435361215070708.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11666876625463344297.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 312 rows 223 cols 644 entries
Finished phase 1 with 212 SingleSign rule and 0 generalized
[2026-05-24 13:59:57] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11666876625463344297.kers
Total runtime 1 ms.
[2026-05-24 13:59:57] [INFO ] Implicit Places using invariants in 101 ms returned []
[2026-05-24 13:59:57] [INFO ] Invariant cache hit.
[2026-05-24 13:59:57] [INFO ] State equation strengthened by 190 read => feed constraints.
[2026-05-24 13:59:57] [INFO ] Implicit Places using invariants and state equation in 485 ms returned []
Implicit Place search using SMT with State Equation took 589 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 223/264 places, 312/375 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 719 ms. Remains : 223/264 places, 312/375 transitions.
[2026-05-24 13:59:57] [INFO ] Flatten gal took : 14 ms
[2026-05-24 13:59:57] [INFO ] Flatten gal took : 12 ms
[2026-05-24 13:59:57] [INFO ] Input system was already deterministic with 312 transitions.
[2026-05-24 13:59:57] [INFO ] Flatten gal took : 10 ms
[2026-05-24 13:59:57] [INFO ] Flatten gal took : 9 ms
[2026-05-24 13:59:57] [INFO ] Time to serialize gal into /tmp/CTLFireability7173214730799964535.gal : 7 ms
[2026-05-24 13:59:57] [INFO ] Time to serialize properties into /tmp/CTLFireability5011899285969491634.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/CTLFireability7173214730799964535.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5011899285969491634.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-24 14:00:27] [INFO ] Flatten gal took : 10 ms
[2026-05-24 14:00:27] [INFO ] Applying decomposition
[2026-05-24 14:00:27] [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/graph7017042980109323944.txt' '-o' '/tmp/graph7017042980109323944.bin' '-w' '/tmp/graph7017042980109323944.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7017042980109323944.bin' '-l' '-1' '-v' '-w' '/tmp/graph7017042980109323944.weights' '-q' '0' '-e' '0.001'
[2026-05-24 14:00:27] [INFO ] Decomposing Gal with order
[2026-05-24 14:00:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 14:00:28] [INFO ] Removed a total of 186 redundant transitions.
[2026-05-24 14:00:28] [INFO ] Flatten gal took : 185 ms
[2026-05-24 14:00:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 320 labels/synchronizations in 20 ms.
[2026-05-24 14:00:28] [INFO ] Time to serialize gal into /tmp/CTLFireability7060980227266854787.gal : 5 ms
[2026-05-24 14:00:28] [INFO ] Time to serialize properties into /tmp/CTLFireability15052204022404280222.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/CTLFireability7060980227266854787.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15052204022404280222.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,5.27011e+10,10.2684,275280,18112,5368,455441,45868,602,1.14999e+06,219,399254,0
Converting to forward existential form...Done !
original formula: (AG(((i2.u7.EmptyCAN>=1)&&(i6.u26.Node6ReadyToInsert>=1))) + AX(AX(!(A(!(((i6.u23.Node7IsInserted>=1)&&(i6.u23.Node6requestsent7>=1))) U ...192
=> equivalent forward existential formula: [((EY(EY((Init * !(!(E(TRUE U !(((i2.u7.EmptyCAN>=1)&&(i6.u26.Node6ReadyToInsert>=1))))))))) * !(EG(!(EG((i6.u23...344
Reverse transition relation is NOT exact ! Due to transitions t4, t15, t26, t37, t48, t59, t70, t81, t92, t103, i0.t148, i0.u0.t3, i1.t112, i1.u4.t14, i2.t...450
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 375/375 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 239 transition count 326
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 239 transition count 326
Applied a total of 50 rules in 6 ms. Remains 239 /264 variables (removed 25) and now considering 326/375 (removed 49) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14530541177191308886.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11987169218056320869.kers'
[2026-05-24 14:00:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14530541177191308886.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11987169218056320869.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 326 rows 239 cols 696 entries
Finished phase 1 with 216 SingleSign rule and 6 generalized
[2026-05-24 14:00:58] [INFO ] Computed 17 invariants in 1 ms
Computed 17 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11987169218056320869.kers
Total runtime 2 ms.
[2026-05-24 14:00:58] [INFO ] Implicit Places using invariants in 112 ms returned [36, 50, 104, 118]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 115 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 235/264 places, 326/375 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 231 transition count 322
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 231 transition count 322
Applied a total of 8 rules in 4 ms. Remains 231 /235 variables (removed 4) and now considering 322/326 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14175875728454818014.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12317724308127319262.kers'
[2026-05-24 14:00:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14175875728454818014.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12317724308127319262.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 322 rows 231 cols 672 entries
Finished phase 1 with 216 SingleSign rule and 2 generalized
[2026-05-24 14:00:58] [INFO ] Computed 13 invariants in 2 ms
Computed 13 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-12317724308127319262.kers
Total runtime 4 ms.
[2026-05-24 14:00:58] [INFO ] Implicit Places using invariants in 103 ms returned []
[2026-05-24 14:00:58] [INFO ] Invariant cache hit.
[2026-05-24 14:00:58] [INFO ] State equation strengthened by 190 read => feed constraints.
[2026-05-24 14:00:58] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 231/264 places, 322/375 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 603 ms. Remains : 231/264 places, 322/375 transitions.
[2026-05-24 14:00:58] [INFO ] Flatten gal took : 16 ms
[2026-05-24 14:00:58] [INFO ] Flatten gal took : 14 ms
[2026-05-24 14:00:58] [INFO ] Input system was already deterministic with 322 transitions.
[2026-05-24 14:00:59] [INFO ] Flatten gal took : 12 ms
[2026-05-24 14:00:59] [INFO ] Flatten gal took : 10 ms
[2026-05-24 14:00:59] [INFO ] Time to serialize gal into /tmp/CTLFireability17263260903286942362.gal : 2 ms
[2026-05-24 14:00:59] [INFO ] Time to serialize properties into /tmp/CTLFireability5269879930256436553.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/CTLFireability17263260903286942362.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5269879930256436553.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-24 14:01:29] [INFO ] Flatten gal took : 11 ms
[2026-05-24 14:01:29] [INFO ] Applying decomposition
[2026-05-24 14:01:29] [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/graph4626224402451527279.txt' '-o' '/tmp/graph4626224402451527279.bin' '-w' '/tmp/graph4626224402451527279.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4626224402451527279.bin' '-l' '-1' '-v' '-w' '/tmp/graph4626224402451527279.weights' '-q' '0' '-e' '0.001'
[2026-05-24 14:01:29] [INFO ] Decomposing Gal with order
[2026-05-24 14:01:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 14:01:29] [INFO ] Removed a total of 192 redundant transitions.
[2026-05-24 14:01:29] [INFO ] Flatten gal took : 22 ms
[2026-05-24 14:01:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 320 labels/synchronizations in 8 ms.
[2026-05-24 14:01:29] [INFO ] Time to serialize gal into /tmp/CTLFireability4807592072019257499.gal : 3 ms
[2026-05-24 14:01:29] [INFO ] Time to serialize properties into /tmp/CTLFireability7199821822389068494.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/CTLFireability4807592072019257499.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7199821822389068494.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.4602e+10,14.2149,341528,16920,3094,683371,22524,678,1.07946e+06,200,225073,0
Converting to forward existential form...Done !
original formula: (EG(((!(E((i5.u40.Node3GiveAnswer4<1) U (((i5.u19.Node2IsInserted>=1)&&(i9.u36.Node8requestsent2>=1))&&(i6.u41.Node7GiveAnswer5>=1)))) + ...934
=> equivalent forward existential formula: [(((Init * EG(((!(E((i5.u40.Node3GiveAnswer4<1) U (((i5.u19.Node2IsInserted>=1)&&(i9.u36.Node8requestsent2>=1))&...2013
Reverse transition relation is NOT exact ! Due to transitions t4, t15, t26, t37, t48, t53, t60, t65, t72, t83, t94, t105, i0.t150, i0.u0.t3, i1.t114, i1.u4...554
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 375/375 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 240 transition count 328
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 240 transition count 328
Applied a total of 48 rules in 6 ms. Remains 240 /264 variables (removed 24) and now considering 328/375 (removed 47) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-32618111248738833.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12735445822662984986.kers'
[2026-05-24 14:01:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-32618111248738833.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12735445822662984986.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 328 rows 240 cols 700 entries
Finished phase 1 with 217 SingleSign rule and 6 generalized
[2026-05-24 14:01:59] [INFO ] Computed 17 invariants in 1 ms
Computed 17 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12735445822662984986.kers
Total runtime 2 ms.
[2026-05-24 14:01:59] [INFO ] Implicit Places using invariants in 127 ms returned [36, 50, 64, 78, 104, 118]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 129 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 234/264 places, 328/375 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 228 transition count 322
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 228 transition count 322
Applied a total of 12 rules in 7 ms. Remains 228 /234 variables (removed 6) and now considering 322/328 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9818194383067639549.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15765285795943368092.kers'
[2026-05-24 14:01:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9818194383067639549.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15765285795943368092.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 322 rows 228 cols 664 entries
Finished phase 1 with 217 SingleSign rule and 0 generalized
[2026-05-24 14:01:59] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15765285795943368092.kers
Total runtime 1 ms.
[2026-05-24 14:01:59] [INFO ] Implicit Places using invariants in 96 ms returned []
[2026-05-24 14:01:59] [INFO ] Invariant cache hit.
[2026-05-24 14:01:59] [INFO ] State equation strengthened by 190 read => feed constraints.
[2026-05-24 14:01:59] [INFO ] Implicit Places using invariants and state equation in 449 ms returned []
Implicit Place search using SMT with State Equation took 547 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 228/264 places, 322/375 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 689 ms. Remains : 228/264 places, 322/375 transitions.
[2026-05-24 14:01:59] [INFO ] Flatten gal took : 8 ms
[2026-05-24 14:01:59] [INFO ] Flatten gal took : 7 ms
[2026-05-24 14:01:59] [INFO ] Input system was already deterministic with 322 transitions.
[2026-05-24 14:02:00] [INFO ] Flatten gal took : 8 ms
[2026-05-24 14:02:00] [INFO ] Flatten gal took : 6 ms
[2026-05-24 14:02:00] [INFO ] Time to serialize gal into /tmp/CTLFireability3547797332331934592.gal : 2 ms
[2026-05-24 14:02:00] [INFO ] Time to serialize properties into /tmp/CTLFireability3086803689338832412.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/CTLFireability3547797332331934592.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3086803689338832412.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-24 14:02:30] [INFO ] Flatten gal took : 7 ms
[2026-05-24 14:02:30] [INFO ] Applying decomposition
[2026-05-24 14:02:30] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph11132567836253367994.txt' '-o' '/tmp/graph11132567836253367994.bin' '-w' '/tmp/graph11132567836253367994.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11132567836253367994.bin' '-l' '-1' '-v' '-w' '/tmp/graph11132567836253367994.weights' '-q' '0' '-e' '0.001'
[2026-05-24 14:02:30] [INFO ] Decomposing Gal with order
[2026-05-24 14:02:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 14:02:30] [INFO ] Removed a total of 190 redundant transitions.
[2026-05-24 14:02:30] [INFO ] Flatten gal took : 17 ms
[2026-05-24 14:02:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 338 labels/synchronizations in 10 ms.
[2026-05-24 14:02:30] [INFO ] Time to serialize gal into /tmp/CTLFireability1223523920722165246.gal : 4 ms
[2026-05-24 14:02:30] [INFO ] Time to serialize properties into /tmp/CTLFireability12459601096442410910.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/CTLFireability1223523920722165246.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12459601096442410910.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,5.50948e+10,9.23065,234216,12928,3871,400035,28199,741,924527,232,256078,0
Converting to forward existential form...Done !
original formula: E((i7.u34.Node7GiveAnswer8>=1) U ((EX(((i1.u6.Node2IsInserted>=1)&&(i5.u23.Node5requestsent2>=1))) + EG((((EG(((i4.u19.Node6IsInserted>=1...622
=> equivalent forward existential formula: (([(EY(FwdU(Init,(i7.u34.Node7GiveAnswer8>=1))) * ((i1.u6.Node2IsInserted>=1)&&(i5.u23.Node5requestsent2>=1)))] ...933
Reverse transition relation is NOT exact ! Due to transitions t4, t15, t26, t37, t48, t59, t70, t81, t92, t103, i0.t148, i0.u0.t3, i1.t112, i1.u4.t14, i2.i...633
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 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 375/375 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 235 transition count 318
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 235 transition count 318
Applied a total of 58 rules in 10 ms. Remains 235 /264 variables (removed 29) and now considering 318/375 (removed 57) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14206250275373363943.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13251375591439456667.kers'
[2026-05-24 14:03:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14206250275373363943.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13251375591439456667.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 318 rows 235 cols 680 entries
Finished phase 1 with 212 SingleSign rule and 6 generalized
[2026-05-24 14:03:00] [INFO ] Computed 17 invariants in 8 ms
Computed 17 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-13251375591439456667.kers
Total runtime 9 ms.
[2026-05-24 14:03:00] [INFO ] Implicit Places using invariants in 134 ms returned [36, 50, 64, 78, 104, 118]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 149 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 229/264 places, 318/375 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 223 transition count 312
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 223 transition count 312
Applied a total of 12 rules in 4 ms. Remains 223 /229 variables (removed 6) and now considering 312/318 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9518482268370909453.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14367995082610347873.kers'
[2026-05-24 14:03:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9518482268370909453.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14367995082610347873.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 312 rows 223 cols 644 entries
Finished phase 1 with 212 SingleSign rule and 0 generalized
[2026-05-24 14:03:00] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14367995082610347873.kers
Total runtime 1 ms.
[2026-05-24 14:03:00] [INFO ] Implicit Places using invariants in 106 ms returned []
[2026-05-24 14:03:00] [INFO ] Invariant cache hit.
[2026-05-24 14:03:00] [INFO ] State equation strengthened by 190 read => feed constraints.
[2026-05-24 14:03:00] [INFO ] Implicit Places using invariants and state equation in 489 ms returned []
Implicit Place search using SMT with State Equation took 605 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 223/264 places, 312/375 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 770 ms. Remains : 223/264 places, 312/375 transitions.
[2026-05-24 14:03:01] [INFO ] Flatten gal took : 5 ms
[2026-05-24 14:03:01] [INFO ] Flatten gal took : 6 ms
[2026-05-24 14:03:01] [INFO ] Input system was already deterministic with 312 transitions.
[2026-05-24 14:03:01] [INFO ] Flatten gal took : 6 ms
[2026-05-24 14:03:01] [INFO ] Flatten gal took : 5 ms
[2026-05-24 14:03:01] [INFO ] Time to serialize gal into /tmp/CTLFireability4643984970082656232.gal : 5 ms
[2026-05-24 14:03:01] [INFO ] Time to serialize properties into /tmp/CTLFireability17014981528047548321.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/CTLFireability4643984970082656232.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17014981528047548321.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-24 14:03:31] [INFO ] Flatten gal took : 8 ms
[2026-05-24 14:03:31] [INFO ] Applying decomposition
[2026-05-24 14:03:31] [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/graph16647875659728169603.txt' '-o' '/tmp/graph16647875659728169603.bin' '-w' '/tmp/graph16647875659728169603.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16647875659728169603.bin' '-l' '-1' '-v' '-w' '/tmp/graph16647875659728169603.weights' '-q' '0' '-e' '0.001'
[2026-05-24 14:03:31] [INFO ] Decomposing Gal with order
[2026-05-24 14:03:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 14:03:31] [INFO ] Removed a total of 186 redundant transitions.
[2026-05-24 14:03:31] [INFO ] Flatten gal took : 35 ms
[2026-05-24 14:03:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 334 labels/synchronizations in 8 ms.
[2026-05-24 14:03:31] [INFO ] Time to serialize gal into /tmp/CTLFireability1770421359137666188.gal : 3 ms
[2026-05-24 14:03:31] [INFO ] Time to serialize properties into /tmp/CTLFireability14808680052198170168.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/CTLFireability1770421359137666188.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14808680052198170168.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,5.27011e+10,6.64621,176220,14603,5665,281643,41201,660,705565,223,314587,0
Converting to forward existential form...Done !
original formula: A((!(E(EX((i4.u18.Node4ID2>=1)) U ((i3.u15.Node6IsInserted>=1)&&(i0.u2.Node0requestsent6>=1)))) + ((i4.u17.EmptyCAN>=1)&&(i1.i1.u4.Node1R...286
=> equivalent forward existential formula: [((Init * !(EG(!(EG(((!(!(E(TRUE U !((i1.i1.u7.Node9GiveAnswer1>=1))))) * (i3.u15.Node6IsInserted>=1)) * (i1.i1....617
Reverse transition relation is NOT exact ! Due to transitions t4, t15, t26, t37, t48, t59, t70, t81, t92, t103, i0.t148, i0.u0.t3, i1.i1.t112, i1.i1.t113, ...464
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 264/264 places, 375/375 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 67 place count 264 transition count 308
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 1 with 67 rules applied. Total rules applied 134 place count 197 transition count 308
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 134 place count 197 transition count 304
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 142 place count 193 transition count 304
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 170 place count 165 transition count 248
Iterating global reduction 2 with 28 rules applied. Total rules applied 198 place count 165 transition count 248
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 2 with 5 rules applied. Total rules applied 203 place count 165 transition count 243
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 208 place count 160 transition count 243
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 226 place count 151 transition count 234
Applied a total of 226 rules in 24 ms. Remains 151 /264 variables (removed 113) and now considering 234/375 (removed 141) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17070415867029034192.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10996996700902967719.kers'
[2026-05-24 14:04:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17070415867029034192.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10996996700902967719.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 234 rows 151 cols 510 entries
Finished phase 1 with 128 SingleSign rule and 6 generalized
[2026-05-24 14:04:01] [INFO ] Computed 17 invariants in 0 ms
Computed 17 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10996996700902967719.kers
Total runtime 1 ms.
[2026-05-24 14:04:01] [INFO ] Implicit Places using invariants in 99 ms returned [11, 17, 23, 29, 38, 44]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 100 ms to find 6 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 145/264 places, 234/375 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 145 transition count 224
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 135 transition count 224
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 133 transition count 222
Applied a total of 24 rules in 11 ms. Remains 133 /145 variables (removed 12) and now considering 222/234 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3365449630575324222.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4439660834874193891.kers'
[2026-05-24 14:04:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3365449630575324222.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4439660834874193891.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 222 rows 133 cols 475 entries
Finished phase 1 with 122 SingleSign rule and 0 generalized
[2026-05-24 14:04:01] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4439660834874193891.kers
Total runtime 2 ms.
[2026-05-24 14:04:01] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-24 14:04:01] [INFO ] Invariant cache hit.
[2026-05-24 14:04:01] [INFO ] State equation strengthened by 190 read => feed constraints.
[2026-05-24 14:04:01] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 133/264 places, 222/375 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 538 ms. Remains : 133/264 places, 222/375 transitions.
[2026-05-24 14:04:01] [INFO ] Flatten gal took : 5 ms
[2026-05-24 14:04:01] [INFO ] Flatten gal took : 5 ms
[2026-05-24 14:04:01] [INFO ] Input system was already deterministic with 222 transitions.
RANDOM walk for 1766 steps (24 resets) in 10 ms. (160 steps per ms) remains 0/1 properties
FORMULA CANConstruction-PT-010-CTLFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-24 14:04:01] [INFO ] Flatten gal took : 4 ms
[2026-05-24 14:04:01] [INFO ] Flatten gal took : 4 ms
[2026-05-24 14:04:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8475816582424174943.gal : 1 ms
[2026-05-24 14:04:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6553782403793345881.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8475816582424174943.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6553782403793345881.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 375/375 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 238 transition count 324
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 238 transition count 324
Applied a total of 52 rules in 8 ms. Remains 238 /264 variables (removed 26) and now considering 324/375 (removed 51) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9556602458925505492.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8699700804348448885.kers'
[2026-05-24 14:04:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9556602458925505492.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8699700804348448885.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 324 rows 238 cols 692 entries
Finished phase 1 with 215 SingleSign rule and 6 generalized
[2026-05-24 14:04:01] [INFO ] Computed 17 invariants in 1 ms
Computed 17 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8699700804348448885.kers
Total runtime 1 ms.
[2026-05-24 14:04:02] [INFO ] Implicit Places using invariants in 96 ms returned [36, 64, 78, 104, 118]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 96 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 233/264 places, 324/375 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 228 transition count 319
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 228 transition count 319
Applied a total of 10 rules in 12 ms. Remains 228 /233 variables (removed 5) and now considering 319/324 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17872656590055831554.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14863019143022884432.kers'
[2026-05-24 14:04:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17872656590055831554.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14863019143022884432.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 319 rows 228 cols 662 entries
Finished phase 1 with 215 SingleSign rule and 1 generalized
[2026-05-24 14:04:02] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14863019143022884432.kers
Total runtime 1 ms.
[2026-05-24 14:04:02] [INFO ] Implicit Places using invariants in 99 ms returned []
[2026-05-24 14:04:02] [INFO ] Invariant cache hit.
[2026-05-24 14:04:02] [INFO ] State equation strengthened by 190 read => feed constraints.
[2026-05-24 14:04:02] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 228/264 places, 319/375 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 635 ms. Remains : 228/264 places, 319/375 transitions.
[2026-05-24 14:04:02] [INFO ] Flatten gal took : 7 ms
[2026-05-24 14:04:02] [INFO ] Flatten gal took : 5 ms
[2026-05-24 14:04:02] [INFO ] Input system was already deterministic with 319 transitions.
[2026-05-24 14:04:02] [INFO ] Flatten gal took : 6 ms
[2026-05-24 14:04:02] [INFO ] Flatten gal took : 24 ms
[2026-05-24 14:04:02] [INFO ] Time to serialize gal into /tmp/CTLFireability12919970930995251087.gal : 3 ms
[2026-05-24 14:04:02] [INFO ] Time to serialize properties into /tmp/CTLFireability12196283868986442241.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/CTLFireability12919970930995251087.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12196283868986442241.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-24 14:04:32] [INFO ] Flatten gal took : 5 ms
[2026-05-24 14:04:32] [INFO ] Applying decomposition
[2026-05-24 14:04: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/graph11731531188297113483.txt' '-o' '/tmp/graph11731531188297113483.bin' '-w' '/tmp/graph11731531188297113483.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11731531188297113483.bin' '-l' '-1' '-v' '-w' '/tmp/graph11731531188297113483.weights' '-q' '0' '-e' '0.001'
[2026-05-24 14:04:32] [INFO ] Decomposing Gal with order
[2026-05-24 14:04:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 14:04:32] [INFO ] Removed a total of 189 redundant transitions.
[2026-05-24 14:04:32] [INFO ] Flatten gal took : 15 ms
[2026-05-24 14:04:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 320 labels/synchronizations in 6 ms.
[2026-05-24 14:04:32] [INFO ] Time to serialize gal into /tmp/CTLFireability5857500319505115607.gal : 2 ms
[2026-05-24 14:04:32] [INFO ] Time to serialize properties into /tmp/CTLFireability14602535995891028136.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/CTLFireability5857500319505115607.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14602535995891028136.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,5.40858e+10,6.70886,190364,13347,4429,333774,34497,597,682615,206,279993,0
Converting to forward existential form...Done !
original formula: A(!((!(A(EG(((i3.u12.Node3WaitAnswer>=1)&&(i3.u14.Node3NOshare>=1))) U (((i5.u20.Node5ID2>=1)||((i0.u2.Node4IsInserted>=1)&&(i7.u27.Node7...558
=> equivalent forward existential formula: [((Init * !(EG(!(((EX(E(TRUE U ((((i0.u2.Node4IsInserted>=1)&&(i3.u14.Node3requestsent4>=1))&&(i8.u29.Node2GiveA...1470
Reverse transition relation is NOT exact ! Due to transitions t4, t15, t26, t37, t42, t49, t60, t71, t82, t93, t104, i0.t246, i0.t150, i0.t149, i0.u0.t3, i...526
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 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 375/375 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 236 transition count 320
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 236 transition count 320
Applied a total of 56 rules in 12 ms. Remains 236 /264 variables (removed 28) and now considering 320/375 (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-6079502539007262254.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4749089912268785348.kers'
[2026-05-24 14:05:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6079502539007262254.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4749089912268785348.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 320 rows 236 cols 684 entries
Finished phase 1 with 213 SingleSign rule and 6 generalized
[2026-05-24 14:05:02] [INFO ] Computed 17 invariants in 1 ms
Computed 17 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4749089912268785348.kers
Total runtime 2 ms.
[2026-05-24 14:05:03] [INFO ] Implicit Places using invariants in 122 ms returned [36, 50, 64, 78, 104, 118]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 124 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 230/264 places, 320/375 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 224 transition count 314
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 224 transition count 314
Applied a total of 12 rules in 3 ms. Remains 224 /230 variables (removed 6) and now considering 314/320 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16265661197152678924.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-856645940516636365.kers'
[2026-05-24 14:05:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16265661197152678924.kers, --Pflows, --basisKERS=/tmp/petrispot-output-856645940516636365.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 314 rows 224 cols 648 entries
Finished phase 1 with 213 SingleSign rule and 0 generalized
[2026-05-24 14:05:03] [INFO ] Computed 11 invariants in 3 ms
Computed 11 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-856645940516636365.kers
Total runtime 4 ms.
[2026-05-24 14:05:03] [INFO ] Implicit Places using invariants in 104 ms returned []
[2026-05-24 14:05:03] [INFO ] Invariant cache hit.
[2026-05-24 14:05:03] [INFO ] State equation strengthened by 190 read => feed constraints.
[2026-05-24 14:05:03] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 224/264 places, 314/375 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 674 ms. Remains : 224/264 places, 314/375 transitions.
[2026-05-24 14:05:03] [INFO ] Flatten gal took : 4 ms
[2026-05-24 14:05:03] [INFO ] Flatten gal took : 5 ms
[2026-05-24 14:05:03] [INFO ] Input system was already deterministic with 314 transitions.
[2026-05-24 14:05:03] [INFO ] Flatten gal took : 4 ms
[2026-05-24 14:05:03] [INFO ] Flatten gal took : 5 ms
[2026-05-24 14:05:03] [INFO ] Time to serialize gal into /tmp/CTLFireability15693460769253784544.gal : 1 ms
[2026-05-24 14:05:03] [INFO ] Time to serialize properties into /tmp/CTLFireability1006525243057070202.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/CTLFireability15693460769253784544.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1006525243057070202.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-24 14:05:33] [INFO ] Flatten gal took : 5 ms
[2026-05-24 14:05:33] [INFO ] Applying decomposition
[2026-05-24 14:05:33] [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/graph14019471000342306799.txt' '-o' '/tmp/graph14019471000342306799.bin' '-w' '/tmp/graph14019471000342306799.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14019471000342306799.bin' '-l' '-1' '-v' '-w' '/tmp/graph14019471000342306799.weights' '-q' '0' '-e' '0.001'
[2026-05-24 14:05:33] [INFO ] Decomposing Gal with order
[2026-05-24 14:05:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 14:05:33] [INFO ] Removed a total of 187 redundant transitions.
[2026-05-24 14:05:33] [INFO ] Flatten gal took : 13 ms
[2026-05-24 14:05:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 320 labels/synchronizations in 4 ms.
[2026-05-24 14:05:33] [INFO ] Time to serialize gal into /tmp/CTLFireability2747054799740509599.gal : 2 ms
[2026-05-24 14:05:33] [INFO ] Time to serialize properties into /tmp/CTLFireability12245658865409448011.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/CTLFireability2747054799740509599.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12245658865409448011.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,5.31627e+10,6.82187,193056,15552,6384,314830,46506,602,723508,224,369815,0
Converting to forward existential form...Done !
original formula: E(AX(AG(AF((i2.u8.Node9GiveAnswer2<1)))) U ((i8.u30.Node1GiveAnswer8<1) * EX(EX(E((i2.u9.Node2IsNonInsertedNode>=1) U ((i1.u6.Node7IsInse...200
=> equivalent forward existential formula: [(FwdU(EY(EY((FwdU(Init,!(EX(!(!(E(TRUE U !(!(EG(!((i2.u8.Node9GiveAnswer2<1))))))))))) * (i8.u30.Node1GiveAnswe...271
Reverse transition relation is NOT exact ! Due to transitions t4, t15, t26, t37, t48, t59, t70, t81, t92, t103, i0.t148, i0.u0.t3, i1.t112, i1.u4.t14, i2.t...480
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 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,0,21.5131,600144,1,0,1.06008e+06,102926,3002,2.50677e+06,874,751386,2554332
FORMULA CANConstruction-PT-010-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 375/375 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 237 transition count 322
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 237 transition count 322
Applied a total of 54 rules in 8 ms. Remains 237 /264 variables (removed 27) and now considering 322/375 (removed 53) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2920620052818050961.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15607197971838728007.kers'
[2026-05-24 14:05:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2920620052818050961.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15607197971838728007.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 322 rows 237 cols 688 entries
Finished phase 1 with 214 SingleSign rule and 6 generalized
[2026-05-24 14:05:55] [INFO ] Computed 17 invariants in 1 ms
Computed 17 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15607197971838728007.kers
Total runtime 2 ms.
[2026-05-24 14:05:55] [INFO ] Implicit Places using invariants in 112 ms returned [36, 50, 64, 78, 104, 118]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 114 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 231/264 places, 322/375 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 225 transition count 316
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 225 transition count 316
Applied a total of 12 rules in 4 ms. Remains 225 /231 variables (removed 6) and now considering 316/322 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1866404139951316122.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12118666404079612818.kers'
[2026-05-24 14:05:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1866404139951316122.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12118666404079612818.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 316 rows 225 cols 652 entries
Finished phase 1 with 214 SingleSign rule and 0 generalized
[2026-05-24 14:05:55] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12118666404079612818.kers
Total runtime 2 ms.
[2026-05-24 14:05:55] [INFO ] Implicit Places using invariants in 105 ms returned []
[2026-05-24 14:05:55] [INFO ] Invariant cache hit.
[2026-05-24 14:05:55] [INFO ] State equation strengthened by 190 read => feed constraints.
[2026-05-24 14:05:55] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 444 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 225/264 places, 316/375 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 570 ms. Remains : 225/264 places, 316/375 transitions.
[2026-05-24 14:05:55] [INFO ] Flatten gal took : 4 ms
[2026-05-24 14:05:55] [INFO ] Flatten gal took : 4 ms
[2026-05-24 14:05:55] [INFO ] Input system was already deterministic with 316 transitions.
[2026-05-24 14:05:55] [INFO ] Flatten gal took : 4 ms
[2026-05-24 14:05:55] [INFO ] Flatten gal took : 3 ms
[2026-05-24 14:05:55] [INFO ] Time to serialize gal into /tmp/CTLFireability4827094138837569795.gal : 1 ms
[2026-05-24 14:05:55] [INFO ] Time to serialize properties into /tmp/CTLFireability14812975745647607881.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/CTLFireability4827094138837569795.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14812975745647607881.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-24 14:06:26] [INFO ] Flatten gal took : 9 ms
[2026-05-24 14:06:26] [INFO ] Applying decomposition
[2026-05-24 14:06:26] [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/graph7191054635047908119.txt' '-o' '/tmp/graph7191054635047908119.bin' '-w' '/tmp/graph7191054635047908119.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7191054635047908119.bin' '-l' '-1' '-v' '-w' '/tmp/graph7191054635047908119.weights' '-q' '0' '-e' '0.001'
[2026-05-24 14:06:26] [INFO ] Decomposing Gal with order
[2026-05-24 14:06:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 14:06:26] [INFO ] Removed a total of 188 redundant transitions.
[2026-05-24 14:06:26] [INFO ] Flatten gal took : 21 ms
[2026-05-24 14:06:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 320 labels/synchronizations in 5 ms.
[2026-05-24 14:06:26] [INFO ] Time to serialize gal into /tmp/CTLFireability12047686359215011416.gal : 2 ms
[2026-05-24 14:06:26] [INFO ] Time to serialize properties into /tmp/CTLFireability14096734469995430113.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/CTLFireability12047686359215011416.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14096734469995430113.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,5.36242e+10,7.75313,225284,14192,4509,384056,39593,595,859842,195,319773,0
Converting to forward existential form...Done !
original formula: (AF((i0.u0.Node3GiveAnswer0>=1)) + EG(A(EF((i9.u39.Node0GiveAnswer9>=1)) U E(A(((i5.u24.Node1IsInserted>=1)&&(i8.u37.Node8requestsent1>=1...383
=> equivalent forward existential formula: [FwdG((Init * !(EG(!((E(!(E(!((E(!(((i0.u3.Node2IsInserted>=1)&&(i8.u37.Node8Request>=1))) U (!(((i5.u24.Node1Is...1910
Reverse transition relation is NOT exact ! Due to transitions t4, t15, t26, t37, t48, t59, t70, t81, t92, t103, i0.t189, i0.t149, i0.t148, i0.u0.t3, i0.u0....511
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 375/375 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 238 transition count 324
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 238 transition count 324
Applied a total of 52 rules in 7 ms. Remains 238 /264 variables (removed 26) and now considering 324/375 (removed 51) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3858398104790264413.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15367878282450937871.kers'
[2026-05-24 14:06:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3858398104790264413.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15367878282450937871.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 324 rows 238 cols 692 entries
Finished phase 1 with 215 SingleSign rule and 6 generalized
[2026-05-24 14:06:56] [INFO ] Computed 17 invariants in 1 ms
Computed 17 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15367878282450937871.kers
Total runtime 2 ms.
[2026-05-24 14:06:56] [INFO ] Implicit Places using invariants in 113 ms returned [36, 50, 64, 78, 104, 118]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 114 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 232/264 places, 324/375 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 226 transition count 318
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 226 transition count 318
Applied a total of 12 rules in 3 ms. Remains 226 /232 variables (removed 6) and now considering 318/324 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4650474789899159601.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8822483467794812051.kers'
[2026-05-24 14:06:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4650474789899159601.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8822483467794812051.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 318 rows 226 cols 656 entries
Finished phase 1 with 215 SingleSign rule and 0 generalized
[2026-05-24 14:06:56] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8822483467794812051.kers
Total runtime 1 ms.
[2026-05-24 14:06:56] [INFO ] Implicit Places using invariants in 93 ms returned []
[2026-05-24 14:06:56] [INFO ] Invariant cache hit.
[2026-05-24 14:06:56] [INFO ] State equation strengthened by 190 read => feed constraints.
[2026-05-24 14:06:56] [INFO ] Implicit Places using invariants and state equation in 504 ms returned []
Implicit Place search using SMT with State Equation took 611 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 226/264 places, 318/375 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 736 ms. Remains : 226/264 places, 318/375 transitions.
[2026-05-24 14:06:56] [INFO ] Flatten gal took : 4 ms
[2026-05-24 14:06:56] [INFO ] Flatten gal took : 4 ms
[2026-05-24 14:06:56] [INFO ] Input system was already deterministic with 318 transitions.
[2026-05-24 14:06:56] [INFO ] Flatten gal took : 4 ms
[2026-05-24 14:06:56] [INFO ] Flatten gal took : 3 ms
[2026-05-24 14:06:56] [INFO ] Time to serialize gal into /tmp/CTLFireability17857815637367493449.gal : 1 ms
[2026-05-24 14:06:56] [INFO ] Time to serialize properties into /tmp/CTLFireability15590449025528851752.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/CTLFireability17857815637367493449.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15590449025528851752.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-24 14:07:27] [INFO ] Flatten gal took : 5 ms
[2026-05-24 14:07:27] [INFO ] Applying decomposition
[2026-05-24 14:07:27] [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/graph2752238334258940743.txt' '-o' '/tmp/graph2752238334258940743.bin' '-w' '/tmp/graph2752238334258940743.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2752238334258940743.bin' '-l' '-1' '-v' '-w' '/tmp/graph2752238334258940743.weights' '-q' '0' '-e' '0.001'
[2026-05-24 14:07:27] [INFO ] Decomposing Gal with order
[2026-05-24 14:07:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 14:07:27] [INFO ] Removed a total of 189 redundant transitions.
[2026-05-24 14:07:27] [INFO ] Flatten gal took : 13 ms
[2026-05-24 14:07:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 312 labels/synchronizations in 3 ms.
[2026-05-24 14:07:27] [INFO ] Time to serialize gal into /tmp/CTLFireability4327949106380033913.gal : 2 ms
[2026-05-24 14:07:27] [INFO ] Time to serialize properties into /tmp/CTLFireability13989833540495145282.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/CTLFireability4327949106380033913.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13989833540495145282.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,5.41407e+10,4.9126,150224,12954,4506,246226,38212,581,554374,203,274664,0
Converting to forward existential form...Done !
original formula: (EF((i7.u26.Node6GiveAnswer7>=1)) * (!(A((i4.u15.Node3GiveAnswer4<1) U AX(((i5.u19.Node5JoinMsg<1)||(i3.u11.Node6GiveAnswer3>=1))))) + EX...185
=> equivalent forward existential formula: (([(EY((FwdU((Init * E(TRUE U (i7.u26.Node6GiveAnswer7>=1))),!(!(EX(!(((i5.u19.Node5JoinMsg<1)||(i3.u11.Node6Giv...514
Reverse transition relation is NOT exact ! Due to transitions t4, t15, t26, t37, t48, t59, t70, t81, t92, t103, i0.t187, i0.t149, i0.t148, i0.u0.t3, i0.u0....542
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,1,15.6837,438164,1,0,732267,74270,2944,1.8744e+06,819,550754,1821527
FORMULA CANConstruction-PT-010-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 264/264 places, 375/375 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 264 transition count 309
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 132 place count 198 transition count 309
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 132 place count 198 transition count 305
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 140 place count 194 transition count 305
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 169 place count 165 transition count 247
Iterating global reduction 2 with 29 rules applied. Total rules applied 198 place count 165 transition count 247
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 2 with 5 rules applied. Total rules applied 203 place count 165 transition count 242
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 208 place count 160 transition count 242
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 226 place count 151 transition count 233
Applied a total of 226 rules in 19 ms. Remains 151 /264 variables (removed 113) and now considering 233/375 (removed 142) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-483180618541288960.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5826676416402869919.kers'
[2026-05-24 14:07:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-483180618541288960.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5826676416402869919.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 233 rows 151 cols 508 entries
Finished phase 1 with 128 SingleSign rule and 6 generalized
[2026-05-24 14:07:42] [INFO ] Computed 17 invariants in 1 ms
Computed 17 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5826676416402869919.kers
Total runtime 2 ms.
[2026-05-24 14:07:43] [INFO ] Implicit Places using invariants in 102 ms returned [12, 18, 24, 30, 39, 45]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 103 ms to find 6 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 145/264 places, 233/375 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 145 transition count 222
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 134 transition count 222
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 133 transition count 221
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 133 transition count 221
Applied a total of 24 rules in 10 ms. Remains 133 /145 variables (removed 12) and now considering 221/233 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10845572343646593674.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16306168837995231140.kers'
[2026-05-24 14:07:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10845572343646593674.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16306168837995231140.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 221 rows 133 cols 471 entries
Finished phase 1 with 122 SingleSign rule and 0 generalized
[2026-05-24 14:07:43] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16306168837995231140.kers
Total runtime 1 ms.
[2026-05-24 14:07:43] [INFO ] Implicit Places using invariants in 84 ms returned []
[2026-05-24 14:07:43] [INFO ] Invariant cache hit.
[2026-05-24 14:07:43] [INFO ] State equation strengthened by 190 read => feed constraints.
[2026-05-24 14:07:43] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 133/264 places, 221/375 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 498 ms. Remains : 133/264 places, 221/375 transitions.
[2026-05-24 14:07:43] [INFO ] Flatten gal took : 5 ms
[2026-05-24 14:07:43] [INFO ] Flatten gal took : 5 ms
[2026-05-24 14:07:43] [INFO ] Input system was already deterministic with 221 transitions.
[2026-05-24 14:07:43] [INFO ] Flatten gal took : 3 ms
[2026-05-24 14:07:43] [INFO ] Flatten gal took : 3 ms
[2026-05-24 14:07:43] [INFO ] Time to serialize gal into /tmp/CTLFireability7149671972950603022.gal : 1 ms
[2026-05-24 14:07:43] [INFO ] Time to serialize properties into /tmp/CTLFireability301469044309436016.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/CTLFireability7149671972950603022.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability301469044309436016.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 -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-24 14:08:13] [INFO ] Flatten gal took : 6 ms
[2026-05-24 14:08:13] [INFO ] Applying decomposition
[2026-05-24 14:08:13] [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/graph2355139304565231046.txt' '-o' '/tmp/graph2355139304565231046.bin' '-w' '/tmp/graph2355139304565231046.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2355139304565231046.bin' '-l' '-1' '-v' '-w' '/tmp/graph2355139304565231046.weights' '-q' '0' '-e' '0.001'
[2026-05-24 14:08:13] [INFO ] Decomposing Gal with order
[2026-05-24 14:08:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 14:08:13] [INFO ] Removed a total of 183 redundant transitions.
[2026-05-24 14:08:13] [INFO ] Flatten gal took : 10 ms
[2026-05-24 14:08:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 176 labels/synchronizations in 2 ms.
[2026-05-24 14:08:13] [INFO ] Time to serialize gal into /tmp/CTLFireability4551596425499991379.gal : 1 ms
[2026-05-24 14:08:13] [INFO ] Time to serialize properties into /tmp/CTLFireability17998234838399577826.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/CTLFireability4551596425499991379.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17998234838399577826.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,9.82792e+07,5.14062,152756,8770,7281,252528,34412,420,443956,236,417431,0
Converting to forward existential form...Done !
original formula: AG(EF(((u1.Node2IsInserted<1)||(u9.Node7requestsent2<1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u1.Node2IsInserted<1)||(u9.Node7requestsent2<1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t5, t6, t7, t9, t10, t13, t19, t22, t25, t30, t33, t209, t210, t215, t216, t219, t220...275
(forward)formula 0,1,19.8847,590900,1,0,818509,105216,1673,2.04128e+06,885,1.14905e+06,887136
FORMULA CANConstruction-PT-010-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 264/264 places, 375/375 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 67 place count 264 transition count 308
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 1 with 67 rules applied. Total rules applied 134 place count 197 transition count 308
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 134 place count 197 transition count 304
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 142 place count 193 transition count 304
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 170 place count 165 transition count 248
Iterating global reduction 2 with 28 rules applied. Total rules applied 198 place count 165 transition count 248
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 2 with 5 rules applied. Total rules applied 203 place count 165 transition count 243
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 208 place count 160 transition count 243
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 226 place count 151 transition count 234
Applied a total of 226 rules in 27 ms. Remains 151 /264 variables (removed 113) and now considering 234/375 (removed 141) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11960399011997364361.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-146990150697037794.kers'
[2026-05-24 14:08:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11960399011997364361.kers, --Pflows, --basisKERS=/tmp/petrispot-output-146990150697037794.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 234 rows 151 cols 510 entries
Finished phase 1 with 128 SingleSign rule and 6 generalized
[2026-05-24 14:08:33] [INFO ] Computed 17 invariants in 3 ms
Computed 17 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-146990150697037794.kers
Total runtime 5 ms.
[2026-05-24 14:08:33] [INFO ] Implicit Places using invariants in 117 ms returned [11, 17, 23, 29, 38, 44]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 125 ms to find 6 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 145/264 places, 234/375 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 145 transition count 224
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 135 transition count 224
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 133 transition count 222
Applied a total of 24 rules in 22 ms. Remains 133 /145 variables (removed 12) and now considering 222/234 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18050533989086750202.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9032310977045110644.kers'
[2026-05-24 14:08:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18050533989086750202.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9032310977045110644.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 222 rows 133 cols 475 entries
Finished phase 1 with 122 SingleSign rule and 0 generalized
[2026-05-24 14:08:33] [INFO ] Computed 11 invariants in 2 ms
Computed 11 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9032310977045110644.kers
Total runtime 3 ms.
[2026-05-24 14:08:33] [INFO ] Implicit Places using invariants in 109 ms returned []
[2026-05-24 14:08:33] [INFO ] Invariant cache hit.
[2026-05-24 14:08:33] [INFO ] State equation strengthened by 190 read => feed constraints.
[2026-05-24 14:08:34] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 447 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 133/264 places, 222/375 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 621 ms. Remains : 133/264 places, 222/375 transitions.
[2026-05-24 14:08:34] [INFO ] Flatten gal took : 7 ms
[2026-05-24 14:08:34] [INFO ] Flatten gal took : 5 ms
[2026-05-24 14:08:34] [INFO ] Input system was already deterministic with 222 transitions.
RANDOM walk for 2320 steps (35 resets) in 17 ms. (128 steps per ms) remains 0/1 properties
FORMULA CANConstruction-PT-010-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-24 14:08:34] [INFO ] Flatten gal took : 4 ms
[2026-05-24 14:08:34] [INFO ] Flatten gal took : 3 ms
[2026-05-24 14:08:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4854317813549550516.gal : 1 ms
[2026-05-24 14:08:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7207044839068581731.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4854317813549550516.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7207044839068581731.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 375/375 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 236 transition count 320
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 236 transition count 320
Applied a total of 56 rules in 8 ms. Remains 236 /264 variables (removed 28) and now considering 320/375 (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-18124864242684524598.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10807231521306945273.kers'
[2026-05-24 14:08:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18124864242684524598.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10807231521306945273.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 320 rows 236 cols 684 entries
Finished phase 1 with 213 SingleSign rule and 6 generalized
[2026-05-24 14:08:34] [INFO ] Computed 17 invariants in 1 ms
Computed 17 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10807231521306945273.kers
Total runtime 2 ms.
[2026-05-24 14:08:34] [INFO ] Implicit Places using invariants in 127 ms returned [36, 50, 64, 78, 104]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 128 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 231/264 places, 320/375 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 227 transition count 316
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 227 transition count 316
Applied a total of 8 rules in 4 ms. Remains 227 /231 variables (removed 4) and now considering 316/320 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18143329680187713298.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8988726802312774730.kers'
[2026-05-24 14:08:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18143329680187713298.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8988726802312774730.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 316 rows 227 cols 657 entries
Finished phase 1 with 214 SingleSign rule and 1 generalized
[2026-05-24 14:08:34] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-8988726802312774730.kers
Total runtime 15 ms.
[2026-05-24 14:08:34] [INFO ] Implicit Places using invariants in 125 ms returned []
[2026-05-24 14:08:34] [INFO ] Invariant cache hit.
[2026-05-24 14:08:34] [INFO ] State equation strengthened by 190 read => feed constraints.
[2026-05-24 14:08:34] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 227/264 places, 316/375 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 619 ms. Remains : 227/264 places, 316/375 transitions.
[2026-05-24 14:08:34] [INFO ] Flatten gal took : 5 ms
[2026-05-24 14:08:34] [INFO ] Flatten gal took : 4 ms
[2026-05-24 14:08:34] [INFO ] Input system was already deterministic with 316 transitions.
[2026-05-24 14:08:34] [INFO ] Flatten gal took : 4 ms
[2026-05-24 14:08:34] [INFO ] Flatten gal took : 5 ms
[2026-05-24 14:08:34] [INFO ] Time to serialize gal into /tmp/CTLFireability13184744506682060370.gal : 1 ms
[2026-05-24 14:08:34] [INFO ] Time to serialize properties into /tmp/CTLFireability10959169136295613873.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/CTLFireability13184744506682060370.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10959169136295613873.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-24 14:09:04] [INFO ] Flatten gal took : 5 ms
[2026-05-24 14:09:04] [INFO ] Applying decomposition
[2026-05-24 14:09:04] [INFO ] Flatten gal took : 3 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/graph12191611963256945372.txt' '-o' '/tmp/graph12191611963256945372.bin' '-w' '/tmp/graph12191611963256945372.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12191611963256945372.bin' '-l' '-1' '-v' '-w' '/tmp/graph12191611963256945372.weights' '-q' '0' '-e' '0.001'
[2026-05-24 14:09:04] [INFO ] Decomposing Gal with order
[2026-05-24 14:09:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 14:09:05] [INFO ] Removed a total of 188 redundant transitions.
[2026-05-24 14:09:05] [INFO ] Flatten gal took : 21 ms
[2026-05-24 14:09:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 324 labels/synchronizations in 34 ms.
[2026-05-24 14:09:05] [INFO ] Time to serialize gal into /tmp/CTLFireability6985865661326459687.gal : 2 ms
[2026-05-24 14:09:05] [INFO ] Time to serialize properties into /tmp/CTLFireability8201642226055794754.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/CTLFireability6985865661326459687.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8201642226055794754.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.3121e+10,9.42181,285304,18781,5852,515064,44234,642,1.04775e+06,236,402164,0
Converting to forward existential form...Done !
original formula: EX(AF((!(E(!(((i0.u2.Node0Request>=1)&&(i1.u6.Node5IsInserted>=1))) U (((i5.u22.Node1IsInserted>=1)&&(i4.u18.Node4requestsent1>=1))||(i9....673
=> equivalent forward existential formula: [(EY(Init) * !(EG(!((!(E(!(((i0.u2.Node0Request>=1)&&(i1.u6.Node5IsInserted>=1))) U (((i5.u22.Node1IsInserted>=1...724
Reverse transition relation is NOT exact ! Due to transitions t4, t15, t26, t37, t48, t59, t70, t81, t86, t93, t98, t105, i0.t150, i0.u0.t3, i1.t114, i1.u4...450
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 375/375 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 235 transition count 318
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 235 transition count 318
Applied a total of 58 rules in 4 ms. Remains 235 /264 variables (removed 29) and now considering 318/375 (removed 57) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13416356842676034424.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15065328068591516536.kers'
[2026-05-24 14:09:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13416356842676034424.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15065328068591516536.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 318 rows 235 cols 680 entries
Finished phase 1 with 212 SingleSign rule and 6 generalized
[2026-05-24 14:09:35] [INFO ] Computed 17 invariants in 4 ms
Computed 17 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-15065328068591516536.kers
Total runtime 5 ms.
[2026-05-24 14:09:35] [INFO ] Implicit Places using invariants in 137 ms returned [36, 50, 64, 78, 104, 118]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 138 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 229/264 places, 318/375 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 223 transition count 312
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 223 transition count 312
Applied a total of 12 rules in 3 ms. Remains 223 /229 variables (removed 6) and now considering 312/318 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1763080171606680116.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6553021499567594273.kers'
[2026-05-24 14:09:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1763080171606680116.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6553021499567594273.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 312 rows 223 cols 644 entries
Finished phase 1 with 212 SingleSign rule and 0 generalized
[2026-05-24 14:09:35] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6553021499567594273.kers
Total runtime 1 ms.
[2026-05-24 14:09:35] [INFO ] Implicit Places using invariants in 117 ms returned []
[2026-05-24 14:09:35] [INFO ] Invariant cache hit.
[2026-05-24 14:09:35] [INFO ] State equation strengthened by 190 read => feed constraints.
[2026-05-24 14:09:35] [INFO ] Implicit Places using invariants and state equation in 431 ms returned []
Implicit Place search using SMT with State Equation took 551 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 223/264 places, 312/375 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 696 ms. Remains : 223/264 places, 312/375 transitions.
[2026-05-24 14:09:35] [INFO ] Flatten gal took : 5 ms
[2026-05-24 14:09:35] [INFO ] Flatten gal took : 3 ms
[2026-05-24 14:09:35] [INFO ] Input system was already deterministic with 312 transitions.
[2026-05-24 14:09:35] [INFO ] Flatten gal took : 3 ms
[2026-05-24 14:09:35] [INFO ] Flatten gal took : 4 ms
[2026-05-24 14:09:35] [INFO ] Time to serialize gal into /tmp/CTLFireability18394489384361509946.gal : 1 ms
[2026-05-24 14:09:35] [INFO ] Time to serialize properties into /tmp/CTLFireability17172667758940992407.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/CTLFireability18394489384361509946.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17172667758940992407.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-24 14:10:05] [INFO ] Flatten gal took : 5 ms
[2026-05-24 14:10:05] [INFO ] Applying decomposition
[2026-05-24 14:10:05] [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/graph5233417410346807586.txt' '-o' '/tmp/graph5233417410346807586.bin' '-w' '/tmp/graph5233417410346807586.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5233417410346807586.bin' '-l' '-1' '-v' '-w' '/tmp/graph5233417410346807586.weights' '-q' '0' '-e' '0.001'
[2026-05-24 14:10:05] [INFO ] Decomposing Gal with order
[2026-05-24 14:10:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 14:10:05] [INFO ] Removed a total of 186 redundant transitions.
[2026-05-24 14:10:05] [INFO ] Flatten gal took : 10 ms
[2026-05-24 14:10:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 320 labels/synchronizations in 3 ms.
[2026-05-24 14:10:05] [INFO ] Time to serialize gal into /tmp/CTLFireability15924202112064679496.gal : 2 ms
[2026-05-24 14:10:05] [INFO ] Time to serialize properties into /tmp/CTLFireability3816986425289159618.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/CTLFireability15924202112064679496.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3816986425289159618.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,5.27011e+10,6.30413,183132,13840,5877,296565,49331,591,699932,219,353555,0
Converting to forward existential form...Done !
original formula: EF(AX(AX(AG((((i1.u4.Node9GiveAnswer1>=1)&&(i3.u13.Node3Request>=1))&&(i8.u34.Node5IsInserted>=1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(!(EX(!(!(E(TRUE U !((((i1.u4.Node9GiveAnswer1>=1)&&(i3.u13.Node3Request>=1))&&(i8.u34...196
Reverse transition relation is NOT exact ! Due to transitions t4, t15, t26, t37, t48, t59, t70, t81, t92, t103, i0.t148, i0.u0.t3, i1.t297, i1.t113, i1.t11...449
(forward)formula 0,1,18.4284,467352,1,0,676790,111069,2731,2.19843e+06,844,836345,1707736
FORMULA CANConstruction-PT-010-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 375/375 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 235 transition count 318
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 235 transition count 318
Applied a total of 58 rules in 4 ms. Remains 235 /264 variables (removed 29) and now considering 318/375 (removed 57) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1272077618786647407.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9651599000867982637.kers'
[2026-05-24 14:10:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1272077618786647407.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9651599000867982637.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 318 rows 235 cols 680 entries
Finished phase 1 with 212 SingleSign rule and 6 generalized
[2026-05-24 14:10:24] [INFO ] Computed 17 invariants in 4 ms
Computed 17 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-9651599000867982637.kers
Total runtime 5 ms.
[2026-05-24 14:10:24] [INFO ] Implicit Places using invariants in 121 ms returned [36, 50, 64, 78, 104, 118]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 123 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 229/264 places, 318/375 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 223 transition count 312
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 223 transition count 312
Applied a total of 12 rules in 4 ms. Remains 223 /229 variables (removed 6) and now considering 312/318 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15116254161980164364.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11225344325588080173.kers'
[2026-05-24 14:10:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15116254161980164364.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11225344325588080173.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 312 rows 223 cols 644 entries
Finished phase 1 with 212 SingleSign rule and 0 generalized
[2026-05-24 14:10:24] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11225344325588080173.kers
Total runtime 2 ms.
[2026-05-24 14:10:24] [INFO ] Implicit Places using invariants in 102 ms returned []
[2026-05-24 14:10:24] [INFO ] Invariant cache hit.
[2026-05-24 14:10:24] [INFO ] State equation strengthened by 190 read => feed constraints.
[2026-05-24 14:10:25] [INFO ] Implicit Places using invariants and state equation in 399 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 223/264 places, 312/375 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 634 ms. Remains : 223/264 places, 312/375 transitions.
[2026-05-24 14:10:25] [INFO ] Flatten gal took : 5 ms
[2026-05-24 14:10:25] [INFO ] Flatten gal took : 4 ms
[2026-05-24 14:10:25] [INFO ] Input system was already deterministic with 312 transitions.
[2026-05-24 14:10:25] [INFO ] Flatten gal took : 4 ms
[2026-05-24 14:10:25] [INFO ] Flatten gal took : 3 ms
[2026-05-24 14:10:25] [INFO ] Time to serialize gal into /tmp/CTLFireability16461811468862698872.gal : 1 ms
[2026-05-24 14:10:25] [INFO ] Time to serialize properties into /tmp/CTLFireability9330101379679179326.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/CTLFireability16461811468862698872.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9330101379679179326.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-24 14:10:55] [INFO ] Flatten gal took : 7 ms
[2026-05-24 14:10:55] [INFO ] Applying decomposition
[2026-05-24 14:10:55] [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/graph15639422991653610879.txt' '-o' '/tmp/graph15639422991653610879.bin' '-w' '/tmp/graph15639422991653610879.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15639422991653610879.bin' '-l' '-1' '-v' '-w' '/tmp/graph15639422991653610879.weights' '-q' '0' '-e' '0.001'
[2026-05-24 14:10:55] [INFO ] Decomposing Gal with order
[2026-05-24 14:10:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 14:10:55] [INFO ] Removed a total of 186 redundant transitions.
[2026-05-24 14:10:55] [INFO ] Flatten gal took : 11 ms
[2026-05-24 14:10:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 320 labels/synchronizations in 4 ms.
[2026-05-24 14:10:55] [INFO ] Time to serialize gal into /tmp/CTLFireability9814762312566498059.gal : 2 ms
[2026-05-24 14:10:55] [INFO ] Time to serialize properties into /tmp/CTLFireability13436753367554831775.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/CTLFireability9814762312566498059.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13436753367554831775.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,5.27011e+10,8.34991,240708,13658,6200,406550,47968,552,890904,195,378806,0
Converting to forward existential form...Done !
original formula: EF(EX(AX(EX(EX((i9.u36.Node1GiveAnswer9>=1))))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(EX(!(EX(EX((i9.u36.Node1GiveAnswer9>=1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t15, t26, t37, t48, t59, t70, t81, t92, t103, i0.t148, i0.u0.t3, i1.t112, i1.u4.t14, i2.t...450
(forward)formula 0,1,19.7292,483932,1,0,664769,99082,2231,2.4554e+06,710,871079,1514625
FORMULA CANConstruction-PT-010-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 375/375 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 237 transition count 321
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 237 transition count 321
Applied a total of 54 rules in 10 ms. Remains 237 /264 variables (removed 27) and now considering 321/375 (removed 54) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10525326272459729397.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10713133183447845530.kers'
[2026-05-24 14:11:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10525326272459729397.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10713133183447845530.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 321 rows 237 cols 687 entries
Finished phase 1 with 214 SingleSign rule and 6 generalized
[2026-05-24 14:11:15] [INFO ] Computed 17 invariants in 2 ms
Computed 17 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-10713133183447845530.kers
Total runtime 4 ms.
[2026-05-24 14:11:15] [INFO ] Implicit Places using invariants in 116 ms returned [37, 51, 65, 79, 105, 119]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 118 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 231/264 places, 321/375 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 225 transition count 315
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 225 transition count 315
Applied a total of 12 rules in 3 ms. Remains 225 /231 variables (removed 6) and now considering 315/321 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4295027321350467651.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-643288400945792202.kers'
[2026-05-24 14:11:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4295027321350467651.kers, --Pflows, --basisKERS=/tmp/petrispot-output-643288400945792202.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 315 rows 225 cols 651 entries
Finished phase 1 with 214 SingleSign rule and 0 generalized
[2026-05-24 14:11:15] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-643288400945792202.kers
Total runtime 2 ms.
[2026-05-24 14:11:15] [INFO ] Implicit Places using invariants in 102 ms returned []
[2026-05-24 14:11:15] [INFO ] Invariant cache hit.
[2026-05-24 14:11:15] [INFO ] State equation strengthened by 190 read => feed constraints.
[2026-05-24 14:11:15] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 225/264 places, 315/375 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 607 ms. Remains : 225/264 places, 315/375 transitions.
[2026-05-24 14:11:15] [INFO ] Flatten gal took : 5 ms
[2026-05-24 14:11:15] [INFO ] Flatten gal took : 5 ms
[2026-05-24 14:11:15] [INFO ] Input system was already deterministic with 315 transitions.
[2026-05-24 14:11:15] [INFO ] Flatten gal took : 4 ms
[2026-05-24 14:11:15] [INFO ] Flatten gal took : 4 ms
[2026-05-24 14:11:15] [INFO ] Time to serialize gal into /tmp/CTLFireability12578531136039843481.gal : 1 ms
[2026-05-24 14:11:15] [INFO ] Time to serialize properties into /tmp/CTLFireability6368870149265892268.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/CTLFireability12578531136039843481.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6368870149265892268.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-24 14:11:45] [INFO ] Flatten gal took : 8 ms
[2026-05-24 14:11:45] [INFO ] Applying decomposition
[2026-05-24 14:11:45] [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/graph15603597602678220280.txt' '-o' '/tmp/graph15603597602678220280.bin' '-w' '/tmp/graph15603597602678220280.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15603597602678220280.bin' '-l' '-1' '-v' '-w' '/tmp/graph15603597602678220280.weights' '-q' '0' '-e' '0.001'
[2026-05-24 14:11:45] [INFO ] Decomposing Gal with order
[2026-05-24 14:11:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 14:11:45] [INFO ] Removed a total of 189 redundant transitions.
[2026-05-24 14:11:45] [INFO ] Flatten gal took : 13 ms
[2026-05-24 14:11:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 320 labels/synchronizations in 3 ms.
[2026-05-24 14:11:45] [INFO ] Time to serialize gal into /tmp/CTLFireability8626600793011863075.gal : 2 ms
[2026-05-24 14:11:45] [INFO ] Time to serialize properties into /tmp/CTLFireability3437193739117701956.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/CTLFireability8626600793011863075.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3437193739117701956.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.31627e+10,9.31887,244896,15635,5053,420347,36395,586,923559,220,291839,0
Converting to forward existential form...Done !
original formula: A(((AG(E(((i2.u10.Node2Request>=1)&&(i7.u30.Node9IsInserted>=1)) U (i4.u19.Node4IsNonInsertedNode>=1))) + A(!((((i10.u38.Node8IsInserted>...541
=> equivalent forward existential formula: [((Init * !(EG(!(E(!(((i4.u18.Node2IsInserted<1)||(i7.u30.Node7requestsent2<1))) U EG(EX(((i3.u13.Node3Bootstrap...1091
Reverse transition relation is NOT exact ! Due to transitions t4, t15, t20, t27, t38, t49, t60, t71, t82, t93, t104, i0.t149, i0.u0.t3, i1.t172, i1.t171, i...480
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 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Detected timeout of ITS tools.
[2026-05-24 14:12:16] [INFO ] Flatten gal took : 7 ms
[2026-05-24 14:12:16] [INFO ] Flatten gal took : 5 ms
[2026-05-24 14:12:16] [INFO ] Applying decomposition
[2026-05-24 14:12:16] [INFO ] Flatten gal took : 10 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/graph6266683875356150832.txt' '-o' '/tmp/graph6266683875356150832.bin' '-w' '/tmp/graph6266683875356150832.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6266683875356150832.bin' '-l' '-1' '-v' '-w' '/tmp/graph6266683875356150832.weights' '-q' '0' '-e' '0.001'
[2026-05-24 14:12:16] [INFO ] Decomposing Gal with order
[2026-05-24 14:12:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 14:12:16] [INFO ] Removed a total of 203 redundant transitions.
[2026-05-24 14:12:16] [INFO ] Flatten gal took : 14 ms
[2026-05-24 14:12:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 244 labels/synchronizations in 5 ms.
[2026-05-24 14:12:16] [INFO ] Time to serialize gal into /tmp/CTLFireability2977696592136347705.gal : 3 ms
[2026-05-24 14:12:16] [INFO ] Time to serialize properties into /tmp/CTLFireability13740084935763268108.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/CTLFireability2977696592136347705.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13740084935763268108.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 8 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.63525e+10,30.4072,739892,39850,750,1.58661e+06,6960,913,2.09843e+06,191,54412,0
Converting to forward existential form...Done !
original formula: (AG(((i0.u0.EmptyCAN>=1)&&(i8.u30.Node6ReadyToInsert>=1))) + AX(AX(!(A(!(((i7.u51.Node7IsInserted>=1)&&(i7.u51.Node6requestsent7>=1))) U ...192
=> equivalent forward existential formula: [((EY(EY((Init * !(!(E(TRUE U !(((i0.u0.EmptyCAN>=1)&&(i8.u30.Node6ReadyToInsert>=1))))))))) * !(EG(!(EG((i8.u31...344
Reverse transition relation is NOT exact ! Due to transitions t4, t20, t27, t32, t39, t44, t51, t56, t63, t68, t75, t86, t91, t98, t103, t110, i0.t276, i0....1195
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 an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Detected timeout of ITS tools.
[2026-05-24 14:37:06] [INFO ] Flatten gal took : 5 ms
[2026-05-24 14:37:06] [INFO ] Time to serialize gal into /tmp/CTLFireability1388374364539746492.gal : 1 ms
[2026-05-24 14:37:06] [INFO ] Time to serialize properties into /tmp/CTLFireability14396831682892475635.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/CTLFireability1388374364539746492.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14396831682892475635.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 8 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.63525e+10,52.9641,1305228,2,265585,5,5.58194e+06,6,0,1401,3.48605e+06,0
Converting to forward existential form...Done !
original formula: (AG(((EmptyCAN>=1)&&(Node6ReadyToInsert>=1))) + AX(AX(!(A(!(((Node7IsInserted>=1)&&(Node6requestsent7>=1))) U EG((Node7GiveAnswer6>=1))))...158
=> equivalent forward existential formula: [((EY(EY((Init * !(!(E(TRUE U !(((EmptyCAN>=1)&&(Node6ReadyToInsert>=1))))))))) * !(EG(!(EG((Node7GiveAnswer6>=1...296
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t15, t20, t27, t32, t39, t44, t51, t56, t63, t68, t74, t75, t86, t91, t98, t103, t109...731
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="CANConstruction-PT-010"
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 CANConstruction-PT-010, 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 r034-tall-177946842100618"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-010.tgz
mv CANConstruction-PT-010 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 '
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 ;