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

About the Execution of ITS-Tools for DES-PT-05b

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 73K 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 1748587903072

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DES-PT-05b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StableMarking PT
Running Version 202505121319
[2025-05-30 06:51:44] [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-05-30 06:51:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 06:51:45] [INFO ] Load time of PNML (sax parser for PT used): 129 ms
[2025-05-30 06:51:45] [INFO ] Transformed 300 places.
[2025-05-30 06:51:45] [INFO ] Transformed 251 transitions.
[2025-05-30 06:51:45] [INFO ] Found NUPN structural information;
[2025-05-30 06:51:45] [INFO ] Parsed PT model containing 300 places and 251 transitions and 747 arcs in 296 ms.
Structural test allowed to assert that 87 places are NOT stable. Took 10 ms.
RANDOM walk for 40000 steps (344 resets) in 2053 ms. (19 steps per ms) remains 10/213 properties
BEST_FIRST walk for 40004 steps (44 resets) in 324 ms. (123 steps per ms) remains 10/10 properties
[2025-05-30 06:51:46] [INFO ] Flatten gal took : 155 ms
BEST_FIRST walk for 40004 steps (45 resets) in 205 ms. (194 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (47 resets) in 126 ms. (314 steps per ms) remains 10/10 properties
[2025-05-30 06:51:46] [INFO ] Flatten gal took : 80 ms
[2025-05-30 06:51:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5362551148462928641.gal : 48 ms
BEST_FIRST walk for 40003 steps (45 resets) in 192 ms. (207 steps per ms) remains 10/10 properties
[2025-05-30 06:51:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4495951397550693121.prop : 1 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/ReachabilityCardinality5362551148462928641.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4495951397550693121.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (46 resets) in 217 ms. (183 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (44 resets) in 250 ms. (159 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (46 resets) in 252 ms. (158 steps per ms) remains 10/10 properties

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 ...328
Loading property file /tmp/ReachabilityCardinality4495951397550693121.prop.
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :4 after 12
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :12 after 15
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :15 after 19
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :19 after 89
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :89 after 314
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :314 after 4679
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :4679 after 56171
BEST_FIRST walk for 40003 steps (44 resets) in 288 ms. (138 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (47 resets) in 154 ms. (258 steps per ms) remains 9/9 properties
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :56171 after 2.77292e+06
// Phase 1: matrix 251 rows 300 cols
[2025-05-30 06:51:47] [INFO ] Computed 65 invariants in 46 ms
SDD proceeding with computation,10 properties remain. new max is 4096
SDD size :2.77292e+06 after 1.56961e+08
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 20/29 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SDD proceeding with computation,10 properties remain. new max is 8192
SDD size :1.56961e+08 after 3.89963e+08
At refinement iteration 5 (OVERLAPS) 216/245 variables, 36/69 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 216/285 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 55/300 variables, 25/310 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 55/365 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/300 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 251/551 variables, 300/665 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/551 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 0/551 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 665 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1632 ms.
Refiners :[Domain max(s): 300/300 constraints, Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SDD proceeding with computation,10 properties remain. new max is 16384
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SDD size :2.29329e+13 after 2.33878e+13
At refinement iteration 2 (OVERLAPS) 20/29 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 216/245 variables, 36/69 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 216/285 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:51:49] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:51:49] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:51:49] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 3/288 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 55/300 variables, 25/313 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/300 variables, 55/368 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:51:49] [INFO ] Deduced a trap composed of 29 places in 139 ms of which 19 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/300 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/300 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 251/551 variables, 300/669 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/551 variables, 9/678 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/551 variables, 0/678 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 0/551 variables, 0/678 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 551/551 variables, and 678 constraints, problems are : Problem set: 0 solved, 9 unsolved in 3041 ms.
Refiners :[Domain max(s): 300/300 constraints, Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4865ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 8 different solutions.
SDD proceeding with computation,10 properties remain. new max is 32768
SDD size :2.33878e+13 after 7.30825e+13
SDD proceeding with computation,10 properties remain. new max is 65536
SDD size :7.30825e+13 after 1.12716e+14
Parikh walk visited 2 properties in 10183 ms.
Support contains 7 out of 300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 251/251 transitions.
Graph (complete) has 561 edges and 300 vertex of which 294 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 294 transition count 224
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 45 place count 273 transition count 224
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 45 place count 273 transition count 215
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 63 place count 264 transition count 215
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 82 place count 245 transition count 196
Iterating global reduction 2 with 19 rules applied. Total rules applied 101 place count 245 transition count 196
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 101 place count 245 transition count 195
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 244 transition count 195
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 118 place count 229 transition count 180
Iterating global reduction 2 with 15 rules applied. Total rules applied 133 place count 229 transition count 180
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 15 rules applied. Total rules applied 148 place count 229 transition count 165
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 151 place count 227 transition count 164
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 151 place count 227 transition count 161
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 157 place count 224 transition count 161
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 311 place count 147 transition count 84
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 315 place count 145 transition count 86
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 316 place count 145 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 317 place count 144 transition count 85
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 318 place count 143 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 319 place count 142 transition count 84
Applied a total of 319 rules in 160 ms. Remains 142 /300 variables (removed 158) and now considering 84/251 (removed 167) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 142/300 places, 84/251 transitions.
RANDOM walk for 4000000 steps (191496 resets) in 18256 ms. (219 steps per ms) remains 4/7 properties
SDD proceeding with computation,10 properties remain. new max is 131072
SDD size :1.12716e+14 after 1.59312e+14
BEST_FIRST walk for 4000002 steps (36597 resets) in 5514 ms. (725 steps per ms) remains 4/4 properties
BEST_FIRST walk for 4000003 steps (36561 resets) in 5774 ms. (692 steps per ms) remains 4/4 properties
BEST_FIRST walk for 4000002 steps (36468 resets) in 5793 ms. (690 steps per ms) remains 4/4 properties
BEST_FIRST walk for 4000003 steps (36513 resets) in 5424 ms. (737 steps per ms) remains 4/4 properties
// Phase 1: matrix 84 rows 142 cols
[2025-05-30 06:52:13] [INFO ] Computed 64 invariants in 6 ms
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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 21/25 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 38/63 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 35/98 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 25/123 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 7/130 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 80/210 variables, 130/189 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/210 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 14/224 variables, 10/199 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/224 variables, 4/203 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/224 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 2/226 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/226 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/226 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/226 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 226/226 variables, and 206 constraints, problems are : Problem set: 0 solved, 4 unsolved in 313 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 21/25 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 38/63 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:52:14] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 35/98 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 25/123 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 7/130 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/130 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 80/210 variables, 130/190 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/210 variables, 4/194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/210 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 14/224 variables, 10/204 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/224 variables, 4/208 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:52:14] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:52:14] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/224 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/224 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 2/226 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/226 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:52:14] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/226 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/226 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 0/226 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 226/226 variables, and 214 constraints, problems are : Problem set: 0 solved, 4 unsolved in 724 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1057ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 1553 ms.
Support contains 4 out of 142 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 142/142 places, 84/84 transitions.
Applied a total of 0 rules in 6 ms. Remains 142 /142 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 142/142 places, 84/84 transitions.
RANDOM walk for 4000000 steps (191117 resets) in 14631 ms. (273 steps per ms) remains 4/4 properties
BEST_FIRST walk for 4000002 steps (36827 resets) in 5947 ms. (672 steps per ms) remains 4/4 properties
BEST_FIRST walk for 4000004 steps (36475 resets) in 5416 ms. (738 steps per ms) remains 4/4 properties
BEST_FIRST walk for 4000004 steps (36439 resets) in 6194 ms. (645 steps per ms) remains 4/4 properties
BEST_FIRST walk for 4000002 steps (36447 resets) in 5910 ms. (676 steps per ms) remains 4/4 properties
SDD proceeding with computation,10 properties remain. new max is 262144
Finished probabilistic random walk after 68176 steps, run visited all 4 properties in 462 ms. (steps per millisecond=147 )
Probabilistic random walk after 68176 steps, saw 18151 distinct states, run finished after 468 ms. (steps per millisecond=145 ) properties seen :4
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query StableMarking after proving 214 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 42620 ms.

BK_STOP 1748587947630

--------------------
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="DES-PT-05b"
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 DES-PT-05b, 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 r063-smll-174854070500173"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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