Execution Chart

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

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r178-oct2-177969020100379.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 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 MedleyB-PT-B13, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969020100379
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 126M
-rw-r--r-- 1 mcc users 6.2K Mar 7 18:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Mar 7 18:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Mar 7 18:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Mar 7 18:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 11:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 11:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 11:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 11:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 7 18:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Mar 7 18:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Mar 7 18:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Mar 7 18:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 126M 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 MedleyB-PT-B13-LTLCardinality-00
FORMULA_NAME MedleyB-PT-B13-LTLCardinality-01
FORMULA_NAME MedleyB-PT-B13-LTLCardinality-02
FORMULA_NAME MedleyB-PT-B13-LTLCardinality-03
FORMULA_NAME MedleyB-PT-B13-LTLCardinality-04
FORMULA_NAME MedleyB-PT-B13-LTLCardinality-05
FORMULA_NAME MedleyB-PT-B13-LTLCardinality-06
FORMULA_NAME MedleyB-PT-B13-LTLCardinality-07
FORMULA_NAME MedleyB-PT-B13-LTLCardinality-08
FORMULA_NAME MedleyB-PT-B13-LTLCardinality-09
FORMULA_NAME MedleyB-PT-B13-LTLCardinality-10
FORMULA_NAME MedleyB-PT-B13-LTLCardinality-11
FORMULA_NAME MedleyB-PT-B13-LTLCardinality-12
FORMULA_NAME MedleyB-PT-B13-LTLCardinality-13
FORMULA_NAME MedleyB-PT-B13-LTLCardinality-14
FORMULA_NAME MedleyB-PT-B13-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779713070224

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyB-PT-B13
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-25 12:44:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 12:44:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 12:44:36] [INFO ] Load time of PNML (sax parser for PT used): 4505 ms
[2026-05-25 12:44:36] [INFO ] Transformed 3039 places.
[2026-05-25 12:44:37] [INFO ] Transformed 122330 transitions.
[2026-05-25 12:44:37] [INFO ] Found NUPN structural information;
[2026-05-25 12:44:37] [INFO ] Parsed PT model containing 3039 places and 122330 transitions and 2389226 arcs in 5339 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA MedleyB-PT-B13-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B13-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B13-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B13-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B13-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B13-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B13-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B13-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B13-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 3039 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3039/3039 places, 122330/122330 transitions.
Discarding 241 places :
Symmetric choice reduction at 0 with 241 rule applications. Total rules 241 place count 2798 transition count 122089
Iterating global reduction 0 with 241 rules applied. Total rules applied 482 place count 2798 transition count 122089
Discarding 151 places :
Symmetric choice reduction at 0 with 151 rule applications. Total rules 633 place count 2647 transition count 121938
Iterating global reduction 0 with 151 rules applied. Total rules applied 784 place count 2647 transition count 121938
Discarding 87 places :
Symmetric choice reduction at 0 with 87 rule applications. Total rules 871 place count 2560 transition count 121851
Iterating global reduction 0 with 87 rules applied. Total rules applied 958 place count 2560 transition count 121851
Discarding 77 places :
Symmetric choice reduction at 0 with 77 rule applications. Total rules 1035 place count 2483 transition count 121774
Iterating global reduction 0 with 77 rules applied. Total rules applied 1112 place count 2483 transition count 121774
Discarding 67 places :
Symmetric choice reduction at 0 with 67 rule applications. Total rules 1179 place count 2416 transition count 121707
Iterating global reduction 0 with 67 rules applied. Total rules applied 1246 place count 2416 transition count 121707
Discarding 66 places :
Symmetric choice reduction at 0 with 66 rule applications. Total rules 1312 place count 2350 transition count 121641
Iterating global reduction 0 with 66 rules applied. Total rules applied 1378 place count 2350 transition count 121641
Discarding 66 places :
Symmetric choice reduction at 0 with 66 rule applications. Total rules 1444 place count 2284 transition count 121575
Iterating global reduction 0 with 66 rules applied. Total rules applied 1510 place count 2284 transition count 121575
Discarding 66 places :
Symmetric choice reduction at 0 with 66 rule applications. Total rules 1576 place count 2218 transition count 121509
Iterating global reduction 0 with 66 rules applied. Total rules applied 1642 place count 2218 transition count 121509
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 1698 place count 2162 transition count 121453
Iterating global reduction 0 with 56 rules applied. Total rules applied 1754 place count 2162 transition count 121453
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 1799 place count 2117 transition count 121408
Iterating global reduction 0 with 45 rules applied. Total rules applied 1844 place count 2117 transition count 121408
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 1852 place count 2117 transition count 121400
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 1870 place count 2099 transition count 121382
Iterating global reduction 1 with 18 rules applied. Total rules applied 1888 place count 2099 transition count 121382
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 1906 place count 2081 transition count 121364
Iterating global reduction 1 with 18 rules applied. Total rules applied 1924 place count 2081 transition count 121364
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 1933 place count 2072 transition count 121355
Iterating global reduction 1 with 9 rules applied. Total rules applied 1942 place count 2072 transition count 121355
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 1950 place count 2064 transition count 121347
Iterating global reduction 1 with 8 rules applied. Total rules applied 1958 place count 2064 transition count 121347
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 1966 place count 2056 transition count 121339
Iterating global reduction 1 with 8 rules applied. Total rules applied 1974 place count 2056 transition count 121339
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 1982 place count 2048 transition count 121331
Iterating global reduction 1 with 8 rules applied. Total rules applied 1990 place count 2048 transition count 121331
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 1998 place count 2040 transition count 121323
Iterating global reduction 1 with 8 rules applied. Total rules applied 2006 place count 2040 transition count 121323
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 2014 place count 2032 transition count 121315
Iterating global reduction 1 with 8 rules applied. Total rules applied 2022 place count 2032 transition count 121315
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 2030 place count 2024 transition count 121307
Iterating global reduction 1 with 8 rules applied. Total rules applied 2038 place count 2024 transition count 121307
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 2046 place count 2016 transition count 121299
Iterating global reduction 1 with 8 rules applied. Total rules applied 2054 place count 2016 transition count 121299
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 2062 place count 2008 transition count 121291
Iterating global reduction 1 with 8 rules applied. Total rules applied 2070 place count 2008 transition count 121291
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 2078 place count 2000 transition count 121283
Iterating global reduction 1 with 8 rules applied. Total rules applied 2086 place count 2000 transition count 121283
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 2094 place count 2000 transition count 121275
Applied a total of 2094 rules in 93151 ms. Remains 2000 /3039 variables (removed 1039) and now considering 121275/122330 (removed 1055) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3550972150509175352.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13333306546849869332.kers'
[2026-05-25 12:46:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3550972150509175352.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13333306546849869332.kers]
Culled 0 columns in 263 ms.
// Phase 1: matrix 121275 rows 2000 cols 2387046 entries
Finished phase 1 with 1989 SingleSign rule and 0 generalized
[2026-05-25 12:46:15] [INFO ] Computed 11 invariants in 2554 ms
Computed 11 P flows in 2570 ms.
Exported basis to /tmp/petrispot-output-13333306546849869332.kers
Total runtime 2844 ms.
[2026-05-25 12:46:46] [INFO ] Performed 1061/2000 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-05-25 12:47:10] [INFO ] Implicit Places using invariants in 58706 ms returned []
Implicit Place search using SMT only with invariants took 58792 ms to find 0 implicit places.
Running 121274 sub problems to find dead transitions.
[2026-05-25 12:47:11] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1999/123275 variables, and 0 constraints, problems are : Problem set: 0 solved, 121274 unsolved in 31594 ms.
Refiners :[Positive P Invariants (semi-flows): 0/11 constraints, State Equation: 0/2000 constraints, PredecessorRefiner: 121274/2002 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121274 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1999/123275 variables, and 0 constraints, problems are : Problem set: 0 solved, 121274 unsolved in 31539 ms.
Refiners :[Positive P Invariants (semi-flows): 0/11 constraints, State Equation: 0/2000 constraints, PredecessorRefiner: 119272/2002 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2093562ms problems are : Problem set: 0 solved, 121274 unsolved
Search for dead transitions found 0 dead transitions in 2094198ms
Starting structural reductions in LTL mode, iteration 1 : 2000/3039 places, 121275/122330 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2246758 ms. Remains : 2000/3039 places, 121275/122330 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2000/2000 places, 121275/121275 transitions.
Applied a total of 0 rules in 5431 ms. Remains 2000 /2000 variables (removed 0) and now considering 121275/121275 (removed 0) transitions.
[2026-05-25 13:22:10] [INFO ] Invariant cache hit.
[2026-05-25 13:22:41] [INFO ] Performed 1211/2000 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-05-25 13:23:01] [INFO ] Implicit Places using invariants in 50485 ms returned []
Implicit Place search using SMT only with invariants took 50501 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 55952 ms. Remains : 2000/2000 places, 121275/121275 transitions.
Support contains 21 out of 2000 places after structural reductions.
[2026-05-25 13:23:12] [INFO ] Flatten gal took : 9600 ms
[2026-05-25 13:23:21] [INFO ] Flatten gal took : 9626 ms
[2026-05-25 13:23:43] [INFO ] Input system was already deterministic with 121275 transitions.
Reduction of identical properties reduced properties to check from 13 to 12
RANDOM walk for 40000 steps (216 resets) in 5378 ms. (7 steps per ms) remains 8/12 properties
BEST_FIRST walk for 40004 steps (26 resets) in 526 ms. (75 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (24 resets) in 494 ms. (80 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (21 resets) in 601 ms. (66 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (26 resets) in 495 ms. (80 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (24 resets) in 591 ms. (67 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (25 resets) in 471 ms. (84 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (24 resets) in 439 ms. (90 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (25 resets) in 433 ms. (92 steps per ms) remains 8/8 properties
[2026-05-25 13:23:47] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 1217/1232 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1232 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 768/2000 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2000 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SMT process timed out in 6053ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 15 out of 2000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2000/2000 places, 121275/121275 transitions.
Graph (trivial) has 1968 edges and 2000 vertex of which 146 / 2000 are part of one of the 28 SCC in 28 ms
Free SCC test removed 118 places
Drop transitions (Empty/Sink Transition effects.) removed 164 transitions
Reduce isomorphic transitions removed 164 transitions.
Graph (complete) has 4331 edges and 1882 vertex of which 1872 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.330 ms
Discarding 10 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1394 transitions
Trivial Post-agglo rules discarded 1394 transitions
Performed 1394 trivial Post agglomeration. Transition count delta: 1394
Iterating post reduction 0 with 1404 rules applied. Total rules applied 1406 place count 1872 transition count 119707
Reduce places removed 1394 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 1424 rules applied. Total rules applied 2830 place count 478 transition count 119677
Reduce places removed 11 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 18 rules applied. Total rules applied 2848 place count 467 transition count 119670
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 9 rules applied. Total rules applied 2857 place count 460 transition count 119668
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2858 place count 459 transition count 119668
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 114 Pre rules applied. Total rules applied 2858 place count 459 transition count 119554
Deduced a syphon composed of 114 places in 97 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 5 with 228 rules applied. Total rules applied 3086 place count 345 transition count 119554
Performed 55 Post agglomeration using F-continuation condition.
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 58 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 5 with 146 rules applied. Total rules applied 3232 place count 272 transition count 119481
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 5 with 19 rules applied. Total rules applied 3251 place count 272 transition count 119462
Discarding 58 places :
Symmetric choice reduction at 6 with 58 rule applications. Total rules 3309 place count 214 transition count 3374
Iterating global reduction 6 with 58 rules applied. Total rules applied 3367 place count 214 transition count 3374
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 6 with 27 rules applied. Total rules applied 3394 place count 214 transition count 3347
Discarding 28 places :
Symmetric choice reduction at 7 with 28 rule applications. Total rules 3422 place count 186 transition count 3311
Iterating global reduction 7 with 28 rules applied. Total rules applied 3450 place count 186 transition count 3311
Discarding 20 places :
Symmetric choice reduction at 7 with 20 rule applications. Total rules 3470 place count 166 transition count 3291
Iterating global reduction 7 with 20 rules applied. Total rules applied 3490 place count 166 transition count 3291
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 3500 place count 166 transition count 3281
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 8 with 20 rules applied. Total rules applied 3520 place count 156 transition count 3271
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 3530 place count 151 transition count 3279
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 3533 place count 151 transition count 3276
Free-agglomeration rule applied 56 times.
Iterating global reduction 8 with 56 rules applied. Total rules applied 3589 place count 151 transition count 3220
Reduce places removed 56 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 8 with 121 rules applied. Total rules applied 3710 place count 95 transition count 3155
Renaming transitions due to excessive name length > 1024 char.
Drop transitions (Redundant composition of simpler transitions.) removed 1087 transitions
Redundant transition composition rules discarded 1087 transitions
Iterating global reduction 9 with 1087 rules applied. Total rules applied 4797 place count 95 transition count 2068
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 4801 place count 93 transition count 2078
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 9 with 6 rules applied. Total rules applied 4807 place count 93 transition count 2072
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 4813 place count 87 transition count 2072
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 10 with 10 rules applied. Total rules applied 4823 place count 87 transition count 2072
Applied a total of 4823 rules in 86106 ms. Remains 87 /2000 variables (removed 1913) and now considering 2072/121275 (removed 119203) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86107 ms. Remains : 87/2000 places, 2072/121275 transitions.
RANDOM walk for 40000 steps (2374 resets) in 1373 ms. (29 steps per ms) remains 2/8 properties
BEST_FIRST walk for 40002 steps (355 resets) in 305 ms. (130 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (356 resets) in 194 ms. (205 steps per ms) remains 2/2 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7093947342795681481.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1699337870352162001.kers'
[2026-05-25 13:25:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7093947342795681481.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1699337870352162001.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 2072 rows 87 cols 21382 entries
Finished phase 1 with 76 SingleSign rule and 0 generalized
[2026-05-25 13:25:20] [INFO ] Computed 11 invariants in 8 ms
Computed 11 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-1699337870352162001.kers
Total runtime 11 ms.
[2026-05-25 13:25:20] [INFO ] State equation strengthened by 1931 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/39 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 48/87 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2072/2159 variables, 87/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2159 variables, 1931/2029 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2159 variables, 0/2029 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/2159 variables, 0/2029 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2159/2159 variables, and 2029 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1258 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 87/87 constraints, ReadFeed: 1931/1931 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/39 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 48/87 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2072/2159 variables, 87/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2159 variables, 1931/2035 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2159 variables, 2/2037 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2159 variables, 4/2041 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2159 variables, 0/2041 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/2159 variables, 0/2041 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2159/2159 variables, and 2041 constraints, problems are : Problem set: 0 solved, 2 unsolved in 8690 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 87/87 constraints, ReadFeed: 1931/1931 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10371ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 24 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=6 )
Parikh walk visited 2 properties in 25 ms.
FORMULA MedleyB-PT-B13-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 410 stabilizing places and 430 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((F(p1)||p0) U p2) U X(X(X(p3)))))'
Support contains 5 out of 2000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2000/2000 places, 121275/121275 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1995 transition count 121270
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1995 transition count 121270
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 1995 transition count 121269
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 1992 transition count 121266
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 1992 transition count 121266
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 1989 transition count 121263
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 1989 transition count 121263
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 26 place count 1986 transition count 121260
Iterating global reduction 1 with 3 rules applied. Total rules applied 29 place count 1986 transition count 121260
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 32 place count 1983 transition count 121257
Iterating global reduction 1 with 3 rules applied. Total rules applied 35 place count 1983 transition count 121257
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 1981 transition count 121255
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 1981 transition count 121255
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 1979 transition count 121253
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 1979 transition count 121253
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 1977 transition count 121251
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 1977 transition count 121251
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 48 place count 1977 transition count 121250
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 1976 transition count 121249
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 1976 transition count 121249
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 1975 transition count 121248
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 1975 transition count 121248
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 1974 transition count 121247
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 1974 transition count 121247
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 1973 transition count 121246
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 1973 transition count 121246
Applied a total of 56 rules in 37223 ms. Remains 1973 /2000 variables (removed 27) and now considering 121246/121275 (removed 29) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7367242983204237927.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1513755671577141249.kers'
[2026-05-25 13:26:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7367242983204237927.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1513755671577141249.kers]
Culled 0 columns in 244 ms.
// Phase 1: matrix 121246 rows 1973 cols 2386986 entries
Finished phase 1 with 1962 SingleSign rule and 0 generalized
[2026-05-25 13:26:12] [INFO ] Computed 11 invariants in 2213 ms
Computed 11 P flows in 2217 ms.
Exported basis to /tmp/petrispot-output-1513755671577141249.kers
Total runtime 2520 ms.
[2026-05-25 13:26:43] [INFO ] Performed 1083/1973 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-05-25 13:27:05] [INFO ] Implicit Places using invariants in 55242 ms returned []
Implicit Place search using SMT only with invariants took 55244 ms to find 0 implicit places.
Running 121245 sub problems to find dead transitions.
[2026-05-25 13:27:06] [INFO ] Invariant cache hit.

BK_TIME_CONFINEMENT_REACHED

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 LTLCardinality -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="MedleyB-PT-B13"
export BK_EXAMINATION="LTLCardinality"
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 MedleyB-PT-B13, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r178-oct2-177969020100379"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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