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.r162-smll-177961107800242.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 Kanban-PT-00010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r162-smll-177961107800242
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 372K
-rw-r--r-- 1 mcc users 7.1K Mar 7 16:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Mar 7 16:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Mar 7 16:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 7 16:49 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 3.5K Mar 15 11:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 11:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 11:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 11:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.4K Mar 7 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 59K Mar 7 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Mar 7 16:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 7 16:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 14K 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 Kanban-PT-00010-CTLFireability-2024-00
FORMULA_NAME Kanban-PT-00010-CTLFireability-2024-01
FORMULA_NAME Kanban-PT-00010-CTLFireability-2024-02
FORMULA_NAME Kanban-PT-00010-CTLFireability-2024-03
FORMULA_NAME Kanban-PT-00010-CTLFireability-2024-04
FORMULA_NAME Kanban-PT-00010-CTLFireability-2024-05
FORMULA_NAME Kanban-PT-00010-CTLFireability-2024-06
FORMULA_NAME Kanban-PT-00010-CTLFireability-2024-07
FORMULA_NAME Kanban-PT-00010-CTLFireability-2024-08
FORMULA_NAME Kanban-PT-00010-CTLFireability-2024-09
FORMULA_NAME Kanban-PT-00010-CTLFireability-2024-10
FORMULA_NAME Kanban-PT-00010-CTLFireability-2024-11
FORMULA_NAME Kanban-PT-00010-CTLFireability-2024-12
FORMULA_NAME Kanban-PT-00010-CTLFireability-2024-13
FORMULA_NAME Kanban-PT-00010-CTLFireability-2024-14
FORMULA_NAME Kanban-PT-00010-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779795518119

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Kanban-PT-00010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-26 11:38:39] [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-26 11:38:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 11:38:40] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2026-05-26 11:38:40] [INFO ] Transformed 16 places.
[2026-05-26 11:38:40] [INFO ] Transformed 16 transitions.
[2026-05-26 11:38:40] [INFO ] Parsed PT model containing 16 places and 16 transitions and 40 arcs in 291 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 28 ms.
Initial state reduction rules removed 2 formulas.
FORMULA Kanban-PT-00010-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-00010-CTLFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Applied a total of 0 rules in 11 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (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-39468931911134387.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11611329746559459338.kers'
[2026-05-26 11:38:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-39468931911134387.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11611329746559459338.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 16 rows 15 cols 38 entries
Finished phase 1 with 11 SingleSign rule and 0 generalized
[2026-05-26 11:38:40] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11611329746559459338.kers
Total runtime 1 ms.
[2026-05-26 11:38:40] [INFO ] Implicit Places using invariants in 236 ms returned []
[2026-05-26 11:38:40] [INFO ] Invariant cache hit.
[2026-05-26 11:38:40] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
Running 15 sub problems to find dead transitions.
[2026-05-26 11:38:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 1/16 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 16/32 variables, 16/21 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/32 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 32/32 variables, and 21 constraints, problems are : Problem set: 0 solved, 15 unsolved in 529 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 16/16 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/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 1/16 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 16/32 variables, 16/21 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 15/36 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/32 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 0/32 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 32/32 variables, and 36 constraints, problems are : Problem set: 0 solved, 15 unsolved in 351 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 916ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 937ms
Finished structural reductions in LTL mode , in 1 iterations and 1376 ms. Remains : 16/16 places, 16/16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Applied a total of 0 rules in 2 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2026-05-26 11:38:41] [INFO ] Invariant cache hit.
[2026-05-26 11:38:41] [INFO ] Implicit Places using invariants in 27 ms returned []
[2026-05-26 11:38:41] [INFO ] Invariant cache hit.
[2026-05-26 11:38:41] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 67 ms. Remains : 16/16 places, 16/16 transitions.
Support contains 16 out of 16 places after structural reductions.
[2026-05-26 11:38:42] [INFO ] Flatten gal took : 22 ms
[2026-05-26 11:38:42] [INFO ] Flatten gal took : 7 ms
[2026-05-26 11:38:42] [INFO ] Input system was already deterministic with 16 transitions.
RANDOM walk for 40016 steps (8 resets) in 350 ms. (114 steps per ms) remains 1/26 properties
BEST_FIRST walk for 40004 steps (8 resets) in 240 ms. (165 steps per ms) remains 1/1 properties
[2026-05-26 11:38:42] [INFO ] Invariant cache hit.
Problem AtomicPropp14 is UNSAT
After SMT solving in domain Real declared 2/32 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 33 ms.
Refiners :[Positive P Invariants (semi-flows): 0/4 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/16 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2026-05-26 11:38:42] [INFO ] Flatten gal took : 4 ms
[2026-05-26 11:38:42] [INFO ] Flatten gal took : 4 ms
[2026-05-26 11:38:42] [INFO ] Input system was already deterministic with 16 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 11 edges and 16 vertex of which 6 / 16 are part of one of the 3 SCC in 3 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Ensure Unique test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 11 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 10 transition count 11
Applied a total of 5 rules in 42 ms. Remains 10 /16 variables (removed 6) and now considering 11/16 (removed 5) transitions.
[2026-05-26 11:38:42] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7421774884660554168.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-664042437130810414.kers'
[2026-05-26 11:38:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7421774884660554168.kers, --Pflows, --basisKERS=/tmp/petrispot-output-664042437130810414.kers]
Normalized transition count is 8 out of 9 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 8 rows 9 cols 20 entries
Finished phase 1 with 6 SingleSign rule and 0 generalized
[2026-05-26 11:38:42] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-664042437130810414.kers
Total runtime 0 ms.
[2026-05-26 11:38:42] [INFO ] Implicit Places using invariants in 34 ms returned []
[2026-05-26 11:38:42] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
[2026-05-26 11:38:42] [INFO ] Invariant cache hit.
[2026-05-26 11:38:42] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2026-05-26 11:38:42] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2026-05-26 11:38:42] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
[2026-05-26 11:38:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1/10 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 8/18 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/18 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/19 variables, and 14 constraints, problems are : Problem set: 0 solved, 9 unsolved in 192 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1/10 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 8/18 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/18 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/19 variables, and 23 constraints, problems are : Problem set: 0 solved, 9 unsolved in 166 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 364ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 365ms
Starting structural reductions in SI_CTL mode, iteration 1 : 10/16 places, 11/16 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 492 ms. Remains : 10/16 places, 11/16 transitions.
[2026-05-26 11:38:42] [INFO ] Flatten gal took : 2 ms
[2026-05-26 11:38:43] [INFO ] Flatten gal took : 4 ms
[2026-05-26 11:38:43] [INFO ] Input system was already deterministic with 11 transitions.
[2026-05-26 11:38:43] [INFO ] Flatten gal took : 2 ms
[2026-05-26 11:38:43] [INFO ] Flatten gal took : 1 ms
[2026-05-26 11:38:43] [INFO ] Time to serialize gal into /tmp/CTLFireability17999626214299950627.gal : 2 ms
[2026-05-26 11:38:43] [INFO ] Time to serialize properties into /tmp/CTLFireability14289658042801520278.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/CTLFireability17999626214299950627.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14289658042801520278.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,367356,0.136259,7156,2,246,5,21345,6,0,51,24434,0


Converting to forward existential form...Done !
original formula: EF(AG((Pm1>=1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((Pm1>=1)))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.149285,7428,1,0,6,21345,15,0,310,24434,5
FORMULA Kanban-PT-00010-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 2 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13042508324075571401.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1525630091175027996.kers'
[2026-05-26 11:38:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13042508324075571401.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1525630091175027996.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 15 rows 14 cols 36 entries
Finished phase 1 with 10 SingleSign rule and 0 generalized
[2026-05-26 11:38:43] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1525630091175027996.kers
Total runtime 0 ms.
[2026-05-26 11:38:43] [INFO ] Implicit Places using invariants in 39 ms returned []
[2026-05-26 11:38:43] [INFO ] Invariant cache hit.
[2026-05-26 11:38:43] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Running 14 sub problems to find dead transitions.
[2026-05-26 11:38:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 1/14 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 15/29 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 0/29 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 29/29 variables, and 18 constraints, problems are : Problem set: 0 solved, 14 unsolved in 297 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 14/14 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 1/14 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 15/29 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 14/32 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 0/29 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 29/29 variables, and 32 constraints, problems are : Problem set: 0 solved, 14 unsolved in 241 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 14/14 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 544ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 545ms
Starting structural reductions in LTL mode, iteration 1 : 14/16 places, 15/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 622 ms. Remains : 14/16 places, 15/16 transitions.
[2026-05-26 11:38:43] [INFO ] Flatten gal took : 4 ms
[2026-05-26 11:38:43] [INFO ] Flatten gal took : 2 ms
[2026-05-26 11:38:43] [INFO ] Input system was already deterministic with 15 transitions.
[2026-05-26 11:38:43] [INFO ] Flatten gal took : 2 ms
[2026-05-26 11:38:43] [INFO ] Flatten gal took : 2 ms
[2026-05-26 11:38:43] [INFO ] Time to serialize gal into /tmp/CTLFireability17902704596225735987.gal : 1 ms
[2026-05-26 11:38:43] [INFO ] Time to serialize properties into /tmp/CTLFireability4687487044993486798.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/CTLFireability17902704596225735987.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4687487044993486798.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,2.32137e+08,0.102391,6932,2,180,5,20707,6,0,74,22667,0


Converting to forward existential form...Done !
original formula: AG(EF(((AX((Pback2<1)) + EF((((Pout3<1)||(P1<1))||(Pout2<1)))) + ((Pout1<1) * EF((Pm3<1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((!(EX(!((Pback2<1)))) + E(TRUE U (((Pout3<1)||(P1<1))||(Pout2<1)))) + ((Pout1<1)...189
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.131041,7172,1,0,11,20707,18,4,443,22667,13
FORMULA Kanban-PT-00010-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 11 edges and 16 vertex of which 6 / 16 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 11 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 10 transition count 11
Applied a total of 5 rules in 10 ms. Remains 10 /16 variables (removed 6) and now considering 11/16 (removed 5) transitions.
[2026-05-26 11:38:44] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4800329532571767282.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1664978836532905415.kers'
[2026-05-26 11:38:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4800329532571767282.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1664978836532905415.kers]
Normalized transition count is 8 out of 9 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 8 rows 8 cols 18 entries
Finished phase 1 with 6 SingleSign rule and 0 generalized
[2026-05-26 11:38:44] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1664978836532905415.kers
Total runtime 0 ms.
[2026-05-26 11:38:44] [INFO ] Implicit Places using invariants in 30 ms returned []
[2026-05-26 11:38:44] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
[2026-05-26 11:38:44] [INFO ] Invariant cache hit.
[2026-05-26 11:38:44] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2026-05-26 11:38:44] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2026-05-26 11:38:44] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
[2026-05-26 11:38:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1/10 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 8/18 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/18 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/19 variables, and 14 constraints, problems are : Problem set: 0 solved, 9 unsolved in 176 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1/10 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 8/18 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/18 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/19 variables, and 23 constraints, problems are : Problem set: 0 solved, 9 unsolved in 144 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 325ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 325ms
Starting structural reductions in SI_CTL mode, iteration 1 : 10/16 places, 11/16 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 412 ms. Remains : 10/16 places, 11/16 transitions.
[2026-05-26 11:38:44] [INFO ] Flatten gal took : 1 ms
[2026-05-26 11:38:44] [INFO ] Flatten gal took : 1 ms
[2026-05-26 11:38:44] [INFO ] Input system was already deterministic with 11 transitions.
[2026-05-26 11:38:44] [INFO ] Flatten gal took : 1 ms
[2026-05-26 11:38:44] [INFO ] Flatten gal took : 1 ms
[2026-05-26 11:38:44] [INFO ] Time to serialize gal into /tmp/CTLFireability8464501943540724934.gal : 1 ms
[2026-05-26 11:38:44] [INFO ] Time to serialize properties into /tmp/CTLFireability5910379064059079517.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/CTLFireability8464501943540724934.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5910379064059079517.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,294151,0.052754,5416,2,136,5,9024,6,0,51,11406,0


Converting to forward existential form...Done !
original formula: AG(EF((Pm3>=1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (Pm3>=1))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.058482,5680,1,0,6,9024,14,0,305,11406,5
FORMULA Kanban-PT-00010-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 1 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14089540553118288662.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-333038799910113328.kers'
[2026-05-26 11:38:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14089540553118288662.kers, --Pflows, --basisKERS=/tmp/petrispot-output-333038799910113328.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 15 rows 14 cols 36 entries
Finished phase 1 with 10 SingleSign rule and 0 generalized
[2026-05-26 11:38:44] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-333038799910113328.kers
Total runtime 0 ms.
[2026-05-26 11:38:44] [INFO ] Implicit Places using invariants in 30 ms returned []
[2026-05-26 11:38:44] [INFO ] Invariant cache hit.
[2026-05-26 11:38:44] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Running 14 sub problems to find dead transitions.
[2026-05-26 11:38:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 1/14 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 15/29 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 0/29 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 29/29 variables, and 18 constraints, problems are : Problem set: 0 solved, 14 unsolved in 229 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 14/14 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 1/14 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 15/29 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 14/32 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 0/29 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 29/29 variables, and 32 constraints, problems are : Problem set: 0 solved, 14 unsolved in 232 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 14/14 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 466ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 467ms
Starting structural reductions in LTL mode, iteration 1 : 14/16 places, 15/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 538 ms. Remains : 14/16 places, 15/16 transitions.
[2026-05-26 11:38:45] [INFO ] Flatten gal took : 2 ms
[2026-05-26 11:38:45] [INFO ] Flatten gal took : 1 ms
[2026-05-26 11:38:45] [INFO ] Input system was already deterministic with 15 transitions.
[2026-05-26 11:38:45] [INFO ] Flatten gal took : 2 ms
[2026-05-26 11:38:45] [INFO ] Flatten gal took : 2 ms
[2026-05-26 11:38:45] [INFO ] Time to serialize gal into /tmp/CTLFireability4582590287756805384.gal : 1 ms
[2026-05-26 11:38:45] [INFO ] Time to serialize properties into /tmp/CTLFireability4736293984571489133.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/CTLFireability4582590287756805384.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4736293984571489133.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.32137e+08,0.09926,6928,2,180,5,20707,6,0,74,22667,0


Converting to forward existential form...Done !
original formula: EF((A(!(((Pm3>=1)||(Pback1>=1))) U AX((Pm1<1))) * EX((Pm1>=1))))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * !((E(!(!(EX(!((Pm1<1))))) U (!(!(((Pm3>=1)||(Pback1>=1)))) * !(!(EX(!((Pm1<1))))))) + EG...203
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,0,0.135148,7176,1,0,17,20707,19,9,451,22667,16
FORMULA Kanban-PT-00010-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Applied a total of 1 rules in 1 ms. Remains 15 /16 variables (removed 1) and now considering 16/16 (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-9470247966583530771.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17846652844691931327.kers'
[2026-05-26 11:38:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9470247966583530771.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17846652844691931327.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 16 rows 15 cols 38 entries
Finished phase 1 with 11 SingleSign rule and 0 generalized
[2026-05-26 11:38:45] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17846652844691931327.kers
Total runtime 0 ms.
[2026-05-26 11:38:45] [INFO ] Implicit Places using invariants in 34 ms returned []
[2026-05-26 11:38:45] [INFO ] Invariant cache hit.
[2026-05-26 11:38:45] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Running 15 sub problems to find dead transitions.
[2026-05-26 11:38:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 1/15 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 16/31 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/31 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 31/31 variables, and 19 constraints, problems are : Problem set: 0 solved, 15 unsolved in 314 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 15/15 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/14 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 1/15 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 16/31 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 15/34 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/31 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 31/31 variables, and 34 constraints, problems are : Problem set: 0 solved, 15 unsolved in 248 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 571ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 571ms
Starting structural reductions in LTL mode, iteration 1 : 15/16 places, 16/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 649 ms. Remains : 15/16 places, 16/16 transitions.
[2026-05-26 11:38:45] [INFO ] Flatten gal took : 1 ms
[2026-05-26 11:38:45] [INFO ] Flatten gal took : 1 ms
[2026-05-26 11:38:45] [INFO ] Input system was already deterministic with 16 transitions.
[2026-05-26 11:38:45] [INFO ] Flatten gal took : 1 ms
[2026-05-26 11:38:45] [INFO ] Flatten gal took : 1 ms
[2026-05-26 11:38:45] [INFO ] Time to serialize gal into /tmp/CTLFireability4991083627560449630.gal : 1 ms
[2026-05-26 11:38:45] [INFO ] Time to serialize properties into /tmp/CTLFireability9665921424482944322.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/CTLFireability4991083627560449630.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9665921424482944322.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.00593e+09,0.09533,6896,2,191,5,20519,6,0,79,22242,0


Converting to forward existential form...Done !
original formula: EF(((AX((Pm1>=1)) * EG(AF((Pback1<1)))) * (Pback4>=1)))
=> equivalent forward existential formula: [FwdG(((FwdU(Init,TRUE) * (Pback4>=1)) * !(EX(!((Pm1>=1))))),!(EG(!((Pback1<1)))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.17422,7364,1,0,36,20519,26,29,467,27541,37
FORMULA Kanban-PT-00010-CTLFireability-2024-04 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 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Applied a total of 1 rules in 1 ms. Remains 15 /16 variables (removed 1) and now considering 16/16 (removed 0) transitions.
[2026-05-26 11:38:46] [INFO ] Invariant cache hit.
[2026-05-26 11:38:46] [INFO ] Implicit Places using invariants in 22 ms returned []
[2026-05-26 11:38:46] [INFO ] Invariant cache hit.
[2026-05-26 11:38:46] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 15/16 places, 16/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55 ms. Remains : 15/16 places, 16/16 transitions.
[2026-05-26 11:38:46] [INFO ] Flatten gal took : 2 ms
[2026-05-26 11:38:46] [INFO ] Flatten gal took : 1 ms
[2026-05-26 11:38:46] [INFO ] Input system was already deterministic with 16 transitions.
[2026-05-26 11:38:46] [INFO ] Flatten gal took : 1 ms
[2026-05-26 11:38:46] [INFO ] Flatten gal took : 2 ms
[2026-05-26 11:38:46] [INFO ] Time to serialize gal into /tmp/CTLFireability1830734802012516604.gal : 1 ms
[2026-05-26 11:38:46] [INFO ] Time to serialize properties into /tmp/CTLFireability11088331430273685829.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/CTLFireability1830734802012516604.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11088331430273685829.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.00593e+09,0.101303,6904,2,191,5,20519,6,0,79,22242,0


Converting to forward existential form...Done !
original formula: AG(AF(E(AX((Pback2>=1)) U EF(((Pm1>=1)||(Pback4>=1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(E(!(EX(!((Pback2>=1)))) U E(TRUE U ((Pm1>=1)||(Pback4>=1))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.127103,7144,1,0,9,20519,25,3,482,22242,11
FORMULA Kanban-PT-00010-CTLFireability-2024-05 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 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Applied a total of 1 rules in 1 ms. Remains 15 /16 variables (removed 1) and now considering 16/16 (removed 0) transitions.
[2026-05-26 11:38:46] [INFO ] Invariant cache hit.
[2026-05-26 11:38:46] [INFO ] Implicit Places using invariants in 28 ms returned []
[2026-05-26 11:38:46] [INFO ] Invariant cache hit.
[2026-05-26 11:38:46] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 15/16 places, 16/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63 ms. Remains : 15/16 places, 16/16 transitions.
[2026-05-26 11:38:46] [INFO ] Flatten gal took : 1 ms
[2026-05-26 11:38:46] [INFO ] Flatten gal took : 1 ms
[2026-05-26 11:38:46] [INFO ] Input system was already deterministic with 16 transitions.
[2026-05-26 11:38:46] [INFO ] Flatten gal took : 2 ms
[2026-05-26 11:38:46] [INFO ] Flatten gal took : 2 ms
[2026-05-26 11:38:46] [INFO ] Time to serialize gal into /tmp/CTLFireability5863796201281068140.gal : 0 ms
[2026-05-26 11:38:46] [INFO ] Time to serialize properties into /tmp/CTLFireability17925295141949320565.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/CTLFireability5863796201281068140.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17925295141949320565.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.00593e+09,0.158265,6904,2,191,5,20519,6,0,79,22242,0


Converting to forward existential form...Done !
original formula: !(E(!(A(!(AF(!((((Pout3<1)||(P1<1))||(Pout2<1))))) U E(A(!((((Pout3<1)||(P1<1))||(Pout2<1))) U (Pback4>=1)) U (Pm3>=1)))) U !(AX(!((AF((P...190
=> equivalent forward existential formula: [((EY(FwdU(Init,!(!((E(!(E(!((E(!((Pback4>=1)) U (!(!((((Pout3<1)||(P1<1))||(Pout2<1)))) * !((Pback4>=1)))) + EG...552
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 14/0/2
Using saturation style SCC detection
(forward)formula 0,1,0.418633,9264,1,0,64,31903,51,41,522,34910,54
FORMULA Kanban-PT-00010-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (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-4892785714264851476.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11348924405652591754.kers'
[2026-05-26 11:38:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4892785714264851476.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11348924405652591754.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 16 rows 15 cols 38 entries
Finished phase 1 with 11 SingleSign rule and 0 generalized
[2026-05-26 11:38:46] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11348924405652591754.kers
Total runtime 0 ms.
[2026-05-26 11:38:46] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-26 11:38:46] [INFO ] Invariant cache hit.
[2026-05-26 11:38:46] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Running 15 sub problems to find dead transitions.
[2026-05-26 11:38:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 1/16 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 16/32 variables, 16/21 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/32 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 32/32 variables, and 21 constraints, problems are : Problem set: 0 solved, 15 unsolved in 334 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 16/16 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/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 1/16 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 16/32 variables, 16/21 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 15/36 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/32 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 0/32 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 32/32 variables, and 36 constraints, problems are : Problem set: 0 solved, 15 unsolved in 281 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 620ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 620ms
Finished structural reductions in LTL mode , in 1 iterations and 696 ms. Remains : 16/16 places, 16/16 transitions.
[2026-05-26 11:38:47] [INFO ] Flatten gal took : 2 ms
[2026-05-26 11:38:47] [INFO ] Flatten gal took : 3 ms
[2026-05-26 11:38:47] [INFO ] Input system was already deterministic with 16 transitions.
[2026-05-26 11:38:47] [INFO ] Flatten gal took : 2 ms
[2026-05-26 11:38:47] [INFO ] Flatten gal took : 3 ms
[2026-05-26 11:38:47] [INFO ] Time to serialize gal into /tmp/CTLFireability7628723070807320631.gal : 1 ms
[2026-05-26 11:38:47] [INFO ] Time to serialize properties into /tmp/CTLFireability6791555391700774993.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/CTLFireability7628723070807320631.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6791555391700774993.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.00593e+09,0.092263,6564,2,147,5,18532,6,0,83,19562,0


Converting to forward existential form...Done !
original formula: (AF(E((((Pout1<1)&&(!((Pm2>=1)||(Pback1>=1)))) + E(EX((Pm1>=1)) U AG((Pm4>=1)))) U EX(AF((Pback3>=1))))) * EF(((AX(FALSE) * AF(((P4>=1)&&...259
=> equivalent forward existential formula: ([FwdG(Init,!(E((((Pout1<1)&&(!((Pm2>=1)||(Pback1>=1)))) + E(EX((Pm1>=1)) U !(E(TRUE U !((Pm4>=1)))))) U EX(!(EG...407
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 12/0/4
Hit Full ! (commute/partial/dont) 12/8/4
(forward)formula 0,0,0.142815,6812,1,0,15,18532,42,5,563,19562,15
FORMULA Kanban-PT-00010-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Applied a total of 1 rules in 1 ms. Remains 15 /16 variables (removed 1) and now considering 16/16 (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-330944048165386694.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15606790647290350682.kers'
[2026-05-26 11:38:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-330944048165386694.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15606790647290350682.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 16 rows 15 cols 38 entries
Finished phase 1 with 11 SingleSign rule and 0 generalized
[2026-05-26 11:38:47] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-15606790647290350682.kers
Total runtime 7 ms.
[2026-05-26 11:38:47] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-26 11:38:47] [INFO ] Invariant cache hit.
[2026-05-26 11:38:47] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Running 15 sub problems to find dead transitions.
[2026-05-26 11:38:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 1/15 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 16/31 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/31 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 31/31 variables, and 19 constraints, problems are : Problem set: 0 solved, 15 unsolved in 332 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 15/15 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/14 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 1/15 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 16/31 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 15/34 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/31 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 31/31 variables, and 34 constraints, problems are : Problem set: 0 solved, 15 unsolved in 335 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 671ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 672ms
Starting structural reductions in LTL mode, iteration 1 : 15/16 places, 16/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 763 ms. Remains : 15/16 places, 16/16 transitions.
[2026-05-26 11:38:48] [INFO ] Flatten gal took : 2 ms
[2026-05-26 11:38:48] [INFO ] Flatten gal took : 2 ms
[2026-05-26 11:38:48] [INFO ] Input system was already deterministic with 16 transitions.
[2026-05-26 11:38:48] [INFO ] Flatten gal took : 2 ms
[2026-05-26 11:38:48] [INFO ] Flatten gal took : 2 ms
[2026-05-26 11:38:48] [INFO ] Time to serialize gal into /tmp/CTLFireability18413097923240018360.gal : 1 ms
[2026-05-26 11:38:48] [INFO ] Time to serialize properties into /tmp/CTLFireability8020757131118869086.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/CTLFireability18413097923240018360.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8020757131118869086.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.00593e+09,0.155467,6896,2,191,5,20519,6,0,79,22242,0


Converting to forward existential form...Done !
original formula: !(E(E(AF(AX((Pm3>=1))) U ((P4>=1)||(Pm2<1))) U AG((P4>=1))))
=> equivalent forward existential formula: [(FwdU(Init,E(!(EG(!(!(EX(!((Pm3>=1))))))) U ((P4>=1)||(Pm2<1)))) * !(E(TRUE U !((P4>=1)))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.179784,7140,1,0,6,20519,15,0,465,22242,5
FORMULA Kanban-PT-00010-CTLFireability-2024-08 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 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Applied a total of 1 rules in 0 ms. Remains 15 /16 variables (removed 1) and now considering 16/16 (removed 0) transitions.
[2026-05-26 11:38:48] [INFO ] Invariant cache hit.
[2026-05-26 11:38:48] [INFO ] Implicit Places using invariants in 31 ms returned []
[2026-05-26 11:38:48] [INFO ] Invariant cache hit.
[2026-05-26 11:38:48] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 15/16 places, 16/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75 ms. Remains : 15/16 places, 16/16 transitions.
[2026-05-26 11:38:48] [INFO ] Flatten gal took : 2 ms
[2026-05-26 11:38:48] [INFO ] Flatten gal took : 2 ms
[2026-05-26 11:38:48] [INFO ] Input system was already deterministic with 16 transitions.
[2026-05-26 11:38:48] [INFO ] Flatten gal took : 1 ms
[2026-05-26 11:38:48] [INFO ] Flatten gal took : 2 ms
[2026-05-26 11:38:48] [INFO ] Time to serialize gal into /tmp/CTLFireability5462041364192307599.gal : 0 ms
[2026-05-26 11:38:48] [INFO ] Time to serialize properties into /tmp/CTLFireability14894968502156882693.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/CTLFireability5462041364192307599.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14894968502156882693.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.00593e+09,0.155065,6900,2,191,5,20519,6,0,79,22242,0


Converting to forward existential form...Done !
original formula: AG(A((AX(AX((Pm1>=1))) + (!(E((Pm2>=1) U (Pback3>=1))) * (Pm1>=1))) U E(EG((Pm3<1)) U AF(((Pback4>=1)||(Pm3>=1))))))
=> equivalent forward existential formula: ([((FwdU(FwdU(Init,TRUE),!(E(EG((Pm3<1)) U !(EG(!(((Pback4>=1)||(Pm3>=1)))))))) * !((!(EX(!(!(EX(!((Pm1>=1))))))...358
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.255742,7148,1,0,22,20519,33,16,472,22242,24
FORMULA Kanban-PT-00010-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 15 transition count 15
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 15 transition count 15
Applied a total of 2 rules in 1 ms. Remains 15 /16 variables (removed 1) and now considering 15/16 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1628003194523670400.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1479025487888168397.kers'
[2026-05-26 11:38:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1628003194523670400.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1479025487888168397.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 15 rows 14 cols 36 entries
Finished phase 1 with 10 SingleSign rule and 0 generalized
[2026-05-26 11:38:48] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1479025487888168397.kers
Total runtime 0 ms.
[2026-05-26 11:38:48] [INFO ] Implicit Places using invariants in 33 ms returned []
[2026-05-26 11:38:48] [INFO ] Invariant cache hit.
[2026-05-26 11:38:49] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Running 14 sub problems to find dead transitions.
[2026-05-26 11:38:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 1/15 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 15/30 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 0/30 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 20 constraints, problems are : Problem set: 0 solved, 14 unsolved in 210 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 1/15 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 15/30 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 14/34 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 0/30 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 34 constraints, problems are : Problem set: 0 solved, 14 unsolved in 212 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 427ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 428ms
Starting structural reductions in LTL mode, iteration 1 : 15/16 places, 15/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 504 ms. Remains : 15/16 places, 15/16 transitions.
[2026-05-26 11:38:49] [INFO ] Flatten gal took : 1 ms
[2026-05-26 11:38:49] [INFO ] Flatten gal took : 2 ms
[2026-05-26 11:38:49] [INFO ] Input system was already deterministic with 15 transitions.
[2026-05-26 11:38:49] [INFO ] Flatten gal took : 1 ms
[2026-05-26 11:38:49] [INFO ] Flatten gal took : 1 ms
[2026-05-26 11:38:49] [INFO ] Time to serialize gal into /tmp/CTLFireability11834594329288174449.gal : 1 ms
[2026-05-26 11:38:49] [INFO ] Time to serialize properties into /tmp/CTLFireability9313869976364221330.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/CTLFireability11834594329288174449.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9313869976364221330.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,2.32137e+08,0.093955,6592,2,136,5,18720,6,0,78,19987,0


Converting to forward existential form...Done !
original formula: EF(EG(EX(E(E((Pout1>=1) U (((P3>=1)&&(Pout4>=1))&&(P2>=1))) U E((Pm1>=1) U (Pm2>=1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),EX(E(E((Pout1>=1) U (((P3>=1)&&(Pout4>=1))&&(P2>=1))) U E((Pm1>=1) U (Pm2>=1)))))] != FALS...156
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 13/0/2
Hit Full ! (commute/partial/dont) 11/0/4
(forward)formula 0,1,0.148209,6836,1,0,22,18720,34,10,513,19987,27
FORMULA Kanban-PT-00010-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Applied a total of 0 rules in 2 ms. Remains 15 /16 variables (removed 1) and now considering 16/16 (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-4981368260459960134.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14330282986396718483.kers'
[2026-05-26 11:38:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4981368260459960134.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14330282986396718483.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 16 rows 15 cols 38 entries
Finished phase 1 with 11 SingleSign rule and 0 generalized
[2026-05-26 11:38:49] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14330282986396718483.kers
Total runtime 0 ms.
[2026-05-26 11:38:49] [INFO ] Implicit Places using invariants in 31 ms returned []
[2026-05-26 11:38:49] [INFO ] Invariant cache hit.
[2026-05-26 11:38:49] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2026-05-26 11:38:49] [INFO ] Redundant transitions in 1 ms returned []
Running 15 sub problems to find dead transitions.
[2026-05-26 11:38:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 1/15 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 16/31 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/31 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 31/31 variables, and 19 constraints, problems are : Problem set: 0 solved, 15 unsolved in 247 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 15/15 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/14 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 1/15 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 16/31 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 15/34 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/31 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 31/31 variables, and 34 constraints, problems are : Problem set: 0 solved, 15 unsolved in 201 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 452ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 453ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 547 ms. Remains : 15/16 places, 16/16 transitions.
[2026-05-26 11:38:50] [INFO ] Flatten gal took : 2 ms
[2026-05-26 11:38:50] [INFO ] Flatten gal took : 1 ms
[2026-05-26 11:38:50] [INFO ] Input system was already deterministic with 16 transitions.
[2026-05-26 11:38:50] [INFO ] Flatten gal took : 1 ms
[2026-05-26 11:38:50] [INFO ] Flatten gal took : 1 ms
[2026-05-26 11:38:50] [INFO ] Time to serialize gal into /tmp/CTLFireability14958912661041527118.gal : 0 ms
[2026-05-26 11:38:50] [INFO ] Time to serialize properties into /tmp/CTLFireability17082840790981938888.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/CTLFireability14958912661041527118.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17082840790981938888.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.00593e+09,0.095598,6900,2,191,5,20519,6,0,79,22242,0


Converting to forward existential form...Done !
original formula: E((Pm3<1) U E(!(EF(((P4>=1) + E((Pm2>=1) U (Pm3>=1))))) U (EG(EF(!((((Pout3<1)||(P1<1))||(Pout2<1))))) * (((Pback4>=1)||(Pm3<1)) + ((EF((...218
=> equivalent forward existential formula: ([((FwdU(FwdU(Init,(Pm3<1)),!(E(TRUE U ((P4>=1) + E((Pm2>=1) U (Pm3>=1)))))) * EG(E(TRUE U !((((Pout3<1)||(P1<1)...426
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 12/0/4
Hit Full ! (commute/partial/dont) 12/0/4
(forward)formula 0,1,0.129125,7144,1,0,16,20519,39,3,535,22242,22
FORMULA Kanban-PT-00010-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Applied a total of 1 rules in 0 ms. Remains 15 /16 variables (removed 1) and now considering 16/16 (removed 0) transitions.
[2026-05-26 11:38:50] [INFO ] Invariant cache hit.
[2026-05-26 11:38:50] [INFO ] Implicit Places using invariants in 20 ms returned []
[2026-05-26 11:38:50] [INFO ] Invariant cache hit.
[2026-05-26 11:38:50] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 15/16 places, 16/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67 ms. Remains : 15/16 places, 16/16 transitions.
[2026-05-26 11:38:50] [INFO ] Flatten gal took : 1 ms
[2026-05-26 11:38:50] [INFO ] Flatten gal took : 1 ms
[2026-05-26 11:38:50] [INFO ] Input system was already deterministic with 16 transitions.
[2026-05-26 11:38:50] [INFO ] Flatten gal took : 1 ms
[2026-05-26 11:38:50] [INFO ] Flatten gal took : 1 ms
[2026-05-26 11:38:50] [INFO ] Time to serialize gal into /tmp/CTLFireability17549153123617508489.gal : 1 ms
[2026-05-26 11:38:50] [INFO ] Time to serialize properties into /tmp/CTLFireability7426929901442484187.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/CTLFireability17549153123617508489.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7426929901442484187.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.00593e+09,0.094708,6896,2,191,5,20519,6,0,79,22242,0


Converting to forward existential form...Done !
original formula: A((Pm4>=1) U (AX(E((AX((Pback2>=1)) * A((Pback3>=1) U (Pback1>=1))) U !(((Pm4>=1)||(P4>=1))))) * A(((AX((Pback1>=1)) * !((((Pm3>=1)&&(Pou...219
=> equivalent forward existential formula: [((Init * !(EG(!((!(EX(!(E((!(EX(!((Pback2>=1)))) * !((E(!((Pback1>=1)) U (!((Pback3>=1)) * !((Pback1>=1)))) + E...1138
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.127175,7144,1,0,16,20519,25,7,491,22242,17
FORMULA Kanban-PT-00010-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 2 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7076813425628116498.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12956964376182144382.kers'
[2026-05-26 11:38:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7076813425628116498.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12956964376182144382.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 15 rows 14 cols 36 entries
Finished phase 1 with 10 SingleSign rule and 0 generalized
[2026-05-26 11:38:50] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12956964376182144382.kers
Total runtime 0 ms.
[2026-05-26 11:38:50] [INFO ] Implicit Places using invariants in 25 ms returned []
[2026-05-26 11:38:50] [INFO ] Invariant cache hit.
[2026-05-26 11:38:50] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Running 14 sub problems to find dead transitions.
[2026-05-26 11:38:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 1/14 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 15/29 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 0/29 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 29/29 variables, and 18 constraints, problems are : Problem set: 0 solved, 14 unsolved in 209 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 14/14 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 1/14 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 15/29 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 14/32 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 0/29 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 29/29 variables, and 32 constraints, problems are : Problem set: 0 solved, 14 unsolved in 220 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 14/14 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 432ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 433ms
Starting structural reductions in LTL mode, iteration 1 : 14/16 places, 15/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 503 ms. Remains : 14/16 places, 15/16 transitions.
[2026-05-26 11:38:51] [INFO ] Flatten gal took : 1 ms
[2026-05-26 11:38:51] [INFO ] Flatten gal took : 1 ms
[2026-05-26 11:38:51] [INFO ] Input system was already deterministic with 15 transitions.
[2026-05-26 11:38:51] [INFO ] Flatten gal took : 2 ms
[2026-05-26 11:38:51] [INFO ] Flatten gal took : 1 ms
[2026-05-26 11:38:51] [INFO ] Time to serialize gal into /tmp/CTLFireability7930812773213423637.gal : 0 ms
[2026-05-26 11:38:51] [INFO ] Time to serialize properties into /tmp/CTLFireability1324062193029373211.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/CTLFireability7930812773213423637.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1324062193029373211.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.32137e+08,0.16109,6916,2,180,5,20707,6,0,74,22667,0


Converting to forward existential form...Done !
original formula: AX((EG(((Pback1>=1)&&(Pm3>=1))) * (Pm4>=1)))
=> equivalent forward existential formula: ([(EY(Init) * !(EG(((Pback1>=1)&&(Pm3>=1)))))] = FALSE * [(EY(Init) * !((Pm4>=1)))] = FALSE)
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.190252,7164,1,0,10,20707,20,4,438,22667,8
FORMULA Kanban-PT-00010-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2026-05-26 11:38:51] [INFO ] Flatten gal took : 1 ms
[2026-05-26 11:38:51] [INFO ] Flatten gal took : 2 ms
Total runtime 11332 ms.

BK_STOP 1779795531276

--------------------
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="Kanban-PT-00010"
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 Kanban-PT-00010, 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 r162-smll-177961107800242"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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