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.r130-smll-177955809200574.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 FMS-PT-50000, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r130-smll-177955809200574
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 7.5K Mar 7 05:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Mar 7 05:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Mar 7 05:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 7 05:10 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 10:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 10:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 10:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 10:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 7 05:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Mar 7 05:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Mar 7 05:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Mar 7 05:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 10:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 10:20 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 16K 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 FMS-PT-50000-ReachabilityCardinality-2024-00
FORMULA_NAME FMS-PT-50000-ReachabilityCardinality-2024-01
FORMULA_NAME FMS-PT-50000-ReachabilityCardinality-2024-02
FORMULA_NAME FMS-PT-50000-ReachabilityCardinality-2024-03
FORMULA_NAME FMS-PT-50000-ReachabilityCardinality-2024-04
FORMULA_NAME FMS-PT-50000-ReachabilityCardinality-2024-05
FORMULA_NAME FMS-PT-50000-ReachabilityCardinality-2024-06
FORMULA_NAME FMS-PT-50000-ReachabilityCardinality-2024-07
FORMULA_NAME FMS-PT-50000-ReachabilityCardinality-2024-08
FORMULA_NAME FMS-PT-50000-ReachabilityCardinality-2024-09
FORMULA_NAME FMS-PT-50000-ReachabilityCardinality-2024-10
FORMULA_NAME FMS-PT-50000-ReachabilityCardinality-2024-11
FORMULA_NAME FMS-PT-50000-ReachabilityCardinality-2024-12
FORMULA_NAME FMS-PT-50000-ReachabilityCardinality-2024-13
FORMULA_NAME FMS-PT-50000-ReachabilityCardinality-2024-14
FORMULA_NAME FMS-PT-50000-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779999162286

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FMS-PT-50000
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-28 20:12:44] [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-28 20:12:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-28 20:12:45] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2026-05-28 20:12:45] [INFO ] Transformed 22 places.
[2026-05-28 20:12:45] [INFO ] Transformed 20 transitions.
[2026-05-28 20:12:45] [INFO ] Parsed PT model containing 22 places and 20 transitions and 50 arcs in 309 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 51 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 200004 steps (0 resets) in 885 ms. (225 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 433 ms. (9 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 125 ms. (31 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 143 ms. (27 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 133 ms. (29 steps per ms) remains 16/16 properties
[2026-05-28 20:12:45] [INFO ] Flatten gal took : 134 ms
BEST_FIRST walk for 4004 steps (8 resets) in 121 ms. (32 steps per ms) remains 16/16 properties
[2026-05-28 20:12:45] [INFO ] Flatten gal took : 24 ms
BEST_FIRST walk for 4003 steps (8 resets) in 133 ms. (29 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 16/16 properties
[2026-05-28 20:12:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16824452256155454029.gal : 30 ms
BEST_FIRST walk for 4004 steps (8 resets) in 162 ms. (24 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 16/16 properties
[2026-05-28 20:12:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14279542313380400422.prop : 10 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/ReachabilityCardinality16824452256155454029.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14279542313380400422.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 4004 steps (8 resets) in 103 ms. (38 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 16/16 properties

BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 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 ...330
Loading property file /tmp/ReachabilityCardinality14279542313380400422.prop.
BEST_FIRST walk for 4003 steps (8 resets) in 51 ms. (76 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
[2026-05-28 20:12:46] [INFO ] Flatten gal took : 6 ms
[2026-05-28 20:12:46] [INFO ] Applying decomposition
BEST_FIRST walk for 4003 steps (8 resets) in 94 ms. (42 steps per ms) remains 16/16 properties
[2026-05-28 20:12:46] [INFO ] Flatten gal took : 7 ms
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 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/graph8610544990594466448.txt' '-o' '/tmp/graph8610544990594466448.bin' '-w' '/tmp/graph8610544990594466448.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8610544990594466448.bin' '-l' '-1' '-v' '-w' '/tmp/graph8610544990594466448.weights' '-q' '0' '-e' '0.001'
[2026-05-28 20:12:46] [INFO ] Decomposing Gal with order
[2026-05-28 20:12:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-28 20:12:46] [INFO ] Removed a total of 3 redundant transitions.
[2026-05-28 20:12:46] [INFO ] Flatten gal took : 116 ms
[2026-05-28 20:12:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2026-05-28 20:12:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11658272120071708102.gal : 3 ms
[2026-05-28 20:12:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6494725023659621704.prop : 9 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/ReachabilityCardinality11658272120071708102.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6494725023659621704.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 ...329
Loading property file /tmp/ReachabilityCardinality6494725023659621704.prop.
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 120442 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :1 out of 16
Probabilistic random walk after 120442 steps, saw 95931 distinct states, run finished after 3011 ms. (steps per millisecond=40 ) properties seen :1
FORMULA FMS-PT-50000-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6786647065309466399.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1055082407671358416.kers'
[2026-05-28 20:12:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6786647065309466399.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1055082407671358416.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 20 rows 19 cols 42 entries
Finished phase 1 with 15 SingleSign rule and 1 generalized
[2026-05-28 20:12:49] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-1055082407671358416.kers
Total runtime 14 ms.
Problem FMS-PT-50000-ReachabilityCardinality-2024-05 is UNSAT
FORMULA FMS-PT-50000-ReachabilityCardinality-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem FMS-PT-50000-ReachabilityCardinality-2024-14 is UNSAT
FORMULA FMS-PT-50000-ReachabilityCardinality-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 1/6 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 20/42 variables, 22/28 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/28 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 0/42 variables, 0/28 constraints. Problems are: Problem set: 2 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 42/42 variables, and 28 constraints, problems are : Problem set: 2 solved, 13 unsolved in 715 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 1/6 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 20/42 variables, 22/28 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 13/41 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/41 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 0/42 variables, 0/41 constraints. Problems are: Problem set: 2 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 42/42 variables, and 41 constraints, problems are : Problem set: 2 solved, 13 unsolved in 1169 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 13/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2045ms problems are : Problem set: 2 solved, 13 unsolved
FORMULA FMS-PT-50000-ReachabilityCardinality-2024-12 FALSE TECHNIQUES PARIKH_WALK
FORMULA FMS-PT-50000-ReachabilityCardinality-2024-09 FALSE TECHNIQUES PARIKH_WALK
FORMULA FMS-PT-50000-ReachabilityCardinality-2024-08 TRUE TECHNIQUES PARIKH_WALK
FORMULA FMS-PT-50000-ReachabilityCardinality-2024-07 FALSE TECHNIQUES PARIKH_WALK
FORMULA FMS-PT-50000-ReachabilityCardinality-2024-06 FALSE TECHNIQUES PARIKH_WALK
FORMULA FMS-PT-50000-ReachabilityCardinality-2024-02 FALSE TECHNIQUES PARIKH_WALK
FORMULA FMS-PT-50000-ReachabilityCardinality-2024-00 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 7 properties in 30003 ms.
Support contains 22 out of 22 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 14 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 22/22 places, 20/20 transitions.
RANDOM walk for 200004 steps (0 resets) in 130 ms. (1526 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 102 ms. (388 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 199 ms. (200 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 151 ms. (263 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 225032 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :0 out of 6
Probabilistic random walk after 225032 steps, saw 167361 distinct states, run finished after 3002 ms. (steps per millisecond=74 ) properties seen :0
[2026-05-28 20:13:24] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 20/42 variables, 22/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/42 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 42/42 variables, and 28 constraints, problems are : Problem set: 0 solved, 6 unsolved in 137 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 20/42 variables, 22/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 6/34 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/42 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 42/42 variables, and 34 constraints, problems are : Problem set: 0 solved, 6 unsolved in 384 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 537ms problems are : Problem set: 0 solved, 6 unsolved
FORMULA FMS-PT-50000-ReachabilityCardinality-2024-15 FALSE TECHNIQUES PARIKH_WALK
FORMULA FMS-PT-50000-ReachabilityCardinality-2024-11 TRUE TECHNIQUES PARIKH_WALK
FORMULA FMS-PT-50000-ReachabilityCardinality-2024-04 TRUE TECHNIQUES PARIKH_WALK
FORMULA FMS-PT-50000-ReachabilityCardinality-2024-01 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 4 properties in 30002 ms.
Support contains 19 out of 22 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 22/22 places, 20/20 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 22 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 19
Applied a total of 2 rules in 19 ms. Remains 21 /22 variables (removed 1) and now considering 19/20 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 21/22 places, 19/20 transitions.
RANDOM walk for 200006 steps (0 resets) in 254 ms. (784 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 75 ms. (526 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 421613 steps, run timeout after 3001 ms. (steps per millisecond=140 ) properties seen :0 out of 2
Probabilistic random walk after 421613 steps, saw 354676 distinct states, run finished after 3001 ms. (steps per millisecond=140 ) 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-17467584388922635368.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5503564174831144925.kers'
[2026-05-28 20:13:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17467584388922635368.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5503564174831144925.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 19 rows 18 cols 40 entries
Finished phase 1 with 14 SingleSign rule and 1 generalized
[2026-05-28 20:13:58] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5503564174831144925.kers
Total runtime 1 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/21 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 19/40 variables, 21/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/40 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/40 variables, and 27 constraints, problems are : Problem set: 0 solved, 2 unsolved in 84 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/21 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/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/21 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 19/40 variables, 21/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/40 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/40 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/40 variables, and 29 constraints, problems are : Problem set: 0 solved, 2 unsolved in 179 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 276ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA FMS-PT-50000-ReachabilityCardinality-2024-10 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 30001 ms.
Support contains 11 out of 21 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21/21 places, 19/19 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 20 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 20 transition count 17
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 4 place count 19 transition count 17
Applied a total of 4 rules in 9 ms. Remains 19 /21 variables (removed 2) and now considering 17/19 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 19/21 places, 17/19 transitions.
RANDOM walk for 200005 steps (0 resets) in 48 ms. (4081 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2150069 steps, run timeout after 3001 ms. (steps per millisecond=716 ) properties seen :0 out of 1
Probabilistic random walk after 2150069 steps, saw 1518375 distinct states, run finished after 3001 ms. (steps per millisecond=716 ) 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-7058506200807456592.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7164755169203300581.kers'
[2026-05-28 20:14:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7058506200807456592.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7164755169203300581.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 17 rows 15 cols 34 entries
Finished phase 1 with 12 SingleSign rule and 1 generalized
[2026-05-28 20:14:31] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7164755169203300581.kers
Total runtime 0 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 5/16 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/17 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/19 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/19 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 17/36 variables, 19/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/36 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/36 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 25 constraints, problems are : Problem set: 0 solved, 1 unsolved in 73 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/19 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 5/16 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/17 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/19 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/19 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 17/36 variables, 19/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/36 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/36 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/36 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 26 constraints, problems are : Problem set: 0 solved, 1 unsolved in 89 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/19 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 175ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 468937 steps, including 0 resets, run visited all 1 properties in 938 ms. (steps per millisecond=499 )
FORMULA FMS-PT-50000-ReachabilityCardinality-2024-13 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 944 ms.
All properties solved without resorting to model-checking.
Total runtime 108073 ms.

BK_STOP 1779999272862

--------------------
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="FMS-PT-50000"
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 FMS-PT-50000, 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 r130-smll-177955809200574"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FMS-PT-50000.tgz
mv FMS-PT-50000 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 ;