fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r259-tall-174931345500318
Last Updated
June 24, 2025

About the Execution of ITS-Tools for MedleyB-PT-B11

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 207874.00 0.00 0.00 F normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r259-tall-174931345500318.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is MedleyB-PT-B11, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r259-tall-174931345500318
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 37M
-rw-r--r-- 1 mcc users 7.1K Jun 6 09:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Jun 6 09:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 6 09:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Jun 6 09:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 6 12:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 6 12:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 12:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 6 12:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 9.1K Jun 6 09:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Jun 6 09:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Jun 6 09:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Jun 6 09:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 6 12:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 4 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 36M Jun 5 20:08 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1749323055791

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=MedleyB-PT-B11
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StableMarking PT
Running Version 202505121319
[2025-06-07 19:04:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2025-06-07 19:04:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 19:04:19] [INFO ] Load time of PNML (sax parser for PT used): 1654 ms
[2025-06-07 19:04:19] [INFO ] Transformed 2737 places.
[2025-06-07 19:04:19] [INFO ] Transformed 42767 transitions.
[2025-06-07 19:04:19] [INFO ] Found NUPN structural information;
[2025-06-07 19:04:19] [INFO ] Parsed PT model containing 2737 places and 42767 transitions and 723915 arcs in 2067 ms.
Graph (trivial) has 2718 edges and 2737 vertex of which 180 / 2737 are part of one of the 27 SCC in 19 ms
Free SCC test removed 153 places
Structural test allowed to assert that 1202 places are NOT stable. Took 144 ms.
Ensure Unique test removed 171 transitions
Reduce redundant transitions removed 171 transitions.
RANDOM walk for 40000 steps (245 resets) in 12428 ms. (3 steps per ms) remains 1535/1535 properties
BEST_FIRST walk for 123 steps (8 resets) in 23 ms. (5 steps per ms) remains 1535/1535 properties
BEST_FIRST walk for 124 steps (8 resets) in 46 ms. (2 steps per ms) remains 1535/1535 properties
BEST_FIRST walk for 123 steps (8 resets) in 26 ms. (4 steps per ms) remains 1535/1535 properties
BEST_FIRST walk for 123 steps (8 resets) in 20 ms. (5 steps per ms) remains 1535/1535 properties
BEST_FIRST walk for 124 steps (8 resets) in 31 ms. (3 steps per ms) remains 1535/1535 properties
BEST_FIRST walk for 122 steps (8 resets) in 19 ms. (6 steps per ms) remains 1535/1535 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 1535/1535 properties
BEST_FIRST walk for 123 steps (8 resets) in 23 ms. (5 steps per ms) remains 1535/1535 properties
BEST_FIRST walk for 124 steps (8 resets) in 16 ms. (7 steps per ms) remains 1535/1535 properties
BEST_FIRST walk for 123 steps (8 resets) in 32 ms. (3 steps per ms) remains 1535/1535 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 1535/1535 properties
BEST_FIRST walk for 124 steps (8 resets) in 33 ms. (3 steps per ms) remains 1535/1535 properties
BEST_FIRST walk for 123 steps (8 resets) in 12 ms. (9 steps per ms) remains 1535/1535 properties
BEST_FIRST walk for 124 steps (8 resets) in 32 ms. (3 steps per ms) remains 1535/1535 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 1535/1535 properties
BEST_FIRST walk for 124 steps (8 resets) in 31 ms. (3 steps per ms) remains 1535/1535 properties
BEST_FIRST walk for 123 steps (8 resets) in 27 ms. (4 steps per ms) remains 1535/1535 properties
BEST_FIRST walk for 122 steps (8 resets) in 12 ms. (9 steps per ms) remains 1535/1535 properties
BEST_FIRST walk for 122 steps (8 resets) in 26 ms. (4 steps per ms) remains 1535/1535 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 1535/1535 properties
BEST_FIRST walk for 124 steps (8 resets) in 15 ms. (7 steps per ms) remains 1535/1535 properties
BEST_FIRST walk for 122 steps (8 resets) in 15 ms. (7 steps per ms) remains 1535/1535 properties
BEST_FIRST walk for 122 steps (8 resets) in 10 ms. (11 steps per ms) remains 1535/1535 properties
BEST_FIRST walk for 124 steps (8 resets) in 17 ms. (6 steps per ms) remains 1535/1535 properties
BEST_FIRST walk for 124 steps (8 resets) in 17 ms. (6 steps per ms) remains 1535/1535 properties
BEST_FIRST walk for 123 steps (8 resets) in 15 ms. (7 steps per ms) remains 1535/1535 properties
BEST_FIRST walk for 124 steps (8 resets) in 17 ms. (6 steps per ms) remains 1535/1535 properties
BEST_FIRST walk for 124 steps (8 resets) in 16 ms. (7 steps per ms) remains 1535/1535 properties
BEST_FIRST walk for 124 steps (8 resets) in 17 ms. (6 steps per ms) remains 1535/1535 properties
BEST_FIRST walk for 123 steps (8 resets) in 13 ms. (8 steps per ms) remains 1535/1535 properties
BEST_FIRST walk for 124 steps (8 resets) in 20 ms. (5 steps per ms) remains 1535/1535 properties
BEST_FIRST walk for 124 steps (8 resets) in 31 ms. (3 steps per ms) remains 1535/1535 properties
BEST_FIRST walk for 123 steps (8 resets) in 18 ms. (6 steps per ms) remains 1535/1535 properties
BEST_FIRST walk for 124 steps (8 resets) in 16 ms. (7 steps per ms) remains 1535/1535 properties
BEST_FIRST walk for 122 steps (8 resets) in 18 ms. (6 steps per ms) remains 1535/1535 properties
BEST_FIRST walk for 123 steps (8 resets) in 13 ms. (8 steps per ms) remains 1535/1535 properties
BEST_FIRST walk for 123 steps (8 resets) in 9 ms. (12 steps per ms) remains 1535/1535 properties
BEST_FIRST walk for 123 steps (8 resets) in 21 ms. (5 steps per ms) remains 1535/1535 properties
BEST_FIRST walk for 123 steps (8 resets) in 15 ms. (7 steps per ms) remains 1535/1535 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 1535/1535 properties
BEST_FIRST walk for 123 steps (8 resets) in 13 ms. (8 steps per ms) remains 1535/1535 properties
BEST_FIRST walk for 123 steps (8 resets) in 29 ms. (4 steps per ms) remains 1535/1535 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 1535/1535 properties
BEST_FIRST walk for 123 steps (8 resets) in 26 ms. (4 steps per ms) remains 1535/1535 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 1535/1535 properties
BEST_FIRST walk for 124 steps (8 resets) in 20 ms. (5 steps per ms) remains 1535/1535 properties
BEST_FIRST walk for 123 steps (8 resets) in 11 ms. (10 steps per ms) remains 1535/1535 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 1535/1535 properties
BEST_FIRST walk for 123 steps (8 resets) in 16 ms. (7 steps per ms) remains 1535/1535 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 1535/1535 properties
[2025-06-07 19:04:27] [INFO ] Flatten gal took : 5066 ms
[2025-06-07 19:04:31] [INFO ] Flatten gal took : 3825 ms
[2025-06-07 19:04:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2176538568193075186.gal : 810 ms
[2025-06-07 19:04:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality292957967771758329.prop : 7 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2176538568193075186.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality292957967771758329.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Interrupted probabilistic random walk after 25282 steps, run timeout after 12002 ms. (steps per millisecond=2 ) properties seen :87 out of 1535
Probabilistic random walk after 25282 steps, saw 11425 distinct states, run finished after 12009 ms. (steps per millisecond=2 ) properties seen :87
[2025-06-07 19:04:36] [INFO ] Flow matrix only has 42570 transitions (discarded 26 similar events)
// Phase 1: matrix 42570 rows 2584 cols
[2025-06-07 19:04:37] [INFO ] Computed 10 invariants in 1466 ms
[2025-06-07 19:04:38] [INFO ] State equation strengthened by 1 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1448 variables, 1448/1448 constraints. Problems are: Problem set: 0 solved, 1448 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1448/45154 variables, and 1448 constraints, problems are : Problem set: 0 solved, 1448 unsolved in 5095 ms.
Refiners :[Domain max(s): 1448/2584 constraints, Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/2584 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1448/1404 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1448 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1448 variables, 1448/1448 constraints. Problems are: Problem set: 0 solved, 1448 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1448/45154 variables, and 1448 constraints, problems are : Problem set: 0 solved, 1448 unsolved in 5037 ms.
Refiners :[Domain max(s): 1448/2584 constraints, Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/2584 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 44/1404 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20990ms problems are : Problem set: 0 solved, 1448 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1448 out of 2584 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2584/2584 places, 42596/42596 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 944 transitions
Trivial Post-agglo rules discarded 944 transitions
Performed 944 trivial Post agglomeration. Transition count delta: 944
Iterating post reduction 0 with 971 rules applied. Total rules applied 971 place count 2584 transition count 41625
Reduce places removed 944 places and 0 transitions.
Iterating post reduction 1 with 944 rules applied. Total rules applied 1915 place count 1640 transition count 41625
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 1915 place count 1640 transition count 41605
Deduced a syphon composed of 20 places in 45 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 1955 place count 1620 transition count 41605
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 1958 place count 1617 transition count 41602
Iterating global reduction 2 with 3 rules applied. Total rules applied 1961 place count 1617 transition count 41602
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 26 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 2001 place count 1597 transition count 41582
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 20 places in 48 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 2041 place count 1577 transition count 41609
Loading property file /tmp/ReachabilityCardinality292957967771758329.prop.
Free-agglomeration rule applied 77 times.
Iterating global reduction 2 with 77 rules applied. Total rules applied 2118 place count 1577 transition count 41532
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 2 with 77 rules applied. Total rules applied 2195 place count 1500 transition count 41532
Renaming transitions due to excessive name length > 1024 char.
Applied a total of 2195 rules in 18759 ms. Remains 1500 /2584 variables (removed 1084) and now considering 41532/42596 (removed 1064) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18781 ms. Remains : 1500/2584 places, 41532/42596 transitions.
RANDOM walk for 6301 steps (3 resets) in 121328 ms. (0 steps per ms) remains 852/1448 properties
BEST_FIRST walk for 4002 steps (8 resets) in 241 ms. (16 steps per ms) remains 852/852 properties
BEST_FIRST walk for 4004 steps (8 resets) in 239 ms. (16 steps per ms) remains 852/852 properties
BEST_FIRST walk for 4004 steps (8 resets) in 311 ms. (12 steps per ms) remains 852/852 properties
BEST_FIRST walk for 4003 steps (4 resets) in 1184 ms. (3 steps per ms) remains 852/852 properties
BEST_FIRST walk for 4002 steps (8 resets) in 278 ms. (14 steps per ms) remains 852/852 properties
BEST_FIRST walk for 4004 steps (8 resets) in 669 ms. (5 steps per ms) remains 852/852 properties
BEST_FIRST walk for 4004 steps (7 resets) in 688 ms. (5 steps per ms) remains 852/852 properties
BEST_FIRST walk for 4004 steps (8 resets) in 343 ms. (11 steps per ms) remains 852/852 properties
BEST_FIRST walk for 4004 steps (6 resets) in 1942 ms. (2 steps per ms) remains 852/852 properties
BEST_FIRST walk for 4003 steps (5 resets) in 1170 ms. (3 steps per ms) remains 852/852 properties
BEST_FIRST walk for 4004 steps (5 resets) in 1638 ms. (2 steps per ms) remains 852/852 properties
BEST_FIRST walk for 4004 steps (8 resets) in 783 ms. (5 steps per ms) remains 852/852 properties
BEST_FIRST walk for 4003 steps (6 resets) in 583 ms. (6 steps per ms) remains 852/852 properties
BEST_FIRST walk for 4004 steps (8 resets) in 246 ms. (16 steps per ms) remains 852/852 properties
BEST_FIRST walk for 4004 steps (8 resets) in 202 ms. (19 steps per ms) remains 852/852 properties
BEST_FIRST walk for 4004 steps (7 resets) in 1049 ms. (3 steps per ms) remains 852/852 properties
BEST_FIRST walk for 4004 steps (8 resets) in 245 ms. (16 steps per ms) remains 852/852 properties
BEST_FIRST walk for 4004 steps (8 resets) in 292 ms. (13 steps per ms) remains 852/852 properties
BEST_FIRST walk for 4004 steps (8 resets) in 625 ms. (6 steps per ms) remains 852/852 properties
BEST_FIRST walk for 4004 steps (6 resets) in 676 ms. (5 steps per ms) remains 852/852 properties
BEST_FIRST walk for 4003 steps (8 resets) in 747 ms. (5 steps per ms) remains 852/852 properties
BEST_FIRST walk for 4004 steps (8 resets) in 222 ms. (17 steps per ms) remains 852/852 properties
BEST_FIRST walk for 4004 steps (6 resets) in 631 ms. (6 steps per ms) remains 852/852 properties
BEST_FIRST walk for 4003 steps (8 resets) in 466 ms. (8 steps per ms) remains 852/852 properties
BEST_FIRST walk for 4004 steps (6 resets) in 587 ms. (6 steps per ms) remains 852/852 properties
BEST_FIRST walk for 4004 steps (6 resets) in 1186 ms. (3 steps per ms) remains 852/852 properties
BEST_FIRST walk for 4004 steps (8 resets) in 297 ms. (13 steps per ms) remains 852/852 properties
BEST_FIRST walk for 4004 steps (8 resets) in 218 ms. (18 steps per ms) remains 852/852 properties
BEST_FIRST walk for 4003 steps (8 resets) in 306 ms. (13 steps per ms) remains 852/852 properties
BEST_FIRST walk for 4002 steps (8 resets) in 293 ms. (13 steps per ms) remains 852/852 properties
BEST_FIRST walk for 4003 steps (8 resets) in 216 ms. (18 steps per ms) remains 852/852 properties
BEST_FIRST walk for 4003 steps (5 resets) in 1140 ms. (3 steps per ms) remains 852/852 properties
BEST_FIRST walk for 4004 steps (8 resets) in 299 ms. (13 steps per ms) remains 852/852 properties
BEST_FIRST walk for 4004 steps (8 resets) in 298 ms. (13 steps per ms) remains 852/852 properties
BEST_FIRST walk for 4003 steps (8 resets) in 906 ms. (4 steps per ms) remains 852/852 properties
BEST_FIRST walk for 4004 steps (8 resets) in 235 ms. (16 steps per ms) remains 852/852 properties
BEST_FIRST walk for 4003 steps (8 resets) in 325 ms. (12 steps per ms) remains 852/852 properties
BEST_FIRST walk for 4004 steps (6 resets) in 644 ms. (6 steps per ms) remains 852/852 properties
BEST_FIRST walk for 4003 steps (8 resets) in 676 ms. (5 steps per ms) remains 852/852 properties
BEST_FIRST walk for 4003 steps (8 resets) in 270 ms. (14 steps per ms) remains 852/852 properties
BEST_FIRST walk for 4004 steps (4 resets) in 1079 ms. (3 steps per ms) remains 852/852 properties
BEST_FIRST walk for 4004 steps (6 resets) in 1281 ms. (3 steps per ms) remains 852/852 properties
BEST_FIRST walk for 4004 steps (8 resets) in 222 ms. (17 steps per ms) remains 852/852 properties
BEST_FIRST walk for 4003 steps (8 resets) in 221 ms. (18 steps per ms) remains 852/852 properties
BEST_FIRST walk for 4004 steps (8 resets) in 1034 ms. (3 steps per ms) remains 852/852 properties
BEST_FIRST walk for 4004 steps (8 resets) in 265 ms. (15 steps per ms) remains 852/852 properties
BEST_FIRST walk for 4004 steps (8 resets) in 648 ms. (6 steps per ms) remains 852/852 properties
BEST_FIRST walk for 4004 steps (8 resets) in 358 ms. (11 steps per ms) remains 852/852 properties
BEST_FIRST walk for 4003 steps (6 resets) in 665 ms. (6 steps per ms) remains 852/852 properties
BEST_FIRST walk for 4004 steps (2 resets) in 1747 ms. (2 steps per ms) remains 852/852 properties
// Phase 1: matrix 41532 rows 1500 cols
[2025-06-07 19:06:03] [INFO ] Computed 10 invariants in 621 ms
[2025-06-07 19:06:05] [INFO ] State equation strengthened by 6723 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/852 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 1 (OVERLAPS) 645/1497 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 852 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1497/43032 variables, and 9 constraints, problems are : Problem set: 0 solved, 852 unsolved in 45031 ms.
Refiners :[Positive P Invariants (semi-flows): 9/10 constraints, State Equation: 0/1500 constraints, ReadFeed: 0/6723 constraints, PredecessorRefiner: 852/852 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 852 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/852 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 1 (OVERLAPS) 645/1497 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 852 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1497/43032 variables, and 9 constraints, problems are : Problem set: 0 solved, 852 unsolved in 45061 ms.
Refiners :[Positive P Invariants (semi-flows): 9/10 constraints, State Equation: 0/1500 constraints, ReadFeed: 0/6723 constraints, PredecessorRefiner: 0/852 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 98076ms problems are : Problem set: 0 solved, 852 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 852 out of 1500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1500/1500 places, 41532/41532 transitions.
Graph (complete) has 2426 edges and 1500 vertex of which 1488 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.83 ms
Discarding 12 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 403 transitions
Trivial Post-agglo rules discarded 403 transitions
Performed 403 trivial Post agglomeration. Transition count delta: 403
Iterating post reduction 0 with 409 rules applied. Total rules applied 410 place count 1488 transition count 41117
Reduce places removed 403 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 423 rules applied. Total rules applied 833 place count 1085 transition count 41097
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 842 place count 1076 transition count 41097
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 842 place count 1076 transition count 41050
Deduced a syphon composed of 47 places in 25 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 936 place count 1029 transition count 41050
Discarding 69 places :
Symmetric choice reduction at 3 with 69 rule applications. Total rules 1005 place count 960 transition count 40981
Iterating global reduction 3 with 69 rules applied. Total rules applied 1074 place count 960 transition count 40981
Ensure Unique test removed 38087 transitions
Reduce isomorphic transitions removed 38087 transitions.
Iterating post reduction 3 with 38087 rules applied. Total rules applied 39161 place count 960 transition count 2894
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 39169 place count 952 transition count 2886
Iterating global reduction 4 with 8 rules applied. Total rules applied 39177 place count 952 transition count 2886
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 39185 place count 944 transition count 2878
Iterating global reduction 4 with 8 rules applied. Total rules applied 39193 place count 944 transition count 2878
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 39198 place count 944 transition count 2873
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 39201 place count 941 transition count 2870
Iterating global reduction 5 with 3 rules applied. Total rules applied 39204 place count 941 transition count 2870
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 5 with 19 rules applied. Total rules applied 39223 place count 941 transition count 2851
Performed 10 Post agglomeration using F-continuation condition with reduction of 264 identical transitions.
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 39243 place count 931 transition count 2577
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 6 with 47 rules applied. Total rules applied 39290 place count 931 transition count 2530
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 39300 place count 921 transition count 2520
Iterating global reduction 7 with 10 rules applied. Total rules applied 39310 place count 921 transition count 2520
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 39311 place count 920 transition count 2519
Iterating global reduction 7 with 1 rules applied. Total rules applied 39312 place count 920 transition count 2519
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 39313 place count 920 transition count 2518
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 39331 place count 911 transition count 2509
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 8 with 9 rules applied. Total rules applied 39340 place count 911 transition count 2500
Discarding 9 places :
Symmetric choice reduction at 9 with 9 rule applications. Total rules 39349 place count 902 transition count 2491
Iterating global reduction 9 with 9 rules applied. Total rules applied 39358 place count 902 transition count 2491
Ensure Unique test removed 511 transitions
Reduce isomorphic transitions removed 511 transitions.
Iterating post reduction 9 with 511 rules applied. Total rules applied 39869 place count 902 transition count 1980
Drop transitions (Redundant composition of simpler transitions.) removed 256 transitions
Redundant transition composition rules discarded 256 transitions
Iterating global reduction 10 with 256 rules applied. Total rules applied 40125 place count 902 transition count 1724
Free-agglomeration rule applied 3 times.
Iterating global reduction 10 with 3 rules applied. Total rules applied 40128 place count 902 transition count 1721
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 40131 place count 899 transition count 1721
Drop transitions (Redundant composition of simpler transitions.) removed 128 transitions
Redundant transition composition rules discarded 128 transitions
Iterating global reduction 11 with 128 rules applied. Total rules applied 40259 place count 899 transition count 1593
Applied a total of 40259 rules in 2377 ms. Remains 899 /1500 variables (removed 601) and now considering 1593/41532 (removed 39939) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2377 ms. Remains : 899/1500 places, 1593/41532 transitions.
RANDOM walk for 22185 steps (34 resets) in 1579 ms. (14 steps per ms) remains 0/852 properties
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query StableMarking after proving 1537 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST TOPOLOGICAL
Total runtime 206345 ms.

BK_STOP 1749323263665

--------------------
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
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyB-PT-B11"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is MedleyB-PT-B11, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r259-tall-174931345500318"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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