About the Execution of ITS-Tools for Diffusion2D-PT-D20N010
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1678.104 | 533186.00 | 642800.00 | 1241.20 | FTFFTFTFTTFTFTTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r098-tall-177955695400106.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 Diffusion2D-PT-D20N010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-tall-177955695400106
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 8.8K Mar 6 16:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Mar 6 16:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 6 16:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 6 16:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 09:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 09:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 15 09:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 09:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Mar 6 16:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Mar 6 16:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Mar 6 16:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 6 16:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 09:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 09:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 1.2M 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 Diffusion2D-PT-D20N010-CTLFireability-2024-00
FORMULA_NAME Diffusion2D-PT-D20N010-CTLFireability-2024-01
FORMULA_NAME Diffusion2D-PT-D20N010-CTLFireability-2024-02
FORMULA_NAME Diffusion2D-PT-D20N010-CTLFireability-2024-03
FORMULA_NAME Diffusion2D-PT-D20N010-CTLFireability-2024-04
FORMULA_NAME Diffusion2D-PT-D20N010-CTLFireability-2024-05
FORMULA_NAME Diffusion2D-PT-D20N010-CTLFireability-2024-06
FORMULA_NAME Diffusion2D-PT-D20N010-CTLFireability-2024-07
FORMULA_NAME Diffusion2D-PT-D20N010-CTLFireability-2024-08
FORMULA_NAME Diffusion2D-PT-D20N010-CTLFireability-2024-09
FORMULA_NAME Diffusion2D-PT-D20N010-CTLFireability-2024-10
FORMULA_NAME Diffusion2D-PT-D20N010-CTLFireability-2024-11
FORMULA_NAME Diffusion2D-PT-D20N010-CTLFireability-2024-12
FORMULA_NAME Diffusion2D-PT-D20N010-CTLFireability-2024-13
FORMULA_NAME Diffusion2D-PT-D20N010-CTLFireability-2024-14
FORMULA_NAME Diffusion2D-PT-D20N010-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1779569911049
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Diffusion2D-PT-D20N010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-23 20:58:32] [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-23 20:58:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 20:58:32] [INFO ] Load time of PNML (sax parser for PT used): 156 ms
[2026-05-23 20:58:32] [INFO ] Transformed 400 places.
[2026-05-23 20:58:32] [INFO ] Transformed 2964 transitions.
[2026-05-23 20:58:32] [INFO ] Parsed PT model containing 400 places and 2964 transitions and 5928 arcs in 256 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Support contains 96 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 2964/2964 transitions.
Applied a total of 0 rules in 61 ms. Remains 400 /400 variables (removed 0) and now considering 2964/2964 (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-10314025545536214337.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11757393451723080544.kers'
[2026-05-23 20:58:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10314025545536214337.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11757393451723080544.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 2964 rows 400 cols 5928 entries
Finished phase 1 with 399 SingleSign rule and 0 generalized
[2026-05-23 20:58:32] [INFO ] Computed 1 invariants in 9 ms
Computed 1 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-11757393451723080544.kers
Total runtime 12 ms.
[2026-05-23 20:58:32] [INFO ] Implicit Places using invariants in 293 ms returned []
[2026-05-23 20:58:32] [INFO ] Invariant cache hit.
[2026-05-23 20:58:33] [INFO ] Implicit Places using invariants and state equation in 566 ms returned []
Implicit Place search using SMT with State Equation took 897 ms to find 0 implicit places.
Running 2956 sub problems to find dead transitions.
[2026-05-23 20:58:33] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 399/3364 variables, and 0 constraints, problems are : Problem set: 0 solved, 2956 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/400 constraints, PredecessorRefiner: 2956/2956 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2956 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 399/3364 variables, and 0 constraints, problems are : Problem set: 0 solved, 2956 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/400 constraints, PredecessorRefiner: 0/2956 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61217ms problems are : Problem set: 0 solved, 2956 unsolved
Search for dead transitions found 0 dead transitions in 61247ms
Finished structural reductions in LTL mode , in 1 iterations and 62274 ms. Remains : 400/400 places, 2964/2964 transitions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 2964/2964 transitions.
Applied a total of 0 rules in 14 ms. Remains 400 /400 variables (removed 0) and now considering 2964/2964 (removed 0) transitions.
[2026-05-23 20:59:34] [INFO ] Invariant cache hit.
[2026-05-23 20:59:34] [INFO ] Implicit Places using invariants in 64 ms returned []
[2026-05-23 20:59:34] [INFO ] Invariant cache hit.
[2026-05-23 20:59:35] [INFO ] Implicit Places using invariants and state equation in 469 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 551 ms. Remains : 400/400 places, 2964/2964 transitions.
Support contains 96 out of 400 places after structural reductions.
[2026-05-23 20:59:35] [INFO ] Flatten gal took : 139 ms
[2026-05-23 20:59:35] [INFO ] Flatten gal took : 75 ms
[2026-05-23 20:59:35] [INFO ] Input system was already deterministic with 2964 transitions.
RANDOM walk for 40001 steps (8 resets) in 1276 ms. (31 steps per ms) remains 5/81 properties
BEST_FIRST walk for 40004 steps (8 resets) in 203 ms. (196 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 4/4 properties
[2026-05-23 20:59:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 391/400 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2964/3364 variables, 400/401 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3364 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/3364 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3364/3364 variables, and 401 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1553 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 400/400 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 391/400 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2964/3364 variables, 400/401 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3364 variables, 4/405 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3364 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/3364 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3364/3364 variables, and 405 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1473 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 400/400 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3041ms problems are : Problem set: 0 solved, 4 unsolved
Finished Parikh walk after 1149 steps, including 0 resets, run visited all 4 properties in 21 ms. (steps per millisecond=54 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 30 ms.
[2026-05-23 20:59:39] [INFO ] Flatten gal took : 49 ms
[2026-05-23 20:59:39] [INFO ] Flatten gal took : 43 ms
[2026-05-23 20:59:39] [INFO ] Input system was already deterministic with 2964 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 2964/2964 transitions.
Applied a total of 0 rules in 11 ms. Remains 400 /400 variables (removed 0) and now considering 2964/2964 (removed 0) transitions.
[2026-05-23 20:59:39] [INFO ] Invariant cache hit.
[2026-05-23 20:59:39] [INFO ] Implicit Places using invariants in 48 ms returned []
[2026-05-23 20:59:39] [INFO ] Invariant cache hit.
[2026-05-23 20:59:40] [INFO ] Implicit Places using invariants and state equation in 446 ms returned []
Implicit Place search using SMT with State Equation took 497 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 510 ms. Remains : 400/400 places, 2964/2964 transitions.
[2026-05-23 20:59:40] [INFO ] Flatten gal took : 35 ms
[2026-05-23 20:59:40] [INFO ] Flatten gal took : 35 ms
[2026-05-23 20:59:40] [INFO ] Input system was already deterministic with 2964 transitions.
[2026-05-23 20:59:40] [INFO ] Flatten gal took : 32 ms
[2026-05-23 20:59:40] [INFO ] Flatten gal took : 36 ms
[2026-05-23 20:59:40] [INFO ] Time to serialize gal into /tmp/CTLFireability5231020968053934165.gal : 21 ms
[2026-05-23 20:59:40] [INFO ] Time to serialize properties into /tmp/CTLFireability8063986431480193366.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5231020968053934165.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8063986431480193366.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.23082e+19,2.51192,54660,2,4391,5,252979,6,0,4567,241710,0
Converting to forward existential form...Done !
original formula: AG(EX(((AX((((cAMP__2_11_>=1)||(cAMP__16_9_>=1))||(cAMP__17_14_>=1))) + (((cAMP__2_6_<1)&&(cAMP__2_19_<1)) * !(A((cAMP__10_3_>=1) U (cAMP...230
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(((!(EX(!((((cAMP__2_11_>=1)||(cAMP__16_9_>=1))||(cAMP__17_14_>=1))))) + (((cAMP__2_6_<1...351
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 2948/0/16
(forward)formula 0,0,20.561,443416,1,0,17,2.34704e+06,28,6,20519,1.82549e+06,14
FORMULA Diffusion2D-PT-D20N010-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 400/400 places, 2964/2964 transitions.
Graph (trivial) has 2948 edges and 400 vertex of which 399 / 400 are part of one of the 1 SCC in 12 ms
Free SCC test removed 398 places
Ensure Unique test removed 2961 transitions
Reduce isomorphic transitions removed 2961 transitions.
Applied a total of 1 rules in 32 ms. Remains 2 /400 variables (removed 398) and now considering 3/2964 (removed 2961) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10923541380703636694.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-331620372585701533.kers'
[2026-05-23 21:00:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10923541380703636694.kers, --Pflows, --basisKERS=/tmp/petrispot-output-331620372585701533.kers]
Normalized transition count is 2 out of 3 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 2 rows 1 cols 2 entries
Finished phase 1 with 1 SingleSign rule and 0 generalized
[2026-05-23 21:00:01] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-331620372585701533.kers
Total runtime 0 ms.
[2026-05-23 21:00:01] [INFO ] Implicit Places using invariants in 17 ms returned []
[2026-05-23 21:00:01] [INFO ] Invariant cache hit.
[2026-05-23 21:00:01] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2026-05-23 21:00:01] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2026-05-23 21:00:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 20 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 4 constraints, problems are : Problem set: 0 solved, 1 unsolved in 26 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 49ms
Starting structural reductions in SI_CTL mode, iteration 1 : 2/400 places, 3/2964 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 120 ms. Remains : 2/400 places, 3/2964 transitions.
[2026-05-23 21:00:01] [INFO ] Flatten gal took : 1 ms
[2026-05-23 21:00:01] [INFO ] Flatten gal took : 1 ms
[2026-05-23 21:00:01] [INFO ] Input system was already deterministic with 3 transitions.
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
FORMULA Diffusion2D-PT-D20N010-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-23 21:00:01] [INFO ] Flatten gal took : 0 ms
[2026-05-23 21:00:01] [INFO ] Flatten gal took : 0 ms
[2026-05-23 21:00:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4205857128985220930.gal : 0 ms
[2026-05-23 21:00:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5852231921341366620.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4205857128985220930.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5852231921341366620.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 2964/2964 transitions.
Applied a total of 0 rules in 11 ms. Remains 400 /400 variables (removed 0) and now considering 2964/2964 (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-10476684008968169222.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11241385221980133624.kers'
[2026-05-23 21:00:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10476684008968169222.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11241385221980133624.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 2964 rows 400 cols 5928 entries
Finished phase 1 with 399 SingleSign rule and 0 generalized
[2026-05-23 21:00:01] [INFO ] Computed 1 invariants in 8 ms
Computed 1 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-11241385221980133624.kers
Total runtime 10 ms.
[2026-05-23 21:00:01] [INFO ] Implicit Places using invariants in 78 ms returned []
[2026-05-23 21:00:01] [INFO ] Invariant cache hit.
[2026-05-23 21:00:02] [INFO ] Implicit Places using invariants and state equation in 473 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
Running 2956 sub problems to find dead transitions.
[2026-05-23 21:00:02] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 399/3364 variables, and 0 constraints, problems are : Problem set: 0 solved, 2956 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/400 constraints, PredecessorRefiner: 2956/2956 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2956 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 399/3364 variables, and 0 constraints, problems are : Problem set: 0 solved, 2956 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/400 constraints, PredecessorRefiner: 0/2956 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61102ms problems are : Problem set: 0 solved, 2956 unsolved
Search for dead transitions found 0 dead transitions in 61108ms
Finished structural reductions in LTL mode , in 1 iterations and 61681 ms. Remains : 400/400 places, 2964/2964 transitions.
[2026-05-23 21:01:03] [INFO ] Flatten gal took : 34 ms
[2026-05-23 21:01:03] [INFO ] Flatten gal took : 32 ms
[2026-05-23 21:01:03] [INFO ] Input system was already deterministic with 2964 transitions.
[2026-05-23 21:01:03] [INFO ] Flatten gal took : 28 ms
[2026-05-23 21:01:03] [INFO ] Flatten gal took : 28 ms
[2026-05-23 21:01:03] [INFO ] Time to serialize gal into /tmp/CTLFireability13736036288043930159.gal : 18 ms
[2026-05-23 21:01:03] [INFO ] Time to serialize properties into /tmp/CTLFireability14815218538620894392.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/CTLFireability13736036288043930159.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14815218538620894392.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,3.23082e+19,2.47961,54748,2,4391,5,252979,6,0,4567,241710,0
Converting to forward existential form...Done !
original formula: AG(((cAMP__6_19_<1) + ((EX((cAMP__8_11_>=1)) * (cAMP__20_19_>=1)) * (cAMP__5_7_>=1))))
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * !((cAMP__6_19_<1))) * !(EX((cAMP__8_11_>=1))))] = FALSE * [((FwdU(Init,TRUE) * !((cAMP__6...273
(forward)formula 0,0,2.49184,54748,1,0,11,252979,11,4,4582,241710,2
FORMULA Diffusion2D-PT-D20N010-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 2964/2964 transitions.
Applied a total of 0 rules in 10 ms. Remains 400 /400 variables (removed 0) and now considering 2964/2964 (removed 0) transitions.
[2026-05-23 21:01:05] [INFO ] Invariant cache hit.
[2026-05-23 21:01:05] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-05-23 21:01:05] [INFO ] Invariant cache hit.
[2026-05-23 21:01:06] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 482 ms. Remains : 400/400 places, 2964/2964 transitions.
[2026-05-23 21:01:06] [INFO ] Flatten gal took : 30 ms
[2026-05-23 21:01:06] [INFO ] Flatten gal took : 30 ms
[2026-05-23 21:01:06] [INFO ] Input system was already deterministic with 2964 transitions.
[2026-05-23 21:01:06] [INFO ] Flatten gal took : 24 ms
[2026-05-23 21:01:06] [INFO ] Flatten gal took : 25 ms
[2026-05-23 21:01:06] [INFO ] Time to serialize gal into /tmp/CTLFireability397259535896915664.gal : 7 ms
[2026-05-23 21:01:06] [INFO ] Time to serialize properties into /tmp/CTLFireability11214189656006849991.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/CTLFireability397259535896915664.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11214189656006849991.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.23082e+19,2.52071,54804,2,4391,5,252979,6,0,4567,241710,0
Converting to forward existential form...Done !
original formula: EX((((!(E(AF((cAMP__13_20_>=1)) U (cAMP__9_18_>=1))) * !(A((((cAMP__3_9_>=1)||(cAMP__18_9_>=1))&&((cAMP__14_20_>=1)||(cAMP__18_10_>=1))) ...363
=> equivalent forward existential formula: (([((EY(Init) * ((!(E(!(EG(!((cAMP__13_20_>=1)))) U (cAMP__9_18_>=1))) * !(!((E(!((((cAMP__11_12_<1)||(cAMP__18_...1473
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,12.7094,247864,1,0,13,1.34989e+06,32,2,20499,534099,13
FORMULA Diffusion2D-PT-D20N010-CTLFireability-2024-03 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 : 400/400 places, 2964/2964 transitions.
Applied a total of 0 rules in 17 ms. Remains 400 /400 variables (removed 0) and now considering 2964/2964 (removed 0) transitions.
[2026-05-23 21:01:19] [INFO ] Invariant cache hit.
[2026-05-23 21:01:19] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-05-23 21:01:19] [INFO ] Invariant cache hit.
[2026-05-23 21:01:19] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 503 ms. Remains : 400/400 places, 2964/2964 transitions.
[2026-05-23 21:01:19] [INFO ] Flatten gal took : 32 ms
[2026-05-23 21:01:19] [INFO ] Flatten gal took : 23 ms
[2026-05-23 21:01:20] [INFO ] Input system was already deterministic with 2964 transitions.
[2026-05-23 21:01:20] [INFO ] Flatten gal took : 26 ms
[2026-05-23 21:01:20] [INFO ] Flatten gal took : 26 ms
[2026-05-23 21:01:20] [INFO ] Time to serialize gal into /tmp/CTLFireability15767369857060250320.gal : 11 ms
[2026-05-23 21:01:20] [INFO ] Time to serialize properties into /tmp/CTLFireability5542300360964247246.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/CTLFireability15767369857060250320.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5542300360964247246.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.23082e+19,2.68474,54796,2,4391,5,252979,6,0,4567,241710,0
Converting to forward existential form...Done !
original formula: EX((AX(((AG(EF((cAMP__10_13_>=1))) * EG((cAMP__11_6_>=1))) * (cAMP__12_16_>=1))) + (((((cAMP__12_16_>=1) + EX(EF((cAMP__19_16_>=1)))) + (...312
=> equivalent forward existential formula: ([(EY(Init) * !(EX(!(((!(E(TRUE U !(E(TRUE U (cAMP__10_13_>=1))))) * EG((cAMP__11_6_>=1))) * (cAMP__12_16_>=1)))...623
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 2948/0/16
(forward)formula 0,1,19.4872,362568,1,0,30,1.97983e+06,40,15,21944,1.0875e+06,28
FORMULA Diffusion2D-PT-D20N010-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 2964/2964 transitions.
Applied a total of 0 rules in 10 ms. Remains 400 /400 variables (removed 0) and now considering 2964/2964 (removed 0) transitions.
[2026-05-23 21:01:39] [INFO ] Invariant cache hit.
[2026-05-23 21:01:39] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-23 21:01:39] [INFO ] Invariant cache hit.
[2026-05-23 21:01:40] [INFO ] Implicit Places using invariants and state equation in 499 ms returned []
Implicit Place search using SMT with State Equation took 567 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 579 ms. Remains : 400/400 places, 2964/2964 transitions.
[2026-05-23 21:01:40] [INFO ] Flatten gal took : 24 ms
[2026-05-23 21:01:40] [INFO ] Flatten gal took : 24 ms
[2026-05-23 21:01:40] [INFO ] Input system was already deterministic with 2964 transitions.
[2026-05-23 21:01:40] [INFO ] Flatten gal took : 23 ms
[2026-05-23 21:01:40] [INFO ] Flatten gal took : 27 ms
[2026-05-23 21:01:40] [INFO ] Time to serialize gal into /tmp/CTLFireability17390019913383557766.gal : 7 ms
[2026-05-23 21:01:40] [INFO ] Time to serialize properties into /tmp/CTLFireability1302589922639914145.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/CTLFireability17390019913383557766.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1302589922639914145.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.23082e+19,2.49526,54748,2,4391,5,252979,6,0,4567,241710,0
Converting to forward existential form...Done !
original formula: AX(((EG((cAMP__13_9_>=1)) + ((AG(AF((cAMP__10_6_<1))) * (cAMP__2_17_<1)) * (!(A((cAMP__13_19_>=1) U (cAMP__8_19_<1))) + AX(((cAMP__15_10_...291
=> equivalent forward existential formula: ([((EY(Init) * !((EG((cAMP__13_9_>=1)) + ((!(E(TRUE U !(!(EG(!((cAMP__10_6_<1))))))) * (cAMP__2_17_<1)) * (!(!((...972
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 2948/0/16
(forward)formula 0,0,18.6767,380528,1,0,20,2.14361e+06,55,7,20554,1.32076e+06,22
FORMULA Diffusion2D-PT-D20N010-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 400/400 places, 2964/2964 transitions.
Graph (trivial) has 2776 edges and 400 vertex of which 387 / 400 are part of one of the 1 SCC in 8 ms
Free SCC test removed 386 places
Ensure Unique test removed 2935 transitions
Reduce isomorphic transitions removed 2935 transitions.
Applied a total of 1 rules in 17 ms. Remains 14 /400 variables (removed 386) and now considering 29/2964 (removed 2935) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6599313525407630173.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6429169482434669928.kers'
[2026-05-23 21:01:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6599313525407630173.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6429169482434669928.kers]
Normalized transition count is 28 out of 29 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 28 rows 14 cols 56 entries
Finished phase 1 with 13 SingleSign rule and 0 generalized
[2026-05-23 21:01:59] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6429169482434669928.kers
Total runtime 0 ms.
[2026-05-23 21:01:59] [INFO ] Implicit Places using invariants in 21 ms returned []
[2026-05-23 21:01:59] [INFO ] Invariant cache hit.
[2026-05-23 21:01:59] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2026-05-23 21:01:59] [INFO ] Redundant transitions in 1 ms returned []
Running 15 sub problems to find dead transitions.
[2026-05-23 21:01:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 1/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 28/42 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 0/42 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 42/43 variables, and 15 constraints, problems are : Problem set: 0 solved, 15 unsolved in 135 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 14/14 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 1/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 28/42 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 15/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/42 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 42/43 variables, and 30 constraints, problems are : Problem set: 0 solved, 15 unsolved in 122 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 14/14 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 273ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 273ms
Starting structural reductions in SI_CTL mode, iteration 1 : 14/400 places, 29/2964 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 347 ms. Remains : 14/400 places, 29/2964 transitions.
[2026-05-23 21:01:59] [INFO ] Flatten gal took : 0 ms
[2026-05-23 21:01:59] [INFO ] Flatten gal took : 0 ms
[2026-05-23 21:01:59] [INFO ] Input system was already deterministic with 29 transitions.
[2026-05-23 21:01:59] [INFO ] Flatten gal took : 0 ms
[2026-05-23 21:01:59] [INFO ] Flatten gal took : 1 ms
[2026-05-23 21:01:59] [INFO ] Time to serialize gal into /tmp/CTLFireability14892952270536679368.gal : 0 ms
[2026-05-23 21:01:59] [INFO ] Time to serialize properties into /tmp/CTLFireability1701162636915040079.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/CTLFireability14892952270536679368.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1701162636915040079.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.14407e+06,0.010889,4240,2,145,5,2690,6,0,87,2262,0
Converting to forward existential form...Done !
original formula: !(E(((!(A(((((cAMP__5_1_>=1)&&(cAMP__5_3_>=1))||(cAMP__15_2_>=1))||(cAMP__6_18_>=1)) U (cAMP__3_4_>=1))) + (cAMP__4_12_>=1)) + EG(((cAMP_...306
=> equivalent forward existential formula: [((((FwdU(Init,((!(!((E(!((cAMP__3_4_>=1)) U (!(((((cAMP__5_1_>=1)&&(cAMP__5_3_>=1))||(cAMP__15_2_>=1))||(cAMP__...416
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 25/0/4
(forward)formula 0,1,0.039121,5320,1,0,10,7748,22,1,478,6442,9
FORMULA Diffusion2D-PT-D20N010-CTLFireability-2024-06 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 : 400/400 places, 2964/2964 transitions.
Graph (trivial) has 2890 edges and 400 vertex of which 395 / 400 are part of one of the 1 SCC in 4 ms
Free SCC test removed 394 places
Ensure Unique test removed 2953 transitions
Reduce isomorphic transitions removed 2953 transitions.
Applied a total of 1 rules in 10 ms. Remains 6 /400 variables (removed 394) and now considering 11/2964 (removed 2953) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10522800646372043910.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5159689149231682087.kers'
[2026-05-23 21:01:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10522800646372043910.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5159689149231682087.kers]
Normalized transition count is 10 out of 11 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 10 rows 6 cols 20 entries
Finished phase 1 with 5 SingleSign rule and 0 generalized
[2026-05-23 21:01:59] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5159689149231682087.kers
Total runtime 0 ms.
[2026-05-23 21:01:59] [INFO ] Implicit Places using invariants in 18 ms returned []
[2026-05-23 21:01:59] [INFO ] Invariant cache hit.
[2026-05-23 21:01:59] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2026-05-23 21:01:59] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2026-05-23 21:01:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 1/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 10/16 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/16 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/17 variables, and 7 constraints, problems are : Problem set: 0 solved, 5 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 1/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 10/16 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/16 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/17 variables, and 12 constraints, problems are : Problem set: 0 solved, 5 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 98ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 98ms
Starting structural reductions in SI_CTL mode, iteration 1 : 6/400 places, 11/2964 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 151 ms. Remains : 6/400 places, 11/2964 transitions.
[2026-05-23 21:01:59] [INFO ] Flatten gal took : 0 ms
[2026-05-23 21:01:59] [INFO ] Flatten gal took : 0 ms
[2026-05-23 21:01:59] [INFO ] Input system was already deterministic with 11 transitions.
[2026-05-23 21:01:59] [INFO ] Flatten gal took : 0 ms
[2026-05-23 21:01:59] [INFO ] Flatten gal took : 3 ms
[2026-05-23 21:01:59] [INFO ] Time to serialize gal into /tmp/CTLFireability1262316282395957926.gal : 0 ms
[2026-05-23 21:01:59] [INFO ] Time to serialize properties into /tmp/CTLFireability14308489182652758424.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/CTLFireability1262316282395957926.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14308489182652758424.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,3003,0.007061,3936,2,57,5,895,6,0,37,778,0
Converting to forward existential form...Done !
original formula: E(!(A(!(AF((cAMP__5_19_>=1))) U EF((E((cAMP__14_20_>=1) U (cAMP__17_19_>=1)) * EG((cAMP__13_8_>=1)))))) U (cAMP__9_19_>=1))
=> equivalent forward existential formula: [(FwdU(Init,!(!((E(!(E(TRUE U (E((cAMP__14_20_>=1) U (cAMP__17_19_>=1)) * EG((cAMP__13_8_>=1))))) U (!(!(!(EG(!(...378
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 9/0/2
(forward)formula 0,0,0.019741,4652,1,0,12,2318,42,2,213,2257,16
FORMULA Diffusion2D-PT-D20N010-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 2964/2964 transitions.
Applied a total of 0 rules in 10 ms. Remains 400 /400 variables (removed 0) and now considering 2964/2964 (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-12945034204158606587.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3268043282059144398.kers'
[2026-05-23 21:01:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12945034204158606587.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3268043282059144398.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2964 rows 400 cols 5928 entries
Finished phase 1 with 399 SingleSign rule and 0 generalized
[2026-05-23 21:01:59] [INFO ] Computed 1 invariants in 15 ms
Computed 1 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-3268043282059144398.kers
Total runtime 18 ms.
[2026-05-23 21:01:59] [INFO ] Implicit Places using invariants in 75 ms returned []
[2026-05-23 21:01:59] [INFO ] Invariant cache hit.
[2026-05-23 21:02:00] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 494 ms to find 0 implicit places.
Running 2956 sub problems to find dead transitions.
[2026-05-23 21:02:00] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 399/3364 variables, and 0 constraints, problems are : Problem set: 0 solved, 2956 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/400 constraints, PredecessorRefiner: 2956/2956 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2956 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 399/3364 variables, and 0 constraints, problems are : Problem set: 0 solved, 2956 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/400 constraints, PredecessorRefiner: 0/2956 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60913ms problems are : Problem set: 0 solved, 2956 unsolved
Search for dead transitions found 0 dead transitions in 60919ms
Finished structural reductions in LTL mode , in 1 iterations and 61433 ms. Remains : 400/400 places, 2964/2964 transitions.
[2026-05-23 21:03:01] [INFO ] Flatten gal took : 42 ms
[2026-05-23 21:03:01] [INFO ] Flatten gal took : 22 ms
[2026-05-23 21:03:01] [INFO ] Input system was already deterministic with 2964 transitions.
[2026-05-23 21:03:01] [INFO ] Flatten gal took : 22 ms
[2026-05-23 21:03:01] [INFO ] Flatten gal took : 23 ms
[2026-05-23 21:03:01] [INFO ] Time to serialize gal into /tmp/CTLFireability9407157335708557348.gal : 7 ms
[2026-05-23 21:03:01] [INFO ] Time to serialize properties into /tmp/CTLFireability1704052543606147614.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/CTLFireability9407157335708557348.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1704052543606147614.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.23082e+19,2.69269,54780,2,4391,5,252979,6,0,4567,241710,0
Converting to forward existential form...Done !
original formula: E((EG(!(EG((cAMP__19_18_>=1)))) * (cAMP__4_18_>=1)) U EF(EG(EX(((cAMP__9_18_>=1)||(cAMP__8_16_>=1))))))
=> equivalent forward existential formula: [FwdG(FwdU(FwdU(Init,(EG(!(EG((cAMP__19_18_>=1)))) * (cAMP__4_18_>=1))),TRUE),EX(((cAMP__9_18_>=1)||(cAMP__8_16_...172
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,1,13.3064,243140,1,0,13,1.30267e+06,34,5,21286,530420,19
FORMULA Diffusion2D-PT-D20N010-CTLFireability-2024-08 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 : 400/400 places, 2964/2964 transitions.
Graph (trivial) has 2790 edges and 400 vertex of which 388 / 400 are part of one of the 1 SCC in 11 ms
Free SCC test removed 387 places
Ensure Unique test removed 2939 transitions
Reduce isomorphic transitions removed 2939 transitions.
Applied a total of 1 rules in 16 ms. Remains 13 /400 variables (removed 387) and now considering 25/2964 (removed 2939) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8886090621523059349.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1080083917339454497.kers'
[2026-05-23 21:03:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8886090621523059349.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1080083917339454497.kers]
Normalized transition count is 24 out of 25 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 24 rows 13 cols 48 entries
Finished phase 1 with 12 SingleSign rule and 0 generalized
[2026-05-23 21:03:14] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1080083917339454497.kers
Total runtime 0 ms.
[2026-05-23 21:03:14] [INFO ] Implicit Places using invariants in 29 ms returned []
[2026-05-23 21:03:14] [INFO ] Invariant cache hit.
[2026-05-23 21:03:14] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2026-05-23 21:03:14] [INFO ] Redundant transitions in 0 ms returned []
Running 12 sub problems to find dead transitions.
[2026-05-23 21:03:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 1/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 24/37 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 0/37 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 37/38 variables, and 14 constraints, problems are : Problem set: 0 solved, 12 unsolved in 101 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 1/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 24/37 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 0/37 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 37/38 variables, and 26 constraints, problems are : Problem set: 0 solved, 12 unsolved in 97 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 199ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 199ms
Starting structural reductions in SI_CTL mode, iteration 1 : 13/400 places, 25/2964 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 274 ms. Remains : 13/400 places, 25/2964 transitions.
[2026-05-23 21:03:15] [INFO ] Flatten gal took : 0 ms
[2026-05-23 21:03:15] [INFO ] Flatten gal took : 0 ms
[2026-05-23 21:03:15] [INFO ] Input system was already deterministic with 25 transitions.
[2026-05-23 21:03:15] [INFO ] Flatten gal took : 0 ms
[2026-05-23 21:03:15] [INFO ] Flatten gal took : 1 ms
[2026-05-23 21:03:15] [INFO ] Time to serialize gal into /tmp/CTLFireability5857196646263858734.gal : 1 ms
[2026-05-23 21:03:15] [INFO ] Time to serialize properties into /tmp/CTLFireability14095898000474587958.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/CTLFireability5857196646263858734.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14095898000474587958.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,646646,0.01995,4188,2,134,5,2383,6,0,79,2003,0
Converting to forward existential form...Done !
original formula: A((cAMP__10_14_>=1) U EF((!((EG((cAMP__8_13_>=1)) + (((cAMP__10_16_>=1)&&(cAMP__4_9_>=1))&&(cAMP__1_5_>=1)))) * (((AG((cAMP__16_3_>=1)) +...279
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U (!((EG((cAMP__8_13_>=1)) + (((cAMP__10_16_>=1)&&(cAMP__4_9_>=1))&&(cAMP__1_5_>=1)))) *...1069
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 23/0/2
(forward)formula 0,1,0.101281,7280,1,0,20,19561,48,8,460,16555,20
FORMULA Diffusion2D-PT-D20N010-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 2964/2964 transitions.
Applied a total of 0 rules in 21 ms. Remains 400 /400 variables (removed 0) and now considering 2964/2964 (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-12492966502799763449.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17485403382788918175.kers'
[2026-05-23 21:03:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12492966502799763449.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17485403382788918175.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 2964 rows 400 cols 5928 entries
Finished phase 1 with 399 SingleSign rule and 0 generalized
[2026-05-23 21:03:15] [INFO ] Computed 1 invariants in 16 ms
Computed 1 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-17485403382788918175.kers
Total runtime 22 ms.
[2026-05-23 21:03:15] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-05-23 21:03:15] [INFO ] Invariant cache hit.
[2026-05-23 21:03:15] [INFO ] Implicit Places using invariants and state equation in 469 ms returned []
Implicit Place search using SMT with State Equation took 561 ms to find 0 implicit places.
Running 2956 sub problems to find dead transitions.
[2026-05-23 21:03:15] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 399/3364 variables, and 0 constraints, problems are : Problem set: 0 solved, 2956 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/400 constraints, PredecessorRefiner: 2956/2956 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2956 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 399/3364 variables, and 0 constraints, problems are : Problem set: 0 solved, 2956 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/400 constraints, PredecessorRefiner: 0/2956 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60952ms problems are : Problem set: 0 solved, 2956 unsolved
Search for dead transitions found 0 dead transitions in 60955ms
Finished structural reductions in LTL mode , in 1 iterations and 61544 ms. Remains : 400/400 places, 2964/2964 transitions.
[2026-05-23 21:04:16] [INFO ] Flatten gal took : 25 ms
[2026-05-23 21:04:16] [INFO ] Flatten gal took : 22 ms
[2026-05-23 21:04:16] [INFO ] Input system was already deterministic with 2964 transitions.
[2026-05-23 21:04:16] [INFO ] Flatten gal took : 23 ms
[2026-05-23 21:04:16] [INFO ] Flatten gal took : 23 ms
[2026-05-23 21:04:17] [INFO ] Time to serialize gal into /tmp/CTLFireability7326259197793238970.gal : 7 ms
[2026-05-23 21:04:17] [INFO ] Time to serialize properties into /tmp/CTLFireability1186595798789707182.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/CTLFireability7326259197793238970.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1186595798789707182.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.23082e+19,2.54669,54744,2,4391,5,252979,6,0,4567,241710,0
Converting to forward existential form...Done !
original formula: E((cAMP__2_7_<1) U AG(AX(A(((cAMP__12_19_>=1)||(cAMP__11_13_>=1)) U (cAMP__10_6_<1)))))
=> equivalent forward existential formula: [(FwdU(Init,(cAMP__2_7_<1)) * !(E(TRUE U !(!(EX(!(!((E(!((cAMP__10_6_<1)) U (!(((cAMP__12_19_>=1)||(cAMP__11_13_...228
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 2948/0/16
(forward)formula 0,0,14.2292,259884,1,0,8,1.37524e+06,28,0,21097,599849,12
FORMULA Diffusion2D-PT-D20N010-CTLFireability-2024-10 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 : 400/400 places, 2964/2964 transitions.
Graph (trivial) has 2900 edges and 400 vertex of which 396 / 400 are part of one of the 1 SCC in 8 ms
Free SCC test removed 395 places
Ensure Unique test removed 2955 transitions
Reduce isomorphic transitions removed 2955 transitions.
Applied a total of 1 rules in 17 ms. Remains 5 /400 variables (removed 395) and now considering 9/2964 (removed 2955) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5364105867165191650.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-510182306460952747.kers'
[2026-05-23 21:04:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5364105867165191650.kers, --Pflows, --basisKERS=/tmp/petrispot-output-510182306460952747.kers]
Normalized transition count is 8 out of 9 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 8 rows 5 cols 16 entries
Finished phase 1 with 4 SingleSign rule and 0 generalized
[2026-05-23 21:04:31] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-510182306460952747.kers
Total runtime 0 ms.
[2026-05-23 21:04:31] [INFO ] Implicit Places using invariants in 31 ms returned []
[2026-05-23 21:04:31] [INFO ] Invariant cache hit.
[2026-05-23 21:04:31] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2026-05-23 21:04:31] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2026-05-23 21:04:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/13 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/14 variables, and 6 constraints, problems are : Problem set: 0 solved, 4 unsolved in 44 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/14 variables, and 10 constraints, problems are : Problem set: 0 solved, 4 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 90ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 90ms
Starting structural reductions in SI_CTL mode, iteration 1 : 5/400 places, 9/2964 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 166 ms. Remains : 5/400 places, 9/2964 transitions.
[2026-05-23 21:04:31] [INFO ] Flatten gal took : 0 ms
[2026-05-23 21:04:31] [INFO ] Flatten gal took : 1 ms
[2026-05-23 21:04:31] [INFO ] Input system was already deterministic with 9 transitions.
[2026-05-23 21:04:31] [INFO ] Flatten gal took : 1 ms
[2026-05-23 21:04:31] [INFO ] Flatten gal took : 0 ms
[2026-05-23 21:04:31] [INFO ] Time to serialize gal into /tmp/CTLFireability1947914201306425917.gal : 1 ms
[2026-05-23 21:04:31] [INFO ] Time to serialize properties into /tmp/CTLFireability17379033308182825613.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/CTLFireability1947914201306425917.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17379033308182825613.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,1001,0.011692,3892,2,46,5,691,6,0,31,603,0
Converting to forward existential form...Done !
original formula: AG(EF(((cAMP__13_6_<1) + (E((cAMP__2_12_>=1) U (cAMP__6_5_>=1)) * (cAMP__13_10_<1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((cAMP__13_6_<1) + (E((cAMP__2_12_>=1) U (cAMP__6_5_>=1)) * (cAMP__13_10_<1))))))...164
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 7/0/2
(forward)formula 0,1,0.022385,4176,1,0,12,1870,23,2,172,1913,10
FORMULA Diffusion2D-PT-D20N010-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 2964/2964 transitions.
Applied a total of 0 rules in 12 ms. Remains 400 /400 variables (removed 0) and now considering 2964/2964 (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-1145431105610264219.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15172700063715912968.kers'
[2026-05-23 21:04:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1145431105610264219.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15172700063715912968.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 2964 rows 400 cols 5928 entries
Finished phase 1 with 399 SingleSign rule and 0 generalized
[2026-05-23 21:04:31] [INFO ] Computed 1 invariants in 19 ms
Computed 1 P flows in 19 ms.
Exported basis to /tmp/petrispot-output-15172700063715912968.kers
Total runtime 23 ms.
[2026-05-23 21:04:31] [INFO ] Implicit Places using invariants in 103 ms returned []
[2026-05-23 21:04:31] [INFO ] Invariant cache hit.
[2026-05-23 21:04:32] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 567 ms to find 0 implicit places.
Running 2956 sub problems to find dead transitions.
[2026-05-23 21:04:32] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 399/3364 variables, and 0 constraints, problems are : Problem set: 0 solved, 2956 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/400 constraints, PredecessorRefiner: 2956/2956 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2956 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 399/3364 variables, and 0 constraints, problems are : Problem set: 0 solved, 2956 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/400 constraints, PredecessorRefiner: 0/2956 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60934ms problems are : Problem set: 0 solved, 2956 unsolved
Search for dead transitions found 0 dead transitions in 60937ms
Finished structural reductions in LTL mode , in 1 iterations and 61531 ms. Remains : 400/400 places, 2964/2964 transitions.
[2026-05-23 21:05:33] [INFO ] Flatten gal took : 23 ms
[2026-05-23 21:05:33] [INFO ] Flatten gal took : 22 ms
[2026-05-23 21:05:33] [INFO ] Input system was already deterministic with 2964 transitions.
[2026-05-23 21:05:33] [INFO ] Flatten gal took : 26 ms
[2026-05-23 21:05:33] [INFO ] Flatten gal took : 23 ms
[2026-05-23 21:05:33] [INFO ] Time to serialize gal into /tmp/CTLFireability12159959362980925624.gal : 7 ms
[2026-05-23 21:05:33] [INFO ] Time to serialize properties into /tmp/CTLFireability12639827673466127535.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/CTLFireability12159959362980925624.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12639827673466127535.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,3.23082e+19,2.67187,54752,2,4391,5,252979,6,0,4567,241710,0
Converting to forward existential form...Done !
original formula: AG(((((cAMP__14_14_>=1) + !(E((cAMP__19_15_<1) U A((cAMP__11_12_>=1) U (cAMP__16_20_>=1))))) + ((cAMP__19_9_>=1) + AX((cAMP__8_11_>=1))))...181
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !((((cAMP__14_14_>=1) + !(E((cAMP__19_15_<1) U !((E(!((cAMP__16_20_>=1)) U (!((cAMP__1...314
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 2954/0/10
Hit Full ! (commute/partial/dont) 2948/0/16
(forward)formula 0,0,14.7897,265008,1,0,23,1.42326e+06,38,10,21533,580883,19
FORMULA Diffusion2D-PT-D20N010-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 400/400 places, 2964/2964 transitions.
Graph (trivial) has 2948 edges and 400 vertex of which 399 / 400 are part of one of the 1 SCC in 2 ms
Free SCC test removed 398 places
Ensure Unique test removed 2961 transitions
Reduce isomorphic transitions removed 2961 transitions.
Applied a total of 1 rules in 6 ms. Remains 2 /400 variables (removed 398) and now considering 3/2964 (removed 2961) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10925850930500739721.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-557398110062480461.kers'
[2026-05-23 21:05:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10925850930500739721.kers, --Pflows, --basisKERS=/tmp/petrispot-output-557398110062480461.kers]
Normalized transition count is 2 out of 3 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 2 rows 1 cols 2 entries
Finished phase 1 with 1 SingleSign rule and 0 generalized
[2026-05-23 21:05:48] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-557398110062480461.kers
Total runtime 1 ms.
[2026-05-23 21:05:48] [INFO ] Implicit Places using invariants in 28 ms returned []
[2026-05-23 21:05:48] [INFO ] Invariant cache hit.
[2026-05-23 21:05:48] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2026-05-23 21:05:48] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2026-05-23 21:05:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 33 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 4 constraints, problems are : Problem set: 0 solved, 1 unsolved in 23 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 58ms
Starting structural reductions in SI_CTL mode, iteration 1 : 2/400 places, 3/2964 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 121 ms. Remains : 2/400 places, 3/2964 transitions.
[2026-05-23 21:05:48] [INFO ] Flatten gal took : 1 ms
[2026-05-23 21:05:48] [INFO ] Flatten gal took : 0 ms
[2026-05-23 21:05:48] [INFO ] Input system was already deterministic with 3 transitions.
[2026-05-23 21:05:48] [INFO ] Flatten gal took : 0 ms
[2026-05-23 21:05:48] [INFO ] Flatten gal took : 0 ms
[2026-05-23 21:05:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13575420909471101695.gal : 0 ms
[2026-05-23 21:05:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4920342257976299158.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13575420909471101695.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4920342257976299158.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
FORMULA Diffusion2D-PT-D20N010-CTLFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 2964/2964 transitions.
Applied a total of 0 rules in 9 ms. Remains 400 /400 variables (removed 0) and now considering 2964/2964 (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-7845387811682095230.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5355466667899568467.kers'
[2026-05-23 21:05:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7845387811682095230.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5355466667899568467.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2964 rows 400 cols 5928 entries
Finished phase 1 with 399 SingleSign rule and 0 generalized
[2026-05-23 21:05:48] [INFO ] Computed 1 invariants in 10 ms
Computed 1 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-5355466667899568467.kers
Total runtime 13 ms.
[2026-05-23 21:05:48] [INFO ] Implicit Places using invariants in 81 ms returned []
[2026-05-23 21:05:48] [INFO ] Invariant cache hit.
[2026-05-23 21:05:48] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 534 ms to find 0 implicit places.
Running 2956 sub problems to find dead transitions.
[2026-05-23 21:05:48] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 399/3364 variables, and 0 constraints, problems are : Problem set: 0 solved, 2956 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/400 constraints, PredecessorRefiner: 2956/2956 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2956 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 399/3364 variables, and 0 constraints, problems are : Problem set: 0 solved, 2956 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/400 constraints, PredecessorRefiner: 0/2956 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60923ms problems are : Problem set: 0 solved, 2956 unsolved
Search for dead transitions found 0 dead transitions in 60927ms
Finished structural reductions in LTL mode , in 1 iterations and 61477 ms. Remains : 400/400 places, 2964/2964 transitions.
[2026-05-23 21:06:49] [INFO ] Flatten gal took : 21 ms
[2026-05-23 21:06:49] [INFO ] Flatten gal took : 22 ms
[2026-05-23 21:06:49] [INFO ] Input system was already deterministic with 2964 transitions.
[2026-05-23 21:06:49] [INFO ] Flatten gal took : 21 ms
[2026-05-23 21:06:49] [INFO ] Flatten gal took : 22 ms
[2026-05-23 21:06:49] [INFO ] Time to serialize gal into /tmp/CTLFireability17296553611918503279.gal : 7 ms
[2026-05-23 21:06:49] [INFO ] Time to serialize properties into /tmp/CTLFireability7202344499747783327.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/CTLFireability17296553611918503279.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7202344499747783327.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.23082e+19,2.49465,54768,2,4391,5,252979,6,0,4567,241710,0
Converting to forward existential form...Done !
original formula: EX(EF((EX((cAMP__4_9_>=1)) * (AX((cAMP__9_7_>=1)) + EG((cAMP__11_3_>=1))))))
=> equivalent forward existential formula: ([((FwdU(EY(Init),TRUE) * EX((cAMP__4_9_>=1))) * !(EX(!((cAMP__9_7_>=1)))))] != FALSE + [FwdG((FwdU(EY(Init),TRU...209
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,13.6638,276324,1,0,12,1.5248e+06,13,3,20485,691102,9
FORMULA Diffusion2D-PT-D20N010-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 : 400/400 places, 2964/2964 transitions.
Applied a total of 0 rules in 11 ms. Remains 400 /400 variables (removed 0) and now considering 2964/2964 (removed 0) transitions.
[2026-05-23 21:07:03] [INFO ] Invariant cache hit.
[2026-05-23 21:07:03] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-23 21:07:03] [INFO ] Invariant cache hit.
[2026-05-23 21:07:04] [INFO ] Implicit Places using invariants and state equation in 471 ms returned []
Implicit Place search using SMT with State Equation took 561 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 573 ms. Remains : 400/400 places, 2964/2964 transitions.
[2026-05-23 21:07:04] [INFO ] Flatten gal took : 32 ms
[2026-05-23 21:07:04] [INFO ] Flatten gal took : 23 ms
[2026-05-23 21:07:04] [INFO ] Input system was already deterministic with 2964 transitions.
[2026-05-23 21:07:04] [INFO ] Flatten gal took : 22 ms
[2026-05-23 21:07:04] [INFO ] Flatten gal took : 38 ms
[2026-05-23 21:07:04] [INFO ] Time to serialize gal into /tmp/CTLFireability12812060049077015360.gal : 7 ms
[2026-05-23 21:07:04] [INFO ] Time to serialize properties into /tmp/CTLFireability13917843607011330800.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/CTLFireability12812060049077015360.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13917843607011330800.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,3.23082e+19,2.45968,54784,2,4391,5,252979,6,0,4567,241710,0
Converting to forward existential form...Done !
original formula: E(E(EF(AG((cAMP__5_14_>=1))) U (((cAMP__2_9_>=1) + AF(AG((cAMP__16_19_>=1)))) * (!((((cAMP__15_8_>=1)||(cAMP__3_4_>=1))||(cAMP__1_15_>=1)...240
=> equivalent forward existential formula: [FwdG(FwdU(Init,E(E(TRUE U !(E(TRUE U !((cAMP__5_14_>=1))))) U (((cAMP__2_9_>=1) + !(EG(!(!(E(TRUE U !((cAMP__16...332
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,0,19.5327,432028,1,0,20,2.43536e+06,55,8,21299,1.64037e+06,26
FORMULA Diffusion2D-PT-D20N010-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
[2026-05-23 21:07:24] [INFO ] Flatten gal took : 21 ms
[2026-05-23 21:07:24] [INFO ] Flatten gal took : 32 ms
Total runtime 531957 ms.
BK_STOP 1779570444235
--------------------
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="Diffusion2D-PT-D20N010"
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 Diffusion2D-PT-D20N010, 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 r098-tall-177955695400106"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Diffusion2D-PT-D20N010.tgz
mv Diffusion2D-PT-D20N010 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;