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.r146-tall-177961074100286.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-C0001N0000100000, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074100286
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 8.4K Mar 7 11:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Mar 7 11:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 7 11:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 7 11:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Mar 17 09:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 17 09:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 17 09:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 17 09:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 7 11:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Mar 7 11:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Mar 7 11:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Mar 7 11:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 17 09:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 17 09:04 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

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME GPPP-PT-C0001N0000100000-ReachabilityCardinality-2024-00
FORMULA_NAME GPPP-PT-C0001N0000100000-ReachabilityCardinality-2024-01
FORMULA_NAME GPPP-PT-C0001N0000100000-ReachabilityCardinality-2024-02
FORMULA_NAME GPPP-PT-C0001N0000100000-ReachabilityCardinality-2024-03
FORMULA_NAME GPPP-PT-C0001N0000100000-ReachabilityCardinality-2024-04
FORMULA_NAME GPPP-PT-C0001N0000100000-ReachabilityCardinality-2024-05
FORMULA_NAME GPPP-PT-C0001N0000100000-ReachabilityCardinality-2024-06
FORMULA_NAME GPPP-PT-C0001N0000100000-ReachabilityCardinality-2024-07
FORMULA_NAME GPPP-PT-C0001N0000100000-ReachabilityCardinality-2024-08
FORMULA_NAME GPPP-PT-C0001N0000100000-ReachabilityCardinality-2024-09
FORMULA_NAME GPPP-PT-C0001N0000100000-ReachabilityCardinality-2024-10
FORMULA_NAME GPPP-PT-C0001N0000100000-ReachabilityCardinality-2024-11
FORMULA_NAME GPPP-PT-C0001N0000100000-ReachabilityCardinality-2024-12
FORMULA_NAME GPPP-PT-C0001N0000100000-ReachabilityCardinality-2024-13
FORMULA_NAME GPPP-PT-C0001N0000100000-ReachabilityCardinality-2024-14
FORMULA_NAME GPPP-PT-C0001N0000100000-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779710341910

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPPP-PT-C0001N0000100000
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-25 11:59:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 11:59:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 11:59:03] [INFO ] Load time of PNML (sax parser for PT used): 38 ms
[2026-05-25 11:59:03] [INFO ] Transformed 33 places.
[2026-05-25 11:59:03] [INFO ] Transformed 22 transitions.
[2026-05-25 11:59:03] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 119 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
[2026-05-25 11:59:03] [INFO ] Flatten gal took : 34 ms
[2026-05-25 11:59:03] [INFO ] Flatten gal took : 13 ms
[2026-05-25 11:59:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4570598161997982729.gal : 6 ms
[2026-05-25 11:59:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1547701421609911448.prop : 4 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/ReachabilityCardinality4570598161997982729.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1547701421609911448.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality1547701421609911448.prop.
RANDOM walk for 40004 steps (8 resets) in 1274 ms. (31 steps per ms) remains 16/16 properties
An unexpected exception occurred : Overflow error when converting initial marking. Please recompile libDDD with larger DDD::val_t definition.
ITS-tools command line returned an error code 1
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 16/16 properties
[2026-05-25 11:59:03] [INFO ] Flatten gal took : 14 ms
[2026-05-25 11:59:03] [INFO ] Applying decomposition
[2026-05-25 11:59:03] [INFO ] Flatten gal took : 4 ms
BEST_FIRST walk for 4003 steps (8 resets) in 115 ms. (34 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 16/16 properties
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph6238259916180233792.txt' '-o' '/tmp/graph6238259916180233792.bin' '-w' '/tmp/graph6238259916180233792.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6238259916180233792.bin' '-l' '-1' '-v' '-w' '/tmp/graph6238259916180233792.weights' '-q' '0' '-e' '0.001'
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 16/16 properties
[2026-05-25 11:59:03] [INFO ] Decomposing Gal with order
[2026-05-25 11:59:03] [INFO ] Rewriting arrays to variables to allow decomposition.
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 16/16 properties
[2026-05-25 11:59:03] [INFO ] Removed a total of 7 redundant transitions.
BEST_FIRST walk for 4001 steps (8 resets) in 94 ms. (42 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 161 ms. (24 steps per ms) remains 16/16 properties
[2026-05-25 11:59:03] [INFO ] Flatten gal took : 90 ms
[2026-05-25 11:59:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
BEST_FIRST walk for 4003 steps (8 resets) in 152 ms. (26 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 105 ms. (37 steps per ms) remains 16/16 properties
[2026-05-25 11:59:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3677038493473674345.gal : 7 ms
[2026-05-25 11:59:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1012259495230803713.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3677038493473674345.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1012259495230803713.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 16/16 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality1012259495230803713.prop.
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
An unexpected exception occurred : Overflow error when converting initial marking. Please recompile libDDD with larger DDD::val_t definition.
ITS-tools command line returned an error code 1
Interrupted probabilistic random walk after 342059 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :0 out of 16
Probabilistic random walk after 342059 steps, saw 145612 distinct states, run finished after 3006 ms. (steps per millisecond=113 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6435450254999131385.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8882807057560561225.kers'
[2026-05-25 11:59:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6435450254999131385.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8882807057560561225.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 11:59:07] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8882807057560561225.kers
Total runtime 1 ms.
Problem GPPP-PT-C0001N0000100000-ReachabilityCardinality-2024-11 is UNSAT
FORMULA GPPP-PT-C0001N0000100000-ReachabilityCardinality-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C0001N0000100000-ReachabilityCardinality-2024-14 is UNSAT
FORMULA GPPP-PT-C0001N0000100000-ReachabilityCardinality-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 14 unsolved
Problem GPPP-PT-C0001N0000100000-ReachabilityCardinality-2024-00 is UNSAT
FORMULA GPPP-PT-C0001N0000100000-ReachabilityCardinality-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C0001N0000100000-ReachabilityCardinality-2024-01 is UNSAT
FORMULA GPPP-PT-C0001N0000100000-ReachabilityCardinality-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C0001N0000100000-ReachabilityCardinality-2024-02 is UNSAT
FORMULA GPPP-PT-C0001N0000100000-ReachabilityCardinality-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C0001N0000100000-ReachabilityCardinality-2024-03 is UNSAT
FORMULA GPPP-PT-C0001N0000100000-ReachabilityCardinality-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C0001N0000100000-ReachabilityCardinality-2024-05 is UNSAT
FORMULA GPPP-PT-C0001N0000100000-ReachabilityCardinality-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C0001N0000100000-ReachabilityCardinality-2024-06 is UNSAT
FORMULA GPPP-PT-C0001N0000100000-ReachabilityCardinality-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C0001N0000100000-ReachabilityCardinality-2024-07 is UNSAT
FORMULA GPPP-PT-C0001N0000100000-ReachabilityCardinality-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C0001N0000100000-ReachabilityCardinality-2024-08 is UNSAT
FORMULA GPPP-PT-C0001N0000100000-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C0001N0000100000-ReachabilityCardinality-2024-09 is UNSAT
FORMULA GPPP-PT-C0001N0000100000-ReachabilityCardinality-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C0001N0000100000-ReachabilityCardinality-2024-10 is UNSAT
FORMULA GPPP-PT-C0001N0000100000-ReachabilityCardinality-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C0001N0000100000-ReachabilityCardinality-2024-12 is UNSAT
FORMULA GPPP-PT-C0001N0000100000-ReachabilityCardinality-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C0001N0000100000-ReachabilityCardinality-2024-13 is UNSAT
FORMULA GPPP-PT-C0001N0000100000-ReachabilityCardinality-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 6/13 constraints. Problems are: Problem set: 14 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 14 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 14 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/46 constraints. Problems are: Problem set: 14 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/55 variables, 0/46 constraints. Problems are: Problem set: 14 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 46 constraints, problems are : Problem set: 14 solved, 2 unsolved in 275 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 14 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 14 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 14 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 14 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 14 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 14 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/7 variables, 2/5 constraints. Problems are: Problem set: 14 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 1/6 constraints. Problems are: Problem set: 14 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/7 variables, 2/8 constraints. Problems are: Problem set: 14 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/7 variables, 0/8 constraints. Problems are: Problem set: 14 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/15 variables, 4/12 constraints. Problems are: Problem set: 14 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/15 variables, 1/13 constraints. Problems are: Problem set: 14 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/15 variables, 0/13 constraints. Problems are: Problem set: 14 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 12/27 variables, 3/16 constraints. Problems are: Problem set: 14 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/27 variables, 1/17 constraints. Problems are: Problem set: 14 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/27 variables, 0/17 constraints. Problems are: Problem set: 14 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/29 variables, 2/19 constraints. Problems are: Problem set: 14 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/29 variables, 1/20 constraints. Problems are: Problem set: 14 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/29 variables, 0/20 constraints. Problems are: Problem set: 14 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 7/36 variables, 3/23 constraints. Problems are: Problem set: 14 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/36 variables, 0/23 constraints. Problems are: Problem set: 14 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 4/40 variables, 2/25 constraints. Problems are: Problem set: 14 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/40 variables, 0/25 constraints. Problems are: Problem set: 14 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 15/55 variables, 23/48 constraints. Problems are: Problem set: 14 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/55 variables, 0/48 constraints. Problems are: Problem set: 14 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/55 variables, 0/48 constraints. Problems are: Problem set: 14 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/55 variables, and 48 constraints, problems are : Problem set: 14 solved, 2 unsolved in 174 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 2/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 535ms problems are : Problem set: 14 solved, 2 unsolved
Parikh walk visited 0 properties in 30001 ms.
Support contains 1 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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 6 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 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 19
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 19
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 18
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 18
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 7 place count 29 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 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 28 transition count 16
Applied a total of 9 rules in 32 ms. Remains 28 /33 variables (removed 5) and now considering 16/22 (removed 6) transitions.
Running 15 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-14319873345688092305.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1146487861376313201.kers'
[2026-05-25 11:59:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14319873345688092305.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1146487861376313201.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 16 rows 21 cols 53 entries
Finished phase 1 with 11 SingleSign rule and 4 generalized
[2026-05-25 11:59:37] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1146487861376313201.kers
Total runtime 0 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 1/28 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 16/44 variables, 28/41 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/44 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 44/44 variables, and 41 constraints, problems are : Problem set: 0 solved, 15 unsolved in 201 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 28/28 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/27 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 1/28 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 16/44 variables, 28/41 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 15/56 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/44 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 0/44 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 44/44 variables, and 56 constraints, problems are : Problem set: 0 solved, 15 unsolved in 813 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 28/28 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1022ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 1023ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1079 ms. Remains : 28/33 places, 16/22 transitions.
RANDOM walk for 40008 steps (8 resets) in 248 ms. (160 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1012534 steps, run timeout after 3001 ms. (steps per millisecond=337 ) properties seen :0 out of 2
Probabilistic random walk after 1012534 steps, saw 483266 distinct states, run finished after 3001 ms. (steps per millisecond=337 ) properties seen :0
[2026-05-25 11:59:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/7 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/7 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 8/15 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/15 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/15 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 11/26 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/26 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/26 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 5/31 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/31 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/31 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/32 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/32 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/34 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/34 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/35 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/35 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 9/44 variables, 18/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/44 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/44 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 44/44 variables, and 41 constraints, problems are : Problem set: 0 solved, 2 unsolved in 101 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 28/28 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/7 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/7 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/7 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/15 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/15 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/15 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 11/26 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/26 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/26 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 5/31 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/31 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/31 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1/32 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/32 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/34 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/34 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 1/35 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/35 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 9/44 variables, 18/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/44 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/44 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 44/44 variables, and 43 constraints, problems are : Problem set: 0 solved, 2 unsolved in 110 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 28/28 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 213ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA GPPP-PT-C0001N0000100000-ReachabilityCardinality-2024-04 TRUE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 815059 steps, including 0 resets, run visited all 1 properties in 826 ms. (steps per millisecond=986 )
FORMULA GPPP-PT-C0001N0000100000-ReachabilityCardinality-2024-15 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 29482 ms.
All properties solved without resorting to model-checking.
Total runtime 68479 ms.

BK_STOP 1779710411547

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="GPPP-PT-C0001N0000100000"
export BK_EXAMINATION="ReachabilityCardinality"
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 GPPP-PT-C0001N0000100000, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r146-tall-177961074100286"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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