fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r133-smll-174876529500168
Last Updated
June 24, 2025

About the Execution of ITS-Tools for MedleyA-PT-22

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 38635.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.r133-smll-174876529500168.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 MedleyA-PT-22, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r133-smll-174876529500168
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 708K
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 238K May 29 14:32 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 1748845381839

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=MedleyA-PT-22
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StableMarking PT
Running Version 202505121319
[2025-06-02 06:23:04] [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-02 06:23:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 06:23:04] [INFO ] Load time of PNML (sax parser for PT used): 241 ms
[2025-06-02 06:23:04] [INFO ] Transformed 307 places.
[2025-06-02 06:23:04] [INFO ] Transformed 740 transitions.
[2025-06-02 06:23:04] [INFO ] Found NUPN structural information;
[2025-06-02 06:23:05] [INFO ] Parsed PT model containing 307 places and 740 transitions and 3829 arcs in 484 ms.
Structural test allowed to assert that 48 places are NOT stable. Took 15 ms.
[2025-06-02 06:23:06] [INFO ] Flatten gal took : 500 ms
RANDOM walk for 40000 steps (1154 resets) in 3951 ms. (10 steps per ms) remains 148/259 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 148/148 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 148/148 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 148/148 properties
BEST_FIRST walk for 403 steps (8 resets) in 23 ms. (16 steps per ms) remains 148/148 properties
BEST_FIRST walk for 403 steps (8 resets) in 22 ms. (17 steps per ms) remains 148/148 properties
BEST_FIRST walk for 402 steps (8 resets) in 15 ms. (25 steps per ms) remains 148/148 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 148/148 properties
[2025-06-02 06:23:06] [INFO ] Flatten gal took : 121 ms
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 148/148 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 148/148 properties
BEST_FIRST walk for 402 steps (8 resets) in 14 ms. (26 steps per ms) remains 148/148 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 148/148 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 148/148 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 148/148 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 148/148 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 148/148 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 148/148 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 148/148 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 148/148 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 148/148 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 148/148 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 148/148 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 148/148 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 148/148 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 148/148 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 148/148 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 148/148 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 148/148 properties
BEST_FIRST walk for 401 steps (8 resets) in 11 ms. (33 steps per ms) remains 148/148 properties
[2025-06-02 06:23:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8748969352854394917.gal : 91 ms
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 148/148 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 148/148 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 148/148 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 148/148 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 148/148 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 148/148 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 148/148 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 148/148 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 148/148 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 148/148 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 148/148 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 148/148 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 148/148 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 148/148 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 148/148 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 148/148 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 148/148 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 148/148 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 148/148 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 148/148 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 148/148 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 148/148 properties
[2025-06-02 06:23:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14684875919432262804.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8748969352854394917.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14684875919432262804.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 ...329
// Phase 1: matrix 740 rows 307 cols
[2025-06-02 06:23:06] [INFO ] Computed 24 invariants in 39 ms
Loading property file /tmp/ReachabilityCardinality14684875919432262804.prop.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
SDD proceeding with computation,148 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,148 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,148 properties remain. new max is 16
SDD size :7 after 19
SDD proceeding with computation,148 properties remain. new max is 32
SDD size :19 after 47
SDD proceeding with computation,148 properties remain. new max is 64
SDD size :47 after 403
SDD proceeding with computation,148 properties remain. new max is 128
SDD size :403 after 1607
SDD proceeding with computation,148 properties remain. new max is 256
SDD size :1607 after 52703
Invariant property smplace_66 does not hold.
Invariant property smplace_23 does not hold.
SDD proceeding with computation,146 properties remain. new max is 256
SDD size :52703 after 54502
SDD proceeding with computation,146 properties remain. new max is 512
SDD size :54502 after 57198
Invariant property smplace_180 does not hold.
Invariant property smplace_179 does not hold.
Invariant property smplace_178 does not hold.
Invariant property smplace_177 does not hold.
Invariant property smplace_176 does not hold.
Invariant property smplace_175 does not hold.
Invariant property smplace_174 does not hold.
Invariant property smplace_173 does not hold.
Invariant property smplace_172 does not hold.
Invariant property smplace_171 does not hold.
Invariant property smplace_117 does not hold.
Invariant property smplace_105 does not hold.
Invariant property smplace_104 does not hold.
Invariant property smplace_55 does not hold.
Invariant property smplace_25 does not hold.
Invariant property smplace_11 does not hold.
SDD proceeding with computation,130 properties remain. new max is 512
SDD size :57198 after 77178
Invariant property smplace_10 does not hold.
SDD proceeding with computation,129 properties remain. new max is 512
SDD size :77178 after 87260
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 148/148 constraints. Problems are: Problem set: 0 solved, 148 unsolved
SDD proceeding with computation,129 properties remain. new max is 1024
SDD size :87260 after 105863
SDD proceeding with computation,129 properties remain. new max is 2048
SDD size :105863 after 180612
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 0/148 constraints. Problems are: Problem set: 19 solved, 129 unsolved
Invariant property smplace_122 does not hold.
Invariant property smplace_108 does not hold.
At refinement iteration 2 (OVERLAPS) 70/218 variables, 6/154 constraints. Problems are: Problem set: 21 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/218 variables, 70/224 constraints. Problems are: Problem set: 21 solved, 127 unsolved
SDD proceeding with computation,127 properties remain. new max is 2048
SDD size :180612 after 419346
Invariant property smplace_156 does not hold.
Invariant property smplace_145 does not hold.
Invariant property smplace_124 does not hold.
Invariant property smplace_115 does not hold.
Invariant property smplace_110 does not hold.
Invariant property smplace_101 does not hold.
Invariant property smplace_90 does not hold.
Invariant property smplace_89 does not hold.
Invariant property smplace_88 does not hold.
Invariant property smplace_87 does not hold.
Invariant property smplace_86 does not hold.
Invariant property smplace_85 does not hold.
Invariant property smplace_84 does not hold.
Invariant property smplace_83 does not hold.
Invariant property smplace_82 does not hold.
Invariant property smplace_81 does not hold.
Invariant property smplace_39 does not hold.
Invariant property smplace_32 does not hold.
Invariant property smplace_27 does not hold.
Invariant property smplace_18 does not hold.
Invariant property smplace_15 does not hold.
Invariant property smplace_14 does not hold.
SDD proceeding with computation,105 properties remain. new max is 2048
SDD size :419346 after 823681
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 0/224 constraints. Problems are: Problem set: 43 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 29/247 variables, 4/228 constraints. Problems are: Problem set: 43 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 29/257 constraints. Problems are: Problem set: 43 solved, 105 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s6 0.0)
(s8 (/ 31.0 56.0))
(s10 (/ 1.0 56.0))
(s11 (/ 1.0 56.0))
(s12 (/ 1.0 56.0))
(s13 (/ 1.0 56.0))
(s14 (/ 1.0 56.0))
(s15 (/ 1.0 56.0))
(s16 0.0)
(s18 (/ 1.0 56.0))
(s19 (/ 1.0 56.0))
(s20 0.0)
(s21 0.0)
(s23 (/ 1.0 56.0))
(s25 (/ 1.0 56.0))
(s26 (/ 1.0 56.0))
(s27 (/ 1.0 56.0))
(s28 (/ 1.0 56.0))
(s31 0.0)
(s32 (/ 1.0 56.0))
(s33 (/ 1.0 56.0))
(s34 0.0)
(s35 (/ 17.0 28.0))
(s36 0.0)
(s37 0.0)
(s39 (/ 1.0 56.0))
(s40 (/ 1.0 56.0))
(s41 (/ 1.0 56.0))
(s42 (/ 1.0 56.0))
(s48 (/ 1.0 56.0))
(s49 (/ 1.0 56.0))
(s50 (/ 1.0 56.0))
(s51 (/ 1.0 56.0))
(s52 (/ 1.0 56.0))
(s53 (/ 1.0 56.0))
(s55 (/ 1.0 56.0))
(s58 (/ 1.0 56.0))
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 (/ 1.0 56.0))
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 (/ 1.0 56.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 247/1047 variables, and 257 constraints, problems are : Problem set: 43 solved, 105 unsolved in 5144 ms.
Refiners :[Domain max(s): 247/307 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 0/14 constraints, State Equation: 0/307 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 43 solved, 105 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 105/105 constraints. Problems are: Problem set: 43 solved, 105 unsolved
SDD proceeding with computation,105 properties remain. new max is 4096
SDD size :823681 after 1.14047e+06
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/105 constraints. Problems are: Problem set: 43 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 101/206 variables, 6/111 constraints. Problems are: Problem set: 43 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 101/212 constraints. Problems are: Problem set: 43 solved, 105 unsolved
SDD proceeding with computation,105 properties remain. new max is 8192
SDD size :1.14047e+06 after 1.61494e+06
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/212 constraints. Problems are: Problem set: 43 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 29/235 variables, 4/216 constraints. Problems are: Problem set: 43 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 29/245 constraints. Problems are: Problem set: 43 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:23:15] [INFO ] Deduced a trap composed of 22 places in 151 ms of which 23 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 1/246 constraints. Problems are: Problem set: 43 solved, 105 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 235/1047 variables, and 246 constraints, problems are : Problem set: 43 solved, 105 unsolved in 5023 ms.
Refiners :[Domain max(s): 235/307 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 0/14 constraints, State Equation: 0/307 constraints, PredecessorRefiner: 0/148 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10430ms problems are : Problem set: 43 solved, 105 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 105 out of 307 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 307/307 places, 740/740 transitions.
Graph (complete) has 1184 edges and 307 vertex of which 300 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.9 ms
Discarding 7 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 300 transition count 703
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 73 place count 267 transition count 698
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 73 place count 267 transition count 694
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 81 place count 263 transition count 694
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 118 place count 226 transition count 648
Iterating global reduction 2 with 37 rules applied. Total rules applied 155 place count 226 transition count 648
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 164 place count 217 transition count 625
Iterating global reduction 2 with 9 rules applied. Total rules applied 173 place count 217 transition count 625
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 177 place count 213 transition count 615
Iterating global reduction 2 with 4 rules applied. Total rules applied 181 place count 213 transition count 615
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 183 place count 211 transition count 609
Iterating global reduction 2 with 2 rules applied. Total rules applied 185 place count 211 transition count 609
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 235 place count 186 transition count 584
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 238 place count 183 transition count 581
Iterating global reduction 2 with 3 rules applied. Total rules applied 241 place count 183 transition count 581
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 249 place count 179 transition count 612
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 2 with 14 rules applied. Total rules applied 263 place count 179 transition count 598
Free-agglomeration rule applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 269 place count 179 transition count 592
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 275 place count 173 transition count 592
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 281 place count 173 transition count 596
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 287 place count 167 transition count 596
Applied a total of 287 rules in 426 ms. Remains 167 /307 variables (removed 140) and now considering 596/740 (removed 144) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 446 ms. Remains : 167/307 places, 596/740 transitions.
Invariant property smplace_270 does not hold.
Invariant property smplace_265 does not hold.
Invariant property smplace_207 does not hold.
Invariant property smplace_195 does not hold.
Invariant property smplace_129 does not hold.
Invariant property smplace_100 does not hold.
Invariant property smplace_96 does not hold.
Invariant property smplace_58 does not hold.
Invariant property smplace_53 does not hold.
Invariant property smplace_51 does not hold.
Invariant property smplace_50 does not hold.
Invariant property smplace_48 does not hold.
Invariant property smplace_42 does not hold.
Invariant property smplace_41 does not hold.
Invariant property smplace_26 does not hold.
Invariant property smplace_13 does not hold.
Invariant property smplace_12 does not hold.
SDD proceeding with computation,88 properties remain. new max is 8192
SDD size :1.61494e+06 after 2.05997e+07
Invariant property smplace_49 does not hold.
SDD proceeding with computation,87 properties remain. new max is 8192
SDD size :2.05997e+07 after 2.52986e+07
RANDOM walk for 4000000 steps (701274 resets) in 52655 ms. (75 steps per ms) remains 1/105 properties
SDD proceeding with computation,87 properties remain. new max is 16384
SDD size :2.52986e+07 after 2.83833e+07
BEST_FIRST walk for 4000001 steps (106494 resets) in 8168 ms. (489 steps per ms) remains 1/1 properties
[2025-06-02 06:23:33] [INFO ] Flow matrix only has 536 transitions (discarded 60 similar events)
// Phase 1: matrix 536 rows 167 cols
[2025-06-02 06:23:33] [INFO ] Computed 23 invariants in 5 ms
[2025-06-02 06:23:33] [INFO ] State equation strengthened by 163 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/40 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/52 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 51/103 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 58/161 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/166 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/166 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 536/702 variables, 166/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/702 variables, 163/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/702 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/703 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/703 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/703 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 703/703 variables, and 353 constraints, problems are : Problem set: 0 solved, 1 unsolved in 397 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 167/167 constraints, ReadFeed: 163/163 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
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/40 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/52 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 51/103 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 58/161 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/166 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/166 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 536/702 variables, 166/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/702 variables, 163/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/702 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:23:34] [INFO ] Deduced a trap along path composed of 2 places in 36 ms of which 7 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/702 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/702 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/703 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/703 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/703 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 703/703 variables, and 355 constraints, problems are : Problem set: 0 solved, 1 unsolved in 856 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 167/167 constraints, ReadFeed: 163/163 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1280ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 59 ms.
Support contains 1 out of 167 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 167/167 places, 596/596 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 167 transition count 576
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 44 place count 147 transition count 572
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 66 place count 125 transition count 544
Iterating global reduction 2 with 22 rules applied. Total rules applied 88 place count 125 transition count 544
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 98 place count 115 transition count 516
Iterating global reduction 2 with 10 rules applied. Total rules applied 108 place count 115 transition count 516
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 110 place count 113 transition count 511
Iterating global reduction 2 with 2 rules applied. Total rules applied 112 place count 113 transition count 511
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 112 transition count 508
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 112 transition count 508
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 136 place count 101 transition count 497
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 139 place count 98 transition count 491
Iterating global reduction 2 with 3 rules applied. Total rules applied 142 place count 98 transition count 491
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 148 place count 95 transition count 509
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 150 place count 93 transition count 491
Iterating global reduction 2 with 2 rules applied. Total rules applied 152 place count 93 transition count 491
Free-agglomeration rule applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 158 place count 93 transition count 485
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 164 place count 87 transition count 485
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 170 place count 81 transition count 443
Iterating global reduction 3 with 6 rules applied. Total rules applied 176 place count 81 transition count 443
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 3 with 11 rules applied. Total rules applied 187 place count 81 transition count 566
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 216 place count 70 transition count 548
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 218 place count 70 transition count 546
Applied a total of 218 rules in 302 ms. Remains 70 /167 variables (removed 97) and now considering 546/596 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 302 ms. Remains : 70/167 places, 546/596 transitions.
RANDOM walk for 742670 steps (143217 resets) in 9239 ms. (80 steps per ms) remains 0/1 properties
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query StableMarking after proving 260 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST DECISION_DIAGRAMS COLLATERAL_PROCESSING TOPOLOGICAL
Total runtime 35947 ms.

BK_STOP 1748845420474

--------------------
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
++ 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.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="MedleyA-PT-22"
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 MedleyA-PT-22, 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 r133-smll-174876529500168"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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