fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r152-tall-177961077400154
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for GPPP-PT-C0001N0000000001

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
599.680 7543.00 12441.00 666.00 T normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r152-tall-177961077400154.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 GPPP-PT-C0001N0000000001, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r152-tall-177961077400154
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 6.2K Mar 7 11:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Mar 7 11:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Mar 7 11:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Mar 7 11:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 10:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 10:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 15 10:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 15 10:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Mar 7 11:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Mar 7 11:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Mar 7 11:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Mar 7 11:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 17 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 1 Mar 3 18:30 large_marking
-rw-r--r-- 1 mcc users 21K 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

FORMULA_NAME Liveness

=== Now, execution of the tool begins

BK_START 1779700567697

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=GPPP-PT-C0001N0000000001
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
Liveness PT
Running Version 202604301425
[2026-05-25 09:16:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2026-05-25 09:16:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 09:16:08] [INFO ] Load time of PNML (sax parser for PT used): 38 ms
[2026-05-25 09:16:08] [INFO ] Transformed 33 places.
[2026-05-25 09:16:08] [INFO ] Transformed 22 transitions.
[2026-05-25 09:16:08] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 119 ms.
Discarding 1 transitions out of 22. Remains 21
Built sparse matrix representations for Structural reductions in 5 ms.14827KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 33/33 places, 22/22 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 11 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Running 21 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15539241213533045166.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8235935906094380349.kers'
[2026-05-25 09:16:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15539241213533045166.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8235935906094380349.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 22 rows 27 cols 71 entries
Finished phase 1 with 13 SingleSign rule and 7 generalized
[2026-05-25 09:16:09] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8235935906094380349.kers
Total runtime 0 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 46 constraints, problems are : Problem set: 0 solved, 21 unsolved in 482 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 21/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/55 variables, and 67 constraints, problems are : Problem set: 0 solved, 21 unsolved in 1370 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1929ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 1949ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 2012 ms. Remains : 33/33 places, 22/22 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 33/33 places, 22/22 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2026-05-25 09:16:11] [INFO ] Invariant cache hit.
[2026-05-25 09:16:11] [INFO ] Implicit Places using invariants in 34 ms returned []
[2026-05-25 09:16:11] [INFO ] Invariant cache hit.
[2026-05-25 09:16:11] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2026-05-25 09:16:11] [INFO ] Redundant transitions in 0 ms returned []
Skipped dead transition search.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 81 ms. Remains : 33/33 places, 22/22 transitions.
Random walk for 1250000 steps, including 0 resets, run took 919 ms (no deadlock found). (steps per millisecond=1360 )
Random directed walk for 1250000 steps, including 0 resets, run took 663 ms (no deadlock found). (steps per millisecond=1885 )
[2026-05-25 09:16:12] [INFO ] Invariant cache hit.
[2026-05-25 09:16:12] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-25 09:16:12] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 3 ms returned sat
[2026-05-25 09:16:12] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2026-05-25 09:16:12] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:16:13] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-25 09:16:13] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 13 ms returned unsat
Starting structural reductions in LIVENESS mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 32 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 19
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 30 transition count 19
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 place count 27 transition count 17
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 25 transition count 16
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 15 place count 24 transition count 15
Applied a total of 15 rules in 21 ms. Remains 24 /33 variables (removed 9) and now considering 15/22 (removed 7) transitions.
Running 14 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1067453552429123221.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8450391831022229364.kers'
[2026-05-25 09:16:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1067453552429123221.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8450391831022229364.kers]
Normalized transition count is 14 out of 15 initially.
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 14 rows 19 cols 49 entries
Finished phase 1 with 9 SingleSign rule and 4 generalized
[2026-05-25 09:16:13] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8450391831022229364.kers
Total runtime 0 ms.
[2026-05-25 09:16:13] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 1/24 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 14/38 variables, 24/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 1/39 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 0/39 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 36 constraints, problems are : Problem set: 0 solved, 14 unsolved in 204 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 24/24 constraints, ReadFeed: 1/1 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/23 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 1/24 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 14/38 variables, 24/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 14/49 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 1/39 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 0/39 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 50 constraints, problems are : Problem set: 0 solved, 14 unsolved in 848 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 24/24 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1062ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 1062ms
[2026-05-25 09:16:14] [INFO ] Invariant cache hit.
[2026-05-25 09:16:14] [INFO ] Implicit Places using invariants in 36 ms returned [0, 3, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 38 ms to find 3 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 21/33 places, 15/22 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 17 transition count 12
Applied a total of 7 rules in 1 ms. Remains 17 /21 variables (removed 4) and now considering 12/15 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4667922342973980245.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8816311926957223036.kers'
[2026-05-25 09:16:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4667922342973980245.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8816311926957223036.kers]
Normalized transition count is 11 out of 12 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 11 rows 14 cols 38 entries
Finished phase 1 with 7 SingleSign rule and 3 generalized
[2026-05-25 09:16:14] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8816311926957223036.kers
Total runtime 0 ms.
[2026-05-25 09:16:14] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-25 09:16:14] [INFO ] Invariant cache hit.
[2026-05-25 09:16:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 09:16:14] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 17/33 places, 12/22 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 1194 ms. Remains : 17/33 places, 12/22 transitions.
Discarding 1 transitions out of 12. Remains 11
Initial state reduction rules removed 1 formulas.
RANDOM walk for 118 steps (0 resets) in 10 ms. (10 steps per ms) remains 0/10 properties
[2026-05-25 09:16:14] [INFO ] Flatten gal took : 19 ms
[2026-05-25 09:16:15] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:16:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2430924131910773749.gal : 4 ms
[2026-05-25 09:16:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12899299807543558927.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2430924131910773749.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12899299807543558927.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query QuasiLiveness after proving 11 properties.
Starting structural reductions in LIVENESS mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 32 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 19
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 30 transition count 19
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 place count 27 transition count 17
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 25 transition count 16
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 15 place count 24 transition count 15
Applied a total of 15 rules in 4 ms. Remains 24 /33 variables (removed 9) and now considering 15/22 (removed 7) transitions.
Skipped dead transition search.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3745963322638523144.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9159738099109127864.kers'
[2026-05-25 09:16:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3745963322638523144.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9159738099109127864.kers]
Normalized transition count is 14 out of 15 initially.
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 14 rows 19 cols 49 entries
Finished phase 1 with 9 SingleSign rule and 4 generalized
[2026-05-25 09:16:15] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9159738099109127864.kers
Total runtime 0 ms.
[2026-05-25 09:16:15] [INFO ] Implicit Places using invariants in 37 ms returned [0, 3, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 38 ms to find 3 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 21/33 places, 15/22 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 17 transition count 12
Applied a total of 7 rules in 1 ms. Remains 17 /21 variables (removed 4) and now considering 12/15 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-304552212845019592.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12118721106430395793.kers'
[2026-05-25 09:16:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-304552212845019592.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12118721106430395793.kers]
Normalized transition count is 11 out of 12 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 11 rows 14 cols 38 entries
Finished phase 1 with 7 SingleSign rule and 3 generalized
[2026-05-25 09:16:15] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12118721106430395793.kers
Total runtime 0 ms.
[2026-05-25 09:16:15] [INFO ] Implicit Places using invariants in 29 ms returned []
[2026-05-25 09:16:15] [INFO ] Invariant cache hit.
[2026-05-25 09:16:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 09:16:15] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 17/33 places, 12/22 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 110 ms. Remains : 17/33 places, 12/22 transitions.
Discarding 1 transitions out of 12. Remains 11
Net is quasi-live, checking if it is reversible to establish liveness.
[2026-05-25 09:16:15] [INFO ] Flatten gal took : 3 ms
[2026-05-25 09:16:15] [INFO ] Flatten gal took : 2 ms
[2026-05-25 09:16:15] [INFO ] Time to serialize gal into /tmp/CTLFireability1675839911141464390.gal : 1 ms
[2026-05-25 09:16:15] [INFO ] Time to serialize properties into /tmp/CTLFireability12757660731787055689.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/CTLFireability1675839911141464390.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12757660731787055689.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,85,0.013511,3904,2,231,5,708,6,0,86,479,0


Converting to forward existential form...Done !
original formula: AG(EF(((((((ATP==4)&&(Ru5P==0))&&((Xu5P==0)&&(R5P==0)))&&(((S7P==0)&&(E4P==0))&&((F6P==0)&&(G6P==0))))&&((((DHAP==0)&&(Lac==0))&&((Gluc==...224
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((((ATP==4)&&(Ru5P==0))&&((Xu5P==0)&&(R5P==0)))&&(((S7P==0)&&(E4P==0))&&((F6P==...284
Reverse transition relation is NOT exact ! Due to transitions Transketolase2, Intersection with reachable at each step enabled. (destroyed/reverse/interse...175
(forward)formula 0,1,0.027665,4548,1,0,30,2554,42,16,633,1824,35
Formula is TRUE !

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

Able to resolve query Liveness after proving 1 properties.
FORMULA Liveness TRUE TECHNIQUES RANDOM_WALK DECISION_DIAGRAMS TOPOLOGICAL QUASI_LIVE_REVERSIBLE INITIAL_STATE
Total runtime 6399 ms.

BK_STOP 1779700575240

--------------------
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
+ [[ Liveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution Liveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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 Liveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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="GPPP-PT-C0001N0000000001"
export BK_EXAMINATION="Liveness"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 GPPP-PT-C0001N0000000001, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r152-tall-177961077400154"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0001N0000000001.tgz
mv GPPP-PT-C0001N0000000001 execution
cd execution
if [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "UpperBounds" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] || [ "Liveness" = "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 [ "Liveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "Liveness" != "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 "Liveness.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 '' Liveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] ; then
echo "FORMULA_NAME Liveness"
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 ;