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-177946842100698.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 CANInsertWithFailure-PT-005, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946842100698
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 9.0K Mar 6 10:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 6 10:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Mar 6 10:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 6 10:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Mar 15 07:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 07:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 15 07:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 07:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 6 10:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Mar 6 10:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Mar 6 10:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 110K Mar 6 10:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 15 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 15 07:53 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 202K 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 CANInsertWithFailure-PT-005-CTLFireability-2024-00
FORMULA_NAME CANInsertWithFailure-PT-005-CTLFireability-2024-01
FORMULA_NAME CANInsertWithFailure-PT-005-CTLFireability-2024-02
FORMULA_NAME CANInsertWithFailure-PT-005-CTLFireability-2024-03
FORMULA_NAME CANInsertWithFailure-PT-005-CTLFireability-2024-04
FORMULA_NAME CANInsertWithFailure-PT-005-CTLFireability-2024-05
FORMULA_NAME CANInsertWithFailure-PT-005-CTLFireability-2024-06
FORMULA_NAME CANInsertWithFailure-PT-005-CTLFireability-2024-07
FORMULA_NAME CANInsertWithFailure-PT-005-CTLFireability-2024-08
FORMULA_NAME CANInsertWithFailure-PT-005-CTLFireability-2024-09
FORMULA_NAME CANInsertWithFailure-PT-005-CTLFireability-2024-10
FORMULA_NAME CANInsertWithFailure-PT-005-CTLFireability-2024-11
FORMULA_NAME CANInsertWithFailure-PT-005-CTLFireability-2024-12
FORMULA_NAME CANInsertWithFailure-PT-005-CTLFireability-2024-13
FORMULA_NAME CANInsertWithFailure-PT-005-CTLFireability-2024-14
FORMULA_NAME CANInsertWithFailure-PT-005-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779662221724

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-005
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-24 22:37:02] [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 22:37:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 22:37:02] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2026-05-24 22:37:02] [INFO ] Transformed 114 places.
[2026-05-24 22:37:03] [INFO ] Transformed 180 transitions.
[2026-05-24 22:37:03] [INFO ] Parsed PT model containing 114 places and 180 transitions and 500 arcs in 165 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Support contains 66 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 180/180 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 113 transition count 180
Applied a total of 1 rules in 18 ms. Remains 113 /114 variables (removed 1) and now considering 180/180 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5895859213831957773.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5841826553022914798.kers'
[2026-05-24 22:37:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5895859213831957773.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5841826553022914798.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 180 rows 113 cols 400 entries
Finished phase 1 with 101 SingleSign rule and 5 generalized
[2026-05-24 22:37:03] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5841826553022914798.kers
Total runtime 3 ms.
[2026-05-24 22:37:03] [INFO ] Implicit Places using invariants in 220 ms returned []
[2026-05-24 22:37:03] [INFO ] Invariant cache hit.
[2026-05-24 22:37:03] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-24 22:37:03] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2026-05-24 22:37:03] [INFO ] Invariant cache hit.
[2026-05-24 22:37:03] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 180/292 variables, 112/120 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 45/165 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 1/293 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/293 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (OVERLAPS) 0/293 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 167 constraints, problems are : Problem set: 0 solved, 175 unsolved in 17754 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 180/292 variables, 112/132 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 45/177 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 175/352 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (OVERLAPS) 1/293 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/293 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 12 (OVERLAPS) 0/293 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 353 constraints, problems are : Problem set: 0 solved, 175 unsolved in 19247 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37075ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 37101ms
Starting structural reductions in LTL mode, iteration 1 : 113/114 places, 180/180 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37543 ms. Remains : 113/114 places, 180/180 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 3 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2026-05-24 22:37:40] [INFO ] Invariant cache hit.
[2026-05-24 22:37:40] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-05-24 22:37:40] [INFO ] Invariant cache hit.
[2026-05-24 22:37:40] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-24 22:37:40] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 132 ms. Remains : 113/113 places, 180/180 transitions.
Support contains 66 out of 113 places after structural reductions.
[2026-05-24 22:37:40] [INFO ] Flatten gal took : 34 ms
[2026-05-24 22:37:40] [INFO ] Flatten gal took : 13 ms
[2026-05-24 22:37:41] [INFO ] Input system was already deterministic with 180 transitions.
Support contains 64 out of 113 places (down from 66) after GAL structural reductions.
RANDOM walk for 40000 steps (421 resets) in 1511 ms. (26 steps per ms) remains 4/59 properties
BEST_FIRST walk for 40002 steps (100 resets) in 123 ms. (322 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (9 resets) in 258 ms. (154 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (90 resets) in 105 ms. (377 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (116 resets) in 79 ms. (500 steps per ms) remains 4/4 properties
[2026-05-24 22:37:41] [INFO ] Invariant cache hit.
[2026-05-24 22:37:41] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 94/110 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2/112 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp18 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/113 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 180/293 variables, 113/122 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem AtomicPropp5 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/293 variables, 45/167 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/293 variables, 0/167 constraints. Problems are: Problem set: 2 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/293 variables, 0/167 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 167 constraints, problems are : Problem set: 2 solved, 2 unsolved in 309 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 101/107 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 2/5 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 4/111 variables, 2/7 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/113 variables, 2/9 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 1/10 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 180/293 variables, 113/123 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/293 variables, 45/168 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/293 variables, 2/170 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/293 variables, 0/170 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/293 variables, 0/170 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 170 constraints, problems are : Problem set: 2 solved, 2 unsolved in 323 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 636ms problems are : Problem set: 2 solved, 2 unsolved
Parikh walk visited 0 properties in 2 ms.
Support contains 6 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 180/180 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 113 transition count 152
Reduce places removed 28 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 34 rules applied. Total rules applied 62 place count 85 transition count 146
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 68 place count 79 transition count 146
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 106 place count 60 transition count 127
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 118 place count 60 transition count 115
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 120 place count 60 transition count 113
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 122 place count 58 transition count 113
Partial Free-agglomeration rule applied 20 times.
Drop transitions (Partial Free agglomeration) removed 20 transitions
Iterating global reduction 4 with 20 rules applied. Total rules applied 142 place count 58 transition count 113
Applied a total of 142 rules in 33 ms. Remains 58 /113 variables (removed 55) and now considering 113/180 (removed 67) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 58/113 places, 113/180 transitions.
RANDOM walk for 40000 steps (1555 resets) in 245 ms. (162 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (266 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (9 resets) in 108 ms. (366 steps per ms) remains 2/2 properties
Probably explored full state space saw : 15971 states, properties seen :0
Probabilistic random walk after 87483 steps, saw 15971 distinct states, run finished after 206 ms. (steps per millisecond=424 ) properties seen :0
Explored full state space saw : 15971 states, properties seen :0
Exhaustive walk after 87483 steps, saw 15971 distinct states, run finished after 185 ms. (steps per millisecond=472 ) properties seen :0
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
[2026-05-24 22:37:42] [INFO ] Flatten gal took : 9 ms
[2026-05-24 22:37:42] [INFO ] Flatten gal took : 9 ms
[2026-05-24 22:37:42] [INFO ] Input system was already deterministic with 180 transitions.
Support contains 63 out of 113 places (down from 64) after GAL structural reductions.
Computed a total of 22 stabilizing places and 35 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 113 transition count 147
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 80 transition count 147
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 76 place count 75 transition count 142
Applied a total of 76 rules in 10 ms. Remains 75 /113 variables (removed 38) and now considering 142/180 (removed 38) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13861466456245630295.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2425594132847535366.kers'
[2026-05-24 22:37:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13861466456245630295.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2425594132847535366.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 142 rows 75 cols 319 entries
Finished phase 1 with 63 SingleSign rule and 5 generalized
[2026-05-24 22:37:42] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2425594132847535366.kers
Total runtime 1 ms.
[2026-05-24 22:37:43] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-05-24 22:37:43] [INFO ] Invariant cache hit.
[2026-05-24 22:37:43] [INFO ] State equation strengthened by 50 read => feed constraints.
[2026-05-24 22:37:43] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2026-05-24 22:37:43] [INFO ] Redundant transitions in 6 ms returned []
Running 137 sub problems to find dead transitions.
[2026-05-24 22:37:43] [INFO ] Invariant cache hit.
[2026-05-24 22:37:43] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 8 (OVERLAPS) 142/216 variables, 74/99 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/216 variables, 50/149 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/216 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 11 (OVERLAPS) 1/217 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/217 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 13 (OVERLAPS) 0/217 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Real declared 217/217 variables, and 150 constraints, problems are : Problem set: 0 solved, 137 unsolved in 12896 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 75/75 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 137 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (OVERLAPS) 142/216 variables, 74/99 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 50/149 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 137/286 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 8 (OVERLAPS) 1/217 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/217 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 10 (OVERLAPS) 0/217 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Int declared 217/217 variables, and 287 constraints, problems are : Problem set: 0 solved, 137 unsolved in 12184 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 75/75 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25092ms problems are : Problem set: 0 solved, 137 unsolved
Search for dead transitions found 0 dead transitions in 25093ms
Starting structural reductions in SI_CTL mode, iteration 1 : 75/113 places, 142/180 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25275 ms. Remains : 75/113 places, 142/180 transitions.
[2026-05-24 22:38:08] [INFO ] Flatten gal took : 10 ms
[2026-05-24 22:38:08] [INFO ] Flatten gal took : 6 ms
[2026-05-24 22:38:08] [INFO ] Input system was already deterministic with 142 transitions.
[2026-05-24 22:38:08] [INFO ] Flatten gal took : 6 ms
[2026-05-24 22:38:08] [INFO ] Flatten gal took : 5 ms
[2026-05-24 22:38:08] [INFO ] Time to serialize gal into /tmp/CTLFireability3039057505630454946.gal : 3 ms
[2026-05-24 22:38:08] [INFO ] Time to serialize properties into /tmp/CTLFireability15394564361627195629.ctl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3039057505630454946.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15394564361627195629.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,34354,0.31143,15880,2,4621,5,43159,6,0,426,44458,0


Converting to forward existential form...Done !
original formula: EG(EF((Node4ResZone>=1)))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (Node4ResZone>=1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t10, t11, t13, t15, t16, t17, t19, t21, t22, t23, t25, t27, t...655
(forward)formula 0,0,1.85178,62360,1,0,357,282264,311,152,2755,301639,307
FORMULA CANInsertWithFailure-PT-005-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 113 transition count 148
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 81 transition count 148
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 64 place count 81 transition count 147
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 66 place count 80 transition count 147
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
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 74 place count 76 transition count 143
Applied a total of 74 rules in 21 ms. Remains 76 /113 variables (removed 37) and now considering 143/180 (removed 37) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2115808835797369451.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4549469276816276176.kers'
[2026-05-24 22:38:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2115808835797369451.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4549469276816276176.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 143 rows 76 cols 322 entries
Finished phase 1 with 64 SingleSign rule and 5 generalized
[2026-05-24 22:38:10] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4549469276816276176.kers
Total runtime 1 ms.
[2026-05-24 22:38:10] [INFO ] Implicit Places using invariants in 48 ms returned []
[2026-05-24 22:38:10] [INFO ] Invariant cache hit.
[2026-05-24 22:38:10] [INFO ] State equation strengthened by 49 read => feed constraints.
[2026-05-24 22:38:10] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2026-05-24 22:38:10] [INFO ] Redundant transitions in 4 ms returned []
Running 138 sub problems to find dead transitions.
[2026-05-24 22:38:10] [INFO ] Invariant cache hit.
[2026-05-24 22:38:10] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (OVERLAPS) 143/218 variables, 75/96 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 49/145 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 10 (OVERLAPS) 1/219 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 12 (OVERLAPS) 0/219 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 146 constraints, problems are : Problem set: 0 solved, 138 unsolved in 11605 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 76/76 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 143/218 variables, 75/96 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 49/145 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 138/283 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (OVERLAPS) 1/219 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 10 (OVERLAPS) 0/219 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 284 constraints, problems are : Problem set: 0 solved, 138 unsolved in 12953 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 76/76 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24569ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 24570ms
Starting structural reductions in SI_CTL mode, iteration 1 : 76/113 places, 143/180 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24746 ms. Remains : 76/113 places, 143/180 transitions.
[2026-05-24 22:38:34] [INFO ] Flatten gal took : 11 ms
[2026-05-24 22:38:34] [INFO ] Flatten gal took : 5 ms
[2026-05-24 22:38:34] [INFO ] Input system was already deterministic with 143 transitions.
[2026-05-24 22:38:34] [INFO ] Flatten gal took : 11 ms
[2026-05-24 22:38:35] [INFO ] Flatten gal took : 5 ms
[2026-05-24 22:38:35] [INFO ] Time to serialize gal into /tmp/CTLFireability10034487375296340041.gal : 2 ms
[2026-05-24 22:38:35] [INFO ] Time to serialize properties into /tmp/CTLFireability13503198810954579977.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/CTLFireability10034487375296340041.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13503198810954579977.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,37053,0.312665,15420,2,4591,5,39256,6,0,431,38784,0


Converting to forward existential form...Done !
original formula: (EF(((Node3IsInserted>=1)&&(Node4Request>=1))) * AG((((Node0IsInserted<1)||(Node4Request<1)) + AF(((TankCounter>=1)&&(Node1GiveAnswer4>=1...161
=> equivalent forward existential formula: ([(Init * !(E(TRUE U ((Node3IsInserted>=1)&&(Node4Request>=1)))))] = FALSE * [FwdG((FwdU(Init,TRUE) * !(((Node0I...244
Hit Full ! (commute/partial/dont) 130/0/13
(forward)formula 0,0,1.3009,42860,1,0,15,192373,22,6,2136,129155,12
FORMULA CANInsertWithFailure-PT-005-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 3 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11839006342896410310.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17286239168655867252.kers'
[2026-05-24 22:38:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11839006342896410310.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17286239168655867252.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 180 rows 113 cols 400 entries
Finished phase 1 with 101 SingleSign rule and 5 generalized
[2026-05-24 22:38:36] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17286239168655867252.kers
Total runtime 1 ms.
[2026-05-24 22:38:36] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-24 22:38:36] [INFO ] Invariant cache hit.
[2026-05-24 22:38:36] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-24 22:38:36] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2026-05-24 22:38:36] [INFO ] Invariant cache hit.
[2026-05-24 22:38:36] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 180/292 variables, 112/120 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 45/165 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 1/293 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/293 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (OVERLAPS) 0/293 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 167 constraints, problems are : Problem set: 0 solved, 175 unsolved in 17346 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 180/292 variables, 112/132 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 45/177 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 175/352 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (OVERLAPS) 1/293 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/293 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 12 (OVERLAPS) 0/293 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 353 constraints, problems are : Problem set: 0 solved, 175 unsolved in 18499 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35866ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 35867ms
Finished structural reductions in LTL mode , in 1 iterations and 36050 ms. Remains : 113/113 places, 180/180 transitions.
[2026-05-24 22:39:12] [INFO ] Flatten gal took : 7 ms
[2026-05-24 22:39:12] [INFO ] Flatten gal took : 6 ms
[2026-05-24 22:39:12] [INFO ] Input system was already deterministic with 180 transitions.
[2026-05-24 22:39:12] [INFO ] Flatten gal took : 6 ms
[2026-05-24 22:39:12] [INFO ] Flatten gal took : 7 ms
[2026-05-24 22:39:12] [INFO ] Time to serialize gal into /tmp/CTLFireability2810915820945420272.gal : 2 ms
[2026-05-24 22:39:12] [INFO ] Time to serialize properties into /tmp/CTLFireability11212619256562514376.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/CTLFireability2810915820945420272.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11212619256562514376.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,200157,0.346045,18544,2,5621,5,52743,6,0,616,51547,0


Converting to forward existential form...Done !
original formula: AG((E(EF((Node3GiveAnswer0>=1)) U A(((Node0IsInserted>=1)&&(Node2Request>=1)) U !(((Node2GiveAnswer3>=1)||(Node4JoinMsg>=1))))) + ((EX(((...441
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * !(E(E(TRUE U (Node3GiveAnswer0>=1)) U !((E(!(!(((Node2GiveAnswer3>=1)||(Node4JoinMsg>=1))...1899
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t9, t13, t16, t21, t25, t28, t33, t37, t40, t45, t49, t52, t57, t61, t63, t64, t65, t...687
(forward)formula 0,0,4.16256,143796,1,0,596,751715,404,302,3814,708267,601
FORMULA CANInsertWithFailure-PT-005-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 3 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2026-05-24 22:39:16] [INFO ] Invariant cache hit.
[2026-05-24 22:39:16] [INFO ] Implicit Places using invariants in 65 ms returned []
[2026-05-24 22:39:16] [INFO ] Invariant cache hit.
[2026-05-24 22:39:16] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-24 22:39:16] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 195 ms. Remains : 113/113 places, 180/180 transitions.
[2026-05-24 22:39:16] [INFO ] Flatten gal took : 8 ms
[2026-05-24 22:39:16] [INFO ] Flatten gal took : 5 ms
[2026-05-24 22:39:16] [INFO ] Input system was already deterministic with 180 transitions.
[2026-05-24 22:39:16] [INFO ] Flatten gal took : 4 ms
[2026-05-24 22:39:16] [INFO ] Flatten gal took : 5 ms
[2026-05-24 22:39:16] [INFO ] Time to serialize gal into /tmp/CTLFireability1357180011793022560.gal : 2 ms
[2026-05-24 22:39:16] [INFO ] Time to serialize properties into /tmp/CTLFireability10481425776602994114.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/CTLFireability1357180011793022560.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10481425776602994114.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,200157,0.370516,18476,2,5621,5,52743,6,0,616,51547,0


Converting to forward existential form...Done !
original formula: (AX((EG(!(A((Node1requestsent0>=1) U ((Node4IsInserted>=1)&&(Node1requestsent4>=1))))) * !(A((Node0GiveAnswer3>=1) U ((Node2WaitAnswer>=1...578
=> equivalent forward existential formula: ([(EY((Init * !(EG((((!(EX(!(((Node3DHTinfo2<1)||(Node4requestsent1>=1))))) * E(TRUE U (((Node1WaitAnswer>=1)&&(...1357
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t9, t13, t16, t21, t25, t28, t33, t37, t40, t45, t49, t52, t57, t61, t63, t64, t65, t...687
Using saturation style SCC detection
(forward)formula 0,1,24.7634,724504,1,0,909,4.5944e+06,424,499,3934,4.00574e+06,999
FORMULA CANInsertWithFailure-PT-005-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 113 transition count 151
Reduce places removed 29 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 30 rules applied. Total rules applied 59 place count 84 transition count 150
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 83 transition count 150
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 60 place count 83 transition count 148
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 64 place count 81 transition count 148
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 68 place count 79 transition count 146
Applied a total of 68 rules in 19 ms. Remains 79 /113 variables (removed 34) and now considering 146/180 (removed 34) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10674045885461587774.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4101550126769763083.kers'
[2026-05-24 22:39:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10674045885461587774.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4101550126769763083.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 146 rows 79 cols 330 entries
Finished phase 1 with 67 SingleSign rule and 5 generalized
[2026-05-24 22:39:41] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4101550126769763083.kers
Total runtime 1 ms.
[2026-05-24 22:39:41] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-05-24 22:39:41] [INFO ] Invariant cache hit.
[2026-05-24 22:39:41] [INFO ] State equation strengthened by 47 read => feed constraints.
[2026-05-24 22:39:42] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2026-05-24 22:39:42] [INFO ] Redundant transitions in 5 ms returned []
Running 141 sub problems to find dead transitions.
[2026-05-24 22:39:42] [INFO ] Invariant cache hit.
[2026-05-24 22:39:42] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (OVERLAPS) 146/224 variables, 78/104 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 47/151 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 10 (OVERLAPS) 1/225 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/225 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 12 (OVERLAPS) 0/225 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 152 constraints, problems are : Problem set: 0 solved, 141 unsolved in 13425 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 79/79 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 141 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (OVERLAPS) 146/224 variables, 78/104 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 47/151 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 141/292 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 8 (OVERLAPS) 1/225 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/225 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 10 (OVERLAPS) 0/225 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Int declared 225/225 variables, and 293 constraints, problems are : Problem set: 0 solved, 141 unsolved in 13489 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 79/79 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26941ms problems are : Problem set: 0 solved, 141 unsolved
Search for dead transitions found 0 dead transitions in 26942ms
Starting structural reductions in SI_CTL mode, iteration 1 : 79/113 places, 146/180 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27113 ms. Remains : 79/113 places, 146/180 transitions.
[2026-05-24 22:40:08] [INFO ] Flatten gal took : 5 ms
[2026-05-24 22:40:08] [INFO ] Flatten gal took : 4 ms
[2026-05-24 22:40:08] [INFO ] Input system was already deterministic with 146 transitions.
[2026-05-24 22:40:08] [INFO ] Flatten gal took : 4 ms
[2026-05-24 22:40:08] [INFO ] Flatten gal took : 4 ms
[2026-05-24 22:40:08] [INFO ] Time to serialize gal into /tmp/CTLFireability9808752614208484387.gal : 1 ms
[2026-05-24 22:40:08] [INFO ] Time to serialize properties into /tmp/CTLFireability12056164731300320451.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/CTLFireability9808752614208484387.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12056164731300320451.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,47482,0.279486,15720,2,5100,5,43237,6,0,446,42625,0


Converting to forward existential form...Done !
original formula: EG((EF(((A((Node4GiveAnswer0>=1) U E(((Node0IsInserted>=1)&&(Node4Request>=1)) U (Node4requestsent1>=1))) + (Node1Request<1)) + (Node3IsI...398
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U ((!((E(!(E(((Node0IsInserted>=1)&&(Node4Request>=1)) U (Node4requestsent1>=1))) U (!((Node4...632
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t8, t10, t11, t13, t14, t15, t16, t17, t20, t22, t23, t24, t26, t28, t29,...659
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,14.0223,422572,1,0,961,2.61296e+06,349,529,2982,2.46693e+06,931
FORMULA CANInsertWithFailure-PT-005-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 9 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3855062882274020776.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3604308842699681959.kers'
[2026-05-24 22:40:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3855062882274020776.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3604308842699681959.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 180 rows 113 cols 400 entries
Finished phase 1 with 101 SingleSign rule and 5 generalized
[2026-05-24 22:40:23] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3604308842699681959.kers
Total runtime 1 ms.
[2026-05-24 22:40:23] [INFO ] Implicit Places using invariants in 76 ms returned []
[2026-05-24 22:40:23] [INFO ] Invariant cache hit.
[2026-05-24 22:40:23] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-24 22:40:23] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2026-05-24 22:40:23] [INFO ] Invariant cache hit.
[2026-05-24 22:40:23] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 180/292 variables, 112/120 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 45/165 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 1/293 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/293 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (OVERLAPS) 0/293 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 167 constraints, problems are : Problem set: 0 solved, 175 unsolved in 16506 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 180/292 variables, 112/132 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 45/177 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 175/352 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (OVERLAPS) 1/293 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/293 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 12 (OVERLAPS) 0/293 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 353 constraints, problems are : Problem set: 0 solved, 175 unsolved in 18348 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34871ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 34873ms
Finished structural reductions in LTL mode , in 1 iterations and 35092 ms. Remains : 113/113 places, 180/180 transitions.
[2026-05-24 22:40:58] [INFO ] Flatten gal took : 13 ms
[2026-05-24 22:40:58] [INFO ] Flatten gal took : 6 ms
[2026-05-24 22:40:58] [INFO ] Input system was already deterministic with 180 transitions.
[2026-05-24 22:40:58] [INFO ] Flatten gal took : 5 ms
[2026-05-24 22:40:58] [INFO ] Flatten gal took : 4 ms
[2026-05-24 22:40:58] [INFO ] Time to serialize gal into /tmp/CTLFireability10924906509853084596.gal : 1 ms
[2026-05-24 22:40:58] [INFO ] Time to serialize properties into /tmp/CTLFireability18179478615861947567.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/CTLFireability10924906509853084596.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18179478615861947567.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,200157,0.369294,18488,2,5621,5,52743,6,0,616,51547,0


Converting to forward existential form...Done !
original formula: EG((EX(EX(!(E((Node4requestsent0>=1) U (Node2GiveAnswer0>=1))))) + (Node0requestsent3>=1)))
=> equivalent forward existential formula: [FwdG(Init,(EX(EX(!(E((Node4requestsent0>=1) U (Node2GiveAnswer0>=1))))) + (Node0requestsent3>=1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t9, t13, t16, t21, t25, t28, t33, t37, t40, t45, t49, t52, t57, t61, t63, t64, t65, t...687
(forward)formula 0,1,8.31965,224396,1,0,507,990088,387,282,3699,1.23732e+06,483
FORMULA CANInsertWithFailure-PT-005-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 113 transition count 148
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 81 transition count 148
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 64 place count 81 transition count 147
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 66 place count 80 transition count 147
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 74 place count 76 transition count 143
Applied a total of 74 rules in 26 ms. Remains 76 /113 variables (removed 37) and now considering 143/180 (removed 37) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18100767884290929288.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1679052421421550495.kers'
[2026-05-24 22:41:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18100767884290929288.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1679052421421550495.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 143 rows 76 cols 324 entries
Finished phase 1 with 64 SingleSign rule and 5 generalized
[2026-05-24 22:41:06] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1679052421421550495.kers
Total runtime 1 ms.
[2026-05-24 22:41:06] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-05-24 22:41:06] [INFO ] Invariant cache hit.
[2026-05-24 22:41:06] [INFO ] State equation strengthened by 48 read => feed constraints.
[2026-05-24 22:41:06] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2026-05-24 22:41:06] [INFO ] Redundant transitions in 2 ms returned []
Running 138 sub problems to find dead transitions.
[2026-05-24 22:41:06] [INFO ] Invariant cache hit.
[2026-05-24 22:41:06] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (OVERLAPS) 143/218 variables, 75/101 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 48/149 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (OVERLAPS) 1/219 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 10 (OVERLAPS) 0/219 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 150 constraints, problems are : Problem set: 0 solved, 138 unsolved in 10735 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 76/76 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 143/218 variables, 75/101 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 48/149 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 138/287 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (OVERLAPS) 1/219 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 10 (OVERLAPS) 0/219 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 288 constraints, problems are : Problem set: 0 solved, 138 unsolved in 12857 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 76/76 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23608ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 23608ms
Starting structural reductions in SI_CTL mode, iteration 1 : 76/113 places, 143/180 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23805 ms. Remains : 76/113 places, 143/180 transitions.
[2026-05-24 22:41:30] [INFO ] Flatten gal took : 7 ms
[2026-05-24 22:41:30] [INFO ] Flatten gal took : 4 ms
[2026-05-24 22:41:30] [INFO ] Input system was already deterministic with 143 transitions.
[2026-05-24 22:41:30] [INFO ] Flatten gal took : 3 ms
[2026-05-24 22:41:30] [INFO ] Flatten gal took : 4 ms
[2026-05-24 22:41:30] [INFO ] Time to serialize gal into /tmp/CTLFireability4205882572337768864.gal : 1 ms
[2026-05-24 22:41:30] [INFO ] Time to serialize properties into /tmp/CTLFireability14191072287577786881.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/CTLFireability4205882572337768864.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14191072287577786881.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,40685,0.32511,16068,2,5374,5,43358,6,0,431,44481,0


Converting to forward existential form...Done !
original formula: AF((AG((Node0GiveAnswer3>=1)) + ((Node4GiveAnswer1>=1) * AG((((Node2IsNonInsertedNode<1)&&(Node1requestsent2<1))&&((Node0Request>=1)&&(No...178
=> equivalent forward existential formula: [FwdG(Init,!((!(E(TRUE U !((Node0GiveAnswer3>=1)))) + ((Node4GiveAnswer1>=1) * !(E(TRUE U !((((Node2IsNonInserte...247
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t5, t6, t7, t8, t10, t11, t12, t13, t15, t17, t18, t19, t21, t23, t24, t25, t27, ...656
(forward)formula 0,0,3.2201,91608,1,0,357,409042,315,152,2930,441697,310
FORMULA CANInsertWithFailure-PT-005-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 113 transition count 150
Reduce places removed 30 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 31 rules applied. Total rules applied 61 place count 83 transition count 149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 82 transition count 149
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 62 place count 82 transition count 148
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 64 place count 81 transition count 148
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 72 place count 77 transition count 144
Partial Post-agglomeration rule applied 10 times.
Drop transitions (Partial Post agglomeration) removed 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 82 place count 77 transition count 144
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 86 place count 73 transition count 140
Iterating global reduction 3 with 4 rules applied. Total rules applied 90 place count 73 transition count 140
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 93 place count 73 transition count 137
Applied a total of 93 rules in 22 ms. Remains 73 /113 variables (removed 40) and now considering 137/180 (removed 43) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-142054526471784115.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14925951875767823952.kers'
[2026-05-24 22:41:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-142054526471784115.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14925951875767823952.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 137 rows 73 cols 310 entries
Finished phase 1 with 61 SingleSign rule and 5 generalized
[2026-05-24 22:41:33] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14925951875767823952.kers
Total runtime 1 ms.
[2026-05-24 22:41:33] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-05-24 22:41:33] [INFO ] Invariant cache hit.
[2026-05-24 22:41:33] [INFO ] State equation strengthened by 56 read => feed constraints.
[2026-05-24 22:41:33] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2026-05-24 22:41:33] [INFO ] Redundant transitions in 2 ms returned []
Running 132 sub problems to find dead transitions.
[2026-05-24 22:41:33] [INFO ] Invariant cache hit.
[2026-05-24 22:41:33] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (OVERLAPS) 137/209 variables, 72/98 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 56/154 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (OVERLAPS) 1/210 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 10 (OVERLAPS) 0/210 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 155 constraints, problems are : Problem set: 0 solved, 132 unsolved in 11463 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 137/209 variables, 72/98 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 56/154 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 132/286 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (OVERLAPS) 1/210 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 10 (OVERLAPS) 0/210 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 287 constraints, problems are : Problem set: 0 solved, 132 unsolved in 12262 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23735ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 23737ms
Starting structural reductions in SI_CTL mode, iteration 1 : 73/113 places, 137/180 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23938 ms. Remains : 73/113 places, 137/180 transitions.
[2026-05-24 22:41:57] [INFO ] Flatten gal took : 8 ms
[2026-05-24 22:41:57] [INFO ] Flatten gal took : 3 ms
[2026-05-24 22:41:57] [INFO ] Input system was already deterministic with 137 transitions.
[2026-05-24 22:41:57] [INFO ] Flatten gal took : 3 ms
[2026-05-24 22:41:57] [INFO ] Flatten gal took : 3 ms
[2026-05-24 22:41:57] [INFO ] Time to serialize gal into /tmp/CTLFireability857933544074388485.gal : 0 ms
[2026-05-24 22:41:57] [INFO ] Time to serialize properties into /tmp/CTLFireability12683873349637375576.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/CTLFireability857933544074388485.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12683873349637375576.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,36465,0.296429,15332,2,4805,5,39213,6,0,413,38454,0


Converting to forward existential form...Done !
original formula: A(AG(E(!(((Node3WaitAnswer>=1)&&(Node3NOshare>=1))) U EF((Node2GiveAnswer3>=1)))) U AG(!(AF((((Node0GiveAnswer1>=1)||(Node1ResZone>=1)) *...211
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !(!(!(EG(!((((Node0GiveAnswer1>=1)||(Node1ResZone>=1)) * EG(((Node4IsInserted>=1)&&(...576
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t4, t5, t6, t7, t8, t9, t10, t12, t13, t15, t17, t18, t19, t21, t23, t24, t25, t27, t...613
(forward)formula 0,1,5.30292,146604,1,0,414,846241,311,183,2751,715786,388
FORMULA CANInsertWithFailure-PT-005-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 7 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18257697583981144007.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13584918276100623728.kers'
[2026-05-24 22:42:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18257697583981144007.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13584918276100623728.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 180 rows 113 cols 400 entries
Finished phase 1 with 101 SingleSign rule and 5 generalized
[2026-05-24 22:42:03] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13584918276100623728.kers
Total runtime 1 ms.
[2026-05-24 22:42:03] [INFO ] Implicit Places using invariants in 99 ms returned []
[2026-05-24 22:42:03] [INFO ] Invariant cache hit.
[2026-05-24 22:42:03] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-24 22:42:03] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2026-05-24 22:42:03] [INFO ] Invariant cache hit.
[2026-05-24 22:42:03] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 180/292 variables, 112/120 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 45/165 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 1/293 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/293 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (OVERLAPS) 0/293 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 167 constraints, problems are : Problem set: 0 solved, 175 unsolved in 16654 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 180/292 variables, 112/132 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 45/177 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 175/352 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (OVERLAPS) 1/293 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/293 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 12 (OVERLAPS) 0/293 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 353 constraints, problems are : Problem set: 0 solved, 175 unsolved in 18433 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35098ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 35099ms
Finished structural reductions in LTL mode , in 1 iterations and 35325 ms. Remains : 113/113 places, 180/180 transitions.
[2026-05-24 22:42:38] [INFO ] Flatten gal took : 8 ms
[2026-05-24 22:42:38] [INFO ] Flatten gal took : 4 ms
[2026-05-24 22:42:38] [INFO ] Input system was already deterministic with 180 transitions.
[2026-05-24 22:42:38] [INFO ] Flatten gal took : 4 ms
[2026-05-24 22:42:38] [INFO ] Flatten gal took : 4 ms
[2026-05-24 22:42:38] [INFO ] Time to serialize gal into /tmp/CTLFireability8221099892489986091.gal : 1 ms
[2026-05-24 22:42:38] [INFO ] Time to serialize properties into /tmp/CTLFireability3286785305781834781.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/CTLFireability8221099892489986091.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3286785305781834781.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,200157,0.347607,18464,2,5621,5,52743,6,0,616,51547,0


Converting to forward existential form...Done !
original formula: AX(AG((EF(AG((Node0requestsent3<1))) + ((Node1ResZone>=1) * A((Node4GiveAnswer1>=1) U (Node1GiveAnswer3>=1))))))
=> equivalent forward existential formula: [((FwdU(EY(Init),TRUE) * !(((Node1ResZone>=1) * !((E(!((Node1GiveAnswer3>=1)) U (!((Node4GiveAnswer1>=1)) * !((N...276
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t9, t13, t16, t21, t25, t28, t33, t37, t40, t45, t49, t52, t57, t61, t63, t64, t65, t...687
(forward)formula 0,1,4.52991,144496,1,0,413,770726,382,195,3667,666386,413
FORMULA CANInsertWithFailure-PT-005-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 5 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2026-05-24 22:42:43] [INFO ] Invariant cache hit.
[2026-05-24 22:42:43] [INFO ] Implicit Places using invariants in 70 ms returned []
[2026-05-24 22:42:43] [INFO ] Invariant cache hit.
[2026-05-24 22:42:43] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-24 22:42:43] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 190 ms. Remains : 113/113 places, 180/180 transitions.
[2026-05-24 22:42:43] [INFO ] Flatten gal took : 5 ms
[2026-05-24 22:42:43] [INFO ] Flatten gal took : 5 ms
[2026-05-24 22:42:43] [INFO ] Input system was already deterministic with 180 transitions.
[2026-05-24 22:42:43] [INFO ] Flatten gal took : 3 ms
[2026-05-24 22:42:43] [INFO ] Flatten gal took : 3 ms
[2026-05-24 22:42:43] [INFO ] Time to serialize gal into /tmp/CTLFireability6348625535443467583.gal : 1 ms
[2026-05-24 22:42:43] [INFO ] Time to serialize properties into /tmp/CTLFireability3246278784702896390.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/CTLFireability6348625535443467583.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3246278784702896390.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,200157,0.401858,18536,2,5621,5,52743,6,0,616,51547,0


Converting to forward existential form...Done !
original formula: AF((AG(((!(E((Node1JoinMsg>=1) U (Node1GiveAnswer4>=1))) * (((Node2IsInserted<1)||(Node1requestsent2<1))||(Node1DHTinfo<1))) * ((Node3Giv...296
=> equivalent forward existential formula: [FwdG(Init,!((!(E(TRUE U !(((!(E((Node1JoinMsg>=1) U (Node1GiveAnswer4>=1))) * (((Node2IsInserted<1)||(Node1requ...365
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t9, t13, t16, t21, t25, t28, t33, t37, t40, t45, t49, t52, t57, t61, t63, t64, t65, t...687
(forward)formula 0,0,4.03345,110492,1,0,412,485106,394,199,3989,517265,403
FORMULA CANInsertWithFailure-PT-005-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 1 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2026-05-24 22:42:47] [INFO ] Invariant cache hit.
[2026-05-24 22:42:47] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-24 22:42:47] [INFO ] Invariant cache hit.
[2026-05-24 22:42:47] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-24 22:42:47] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 162 ms. Remains : 113/113 places, 180/180 transitions.
[2026-05-24 22:42:47] [INFO ] Flatten gal took : 5 ms
[2026-05-24 22:42:47] [INFO ] Flatten gal took : 4 ms
[2026-05-24 22:42:47] [INFO ] Input system was already deterministic with 180 transitions.
[2026-05-24 22:42:47] [INFO ] Flatten gal took : 3 ms
[2026-05-24 22:42:47] [INFO ] Flatten gal took : 3 ms
[2026-05-24 22:42:47] [INFO ] Time to serialize gal into /tmp/CTLFireability15878624996525506645.gal : 1 ms
[2026-05-24 22:42:47] [INFO ] Time to serialize properties into /tmp/CTLFireability3847995495997209097.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/CTLFireability15878624996525506645.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3847995495997209097.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,200157,0.38159,18528,2,5621,5,52743,6,0,616,51547,0


Converting to forward existential form...Done !
original formula: (A(AF((Node4requestsent1>=1)) U AF(E((((Node1Request>=1)&&(Node4IsInserted>=1))&&(Node0DHTinfo2>=1)) U (EG(((Node2IsInserted>=1)&&(Node3R...587
=> equivalent forward existential formula: ([((Init * !(EG(!(!(EG(!(E((((Node1Request>=1)&&(Node4IsInserted>=1))&&(Node0DHTinfo2>=1)) U (EG(((Node2IsInsert...1053
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t9, t13, t16, t21, t25, t28, t33, t37, t40, t45, t49, t52, t57, t61, t63, t64, t65, t...687
(forward)formula 0,1,18.1178,511008,1,0,705,3.23273e+06,401,353,3837,2.89982e+06,744
FORMULA CANInsertWithFailure-PT-005-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 113 transition count 145
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 78 transition count 145
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 80 place count 73 transition count 140
Applied a total of 80 rules in 16 ms. Remains 73 /113 variables (removed 40) and now considering 140/180 (removed 40) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10302318646108992438.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5681096437011325914.kers'
[2026-05-24 22:43:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10302318646108992438.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5681096437011325914.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 140 rows 73 cols 315 entries
Finished phase 1 with 61 SingleSign rule and 5 generalized
[2026-05-24 22:43:05] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5681096437011325914.kers
Total runtime 1 ms.
[2026-05-24 22:43:05] [INFO ] Implicit Places using invariants in 60 ms returned []
[2026-05-24 22:43:05] [INFO ] Invariant cache hit.
[2026-05-24 22:43:05] [INFO ] State equation strengthened by 50 read => feed constraints.
[2026-05-24 22:43:05] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2026-05-24 22:43:05] [INFO ] Redundant transitions in 1 ms returned []
Running 135 sub problems to find dead transitions.
[2026-05-24 22:43:05] [INFO ] Invariant cache hit.
[2026-05-24 22:43:05] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (OVERLAPS) 140/212 variables, 72/95 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 50/145 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 9 (OVERLAPS) 1/213 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 11 (OVERLAPS) 0/213 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 146 constraints, problems are : Problem set: 0 solved, 135 unsolved in 10700 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 135 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (OVERLAPS) 140/212 variables, 72/96 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 50/146 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 135/281 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 9 (OVERLAPS) 1/213 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 11 (OVERLAPS) 0/213 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 282 constraints, problems are : Problem set: 0 solved, 135 unsolved in 11622 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22329ms problems are : Problem set: 0 solved, 135 unsolved
Search for dead transitions found 0 dead transitions in 22330ms
Starting structural reductions in SI_CTL mode, iteration 1 : 73/113 places, 140/180 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22515 ms. Remains : 73/113 places, 140/180 transitions.
[2026-05-24 22:43:28] [INFO ] Flatten gal took : 7 ms
[2026-05-24 22:43:28] [INFO ] Flatten gal took : 4 ms
[2026-05-24 22:43:28] [INFO ] Input system was already deterministic with 140 transitions.
[2026-05-24 22:43:28] [INFO ] Flatten gal took : 2 ms
[2026-05-24 22:43:28] [INFO ] Flatten gal took : 9 ms
[2026-05-24 22:43:28] [INFO ] Time to serialize gal into /tmp/CTLFireability14162342384611234274.gal : 1 ms
[2026-05-24 22:43:28] [INFO ] Time to serialize properties into /tmp/CTLFireability16243946069717096145.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/CTLFireability14162342384611234274.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16243946069717096145.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,34352,0.237215,14892,2,4325,5,37975,6,0,416,40137,0


Converting to forward existential form...Done !
original formula: EG(EF((Node3GiveAnswer0<1)))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (Node3GiveAnswer0<1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t11, t13, t14, t15, t17, t19, t20, t21, t23, t25, t26...651
(forward)formula 0,1,2.08521,76072,1,0,352,349639,305,149,2823,383910,300
FORMULA CANInsertWithFailure-PT-005-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 3 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1821875123096680717.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4578825553914826804.kers'
[2026-05-24 22:43:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1821875123096680717.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4578825553914826804.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 180 rows 113 cols 400 entries
Finished phase 1 with 101 SingleSign rule and 5 generalized
[2026-05-24 22:43:30] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4578825553914826804.kers
Total runtime 2 ms.
[2026-05-24 22:43:30] [INFO ] Implicit Places using invariants in 80 ms returned []
[2026-05-24 22:43:30] [INFO ] Invariant cache hit.
[2026-05-24 22:43:30] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-24 22:43:30] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2026-05-24 22:43:30] [INFO ] Invariant cache hit.
[2026-05-24 22:43:30] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 180/292 variables, 112/120 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 45/165 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 1/293 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/293 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (OVERLAPS) 0/293 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 167 constraints, problems are : Problem set: 0 solved, 175 unsolved in 17073 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 180/292 variables, 112/132 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 45/177 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 175/352 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (OVERLAPS) 1/293 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/293 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 12 (OVERLAPS) 0/293 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 353 constraints, problems are : Problem set: 0 solved, 175 unsolved in 18524 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35606ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 35606ms
Finished structural reductions in LTL mode , in 1 iterations and 35838 ms. Remains : 113/113 places, 180/180 transitions.
[2026-05-24 22:44:06] [INFO ] Flatten gal took : 8 ms
[2026-05-24 22:44:06] [INFO ] Flatten gal took : 3 ms
[2026-05-24 22:44:06] [INFO ] Input system was already deterministic with 180 transitions.
[2026-05-24 22:44:06] [INFO ] Flatten gal took : 3 ms
[2026-05-24 22:44:06] [INFO ] Flatten gal took : 4 ms
[2026-05-24 22:44:06] [INFO ] Time to serialize gal into /tmp/CTLFireability7857582604473323416.gal : 1 ms
[2026-05-24 22:44:06] [INFO ] Time to serialize properties into /tmp/CTLFireability2880148798956368635.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/CTLFireability7857582604473323416.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2880148798956368635.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,200157,0.398082,18472,2,5621,5,52743,6,0,616,51547,0


Converting to forward existential form...Done !
original formula: EG(AF((EF(EX((Node2JoinMsg<1))) + !(E((Node2GiveAnswer4<1) U (Node2GiveAnswer0<1))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((E(TRUE U EX((Node2JoinMsg<1))) + !(E((Node2GiveAnswer4<1) U (Node2GiveAnswer0<1))))))))] != F...159
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t9, t13, t16, t21, t25, t28, t33, t37, t40, t45, t49, t52, t57, t61, t63, t64, t65, t...687
Using saturation style SCC detection
(forward)formula 0,1,8.4984,237492,1,0,517,1.08148e+06,398,292,3922,1.28511e+06,501
FORMULA CANInsertWithFailure-PT-005-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 113 transition count 149
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 82 transition count 149
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 72 place count 77 transition count 144
Applied a total of 72 rules in 11 ms. Remains 77 /113 variables (removed 36) and now considering 144/180 (removed 36) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11628529894416859778.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12041446842342095348.kers'
[2026-05-24 22:44:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11628529894416859778.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12041446842342095348.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 144 rows 77 cols 323 entries
Finished phase 1 with 65 SingleSign rule and 5 generalized
[2026-05-24 22:44:14] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12041446842342095348.kers
Total runtime 1 ms.
[2026-05-24 22:44:14] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-05-24 22:44:14] [INFO ] Invariant cache hit.
[2026-05-24 22:44:15] [INFO ] State equation strengthened by 50 read => feed constraints.
[2026-05-24 22:44:15] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2026-05-24 22:44:15] [INFO ] Redundant transitions in 1 ms returned []
Running 139 sub problems to find dead transitions.
[2026-05-24 22:44:15] [INFO ] Invariant cache hit.
[2026-05-24 22:44:15] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 8 (OVERLAPS) 144/220 variables, 76/102 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/220 variables, 50/152 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/220 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 11 (OVERLAPS) 1/221 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/221 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 13 (OVERLAPS) 0/221 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Real declared 221/221 variables, and 153 constraints, problems are : Problem set: 0 solved, 139 unsolved in 11421 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 77/77 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 139 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (OVERLAPS) 144/220 variables, 76/102 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 50/152 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 139/291 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 8 (OVERLAPS) 1/221 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/221 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 10 (OVERLAPS) 0/221 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Int declared 221/221 variables, and 292 constraints, problems are : Problem set: 0 solved, 139 unsolved in 12941 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 77/77 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24375ms problems are : Problem set: 0 solved, 139 unsolved
Search for dead transitions found 0 dead transitions in 24376ms
Starting structural reductions in SI_CTL mode, iteration 1 : 77/113 places, 144/180 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24550 ms. Remains : 77/113 places, 144/180 transitions.
[2026-05-24 22:44:39] [INFO ] Flatten gal took : 3 ms
[2026-05-24 22:44:39] [INFO ] Flatten gal took : 2 ms
[2026-05-24 22:44:39] [INFO ] Input system was already deterministic with 144 transitions.
[2026-05-24 22:44:39] [INFO ] Flatten gal took : 2 ms
[2026-05-24 22:44:39] [INFO ] Flatten gal took : 2 ms
[2026-05-24 22:44:39] [INFO ] Time to serialize gal into /tmp/CTLFireability8603151617698418100.gal : 1 ms
[2026-05-24 22:44:39] [INFO ] Time to serialize properties into /tmp/CTLFireability16732523858316278977.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/CTLFireability8603151617698418100.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16732523858316278977.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,34356,0.296603,15208,2,4953,5,39383,6,0,436,40264,0


Converting to forward existential form...Done !
original formula: EG(AF((AF(((Node3IsInserted>=1)&&(Node1requestsent3>=1))) + (EF((Node1ResZone>=1)) * E((Node0GiveAnswer3>=1) U ((Node2IsInserted>=1)&&(No...180
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((!(EG(!(((Node3IsInserted>=1)&&(Node1requestsent3>=1))))) + (E(TRUE U (Node1ResZone>=1)) * E((...241
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t4, t5, t7, t8, t10, t11, t12, t13, t15, t17, t18, t19, t21, t23, t24, t25, t27, t29,...658
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,7.46412,245556,1,0,490,1.44785e+06,332,243,2894,1.33082e+06,494
FORMULA CANInsertWithFailure-PT-005-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 4 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12549077925570337993.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15493187049579807747.kers'
[2026-05-24 22:44:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12549077925570337993.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15493187049579807747.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 180 rows 113 cols 400 entries
Finished phase 1 with 101 SingleSign rule and 5 generalized
[2026-05-24 22:44:47] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15493187049579807747.kers
Total runtime 3 ms.
[2026-05-24 22:44:47] [INFO ] Implicit Places using invariants in 84 ms returned []
[2026-05-24 22:44:47] [INFO ] Invariant cache hit.
[2026-05-24 22:44:47] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-24 22:44:47] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2026-05-24 22:44:47] [INFO ] Invariant cache hit.
[2026-05-24 22:44:47] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 180/292 variables, 112/120 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 45/165 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 1/293 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/293 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (OVERLAPS) 0/293 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 167 constraints, problems are : Problem set: 0 solved, 175 unsolved in 16660 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 180/292 variables, 112/132 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 45/177 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 175/352 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (OVERLAPS) 1/293 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/293 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 12 (OVERLAPS) 0/293 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 353 constraints, problems are : Problem set: 0 solved, 175 unsolved in 17974 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34656ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 34658ms
Finished structural reductions in LTL mode , in 1 iterations and 34870 ms. Remains : 113/113 places, 180/180 transitions.
[2026-05-24 22:45:21] [INFO ] Flatten gal took : 3 ms
[2026-05-24 22:45:21] [INFO ] Flatten gal took : 4 ms
[2026-05-24 22:45:21] [INFO ] Input system was already deterministic with 180 transitions.
[2026-05-24 22:45:21] [INFO ] Flatten gal took : 2 ms
[2026-05-24 22:45:21] [INFO ] Flatten gal took : 2 ms
[2026-05-24 22:45:21] [INFO ] Time to serialize gal into /tmp/CTLFireability7097613310920640731.gal : 1 ms
[2026-05-24 22:45:21] [INFO ] Time to serialize properties into /tmp/CTLFireability6794476057321874439.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/CTLFireability7097613310920640731.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6794476057321874439.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,200157,0.440852,18488,2,5621,5,52743,6,0,616,51547,0


Converting to forward existential form...Done !
original formula: EF(AX((Node1GiveAnswer3>=1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!((Node1GiveAnswer3>=1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t9, t13, t16, t21, t25, t28, t33, t37, t40, t45, t49, t52, t57, t61, t63, t64, t65, t...687
(forward)formula 0,1,3.8235,93976,1,0,390,423599,377,181,3604,446454,367
FORMULA CANInsertWithFailure-PT-005-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2026-05-24 22:45:25] [INFO ] Invariant cache hit.
[2026-05-24 22:45:25] [INFO ] Implicit Places using invariants in 75 ms returned []
[2026-05-24 22:45:25] [INFO ] Invariant cache hit.
[2026-05-24 22:45:25] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-24 22:45:25] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 211 ms. Remains : 113/113 places, 180/180 transitions.
[2026-05-24 22:45:25] [INFO ] Flatten gal took : 3 ms
[2026-05-24 22:45:25] [INFO ] Flatten gal took : 3 ms
[2026-05-24 22:45:26] [INFO ] Input system was already deterministic with 180 transitions.
[2026-05-24 22:45:26] [INFO ] Flatten gal took : 2 ms
[2026-05-24 22:45:26] [INFO ] Flatten gal took : 2 ms
[2026-05-24 22:45:26] [INFO ] Time to serialize gal into /tmp/CTLFireability2012738136017946230.gal : 1 ms
[2026-05-24 22:45:26] [INFO ] Time to serialize properties into /tmp/CTLFireability5150251523854391251.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/CTLFireability2012738136017946230.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5150251523854391251.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,200157,0.401131,18492,2,5621,5,52743,6,0,616,51547,0


Converting to forward existential form...Done !
original formula: E(AG(EF(!(EX(((EmptyCAN>=1)&&(Node3ReadyToInsert>=1)))))) U AG((Node1GiveAnswer2>=1)))
=> equivalent forward existential formula: [(FwdU(Init,!(E(TRUE U !(E(TRUE U !(EX(((EmptyCAN>=1)&&(Node3ReadyToInsert>=1))))))))) * !(E(TRUE U !((Node1Give...180
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t9, t13, t16, t21, t25, t28, t33, t37, t40, t45, t49, t52, t57, t61, t63, t64, t65, t...687
(forward)formula 0,0,3.90164,101508,1,0,389,475334,382,181,3674,461037,373
FORMULA CANInsertWithFailure-PT-005-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2026-05-24 22:45:29] [INFO ] Flatten gal took : 6 ms
[2026-05-24 22:45:29] [INFO ] Flatten gal took : 2 ms
Total runtime 507157 ms.

BK_STOP 1779662730032

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANInsertWithFailure-PT-005"
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 CANInsertWithFailure-PT-005, 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-177946842100698"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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