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

About the Execution of ITS-Tools for ASLink-PT-01a

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

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r002-tall-174853729000286.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 ASLink-PT-01a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-tall-174853729000286
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K 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 6.0K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K 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 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K 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 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 201K 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

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-2025-00
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-2025-01
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-2025-02
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-2025-03
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-2025-04
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-2025-05
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-2025-06
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-2025-07
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-2025-08
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-2025-09
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-2025-10
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-2025-11
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-2025-12
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-2025-13
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-2025-14
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1748566390144

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-01a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-05-30 00:53:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 00:53:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 00:53:11] [INFO ] Load time of PNML (sax parser for PT used): 134 ms
[2025-05-30 00:53:11] [INFO ] Transformed 431 places.
[2025-05-30 00:53:11] [INFO ] Transformed 735 transitions.
[2025-05-30 00:53:11] [INFO ] Found NUPN structural information;
[2025-05-30 00:53:11] [INFO ] Parsed PT model containing 431 places and 735 transitions and 2801 arcs in 256 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 7 transitions
Reduce redundant transitions removed 7 transitions.
FORMULA ASLink-PT-01a-ReachabilityCardinality-2025-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-ReachabilityCardinality-2025-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (723 resets) in 1528 ms. (26 steps per ms) remains 7/14 properties
FORMULA ASLink-PT-01a-ReachabilityCardinality-2025-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-ReachabilityCardinality-2025-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-ReachabilityCardinality-2025-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-ReachabilityCardinality-2025-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-ReachabilityCardinality-2025-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-ReachabilityCardinality-2025-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-ReachabilityCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (293 resets) in 213 ms. (186 steps per ms) remains 5/7 properties
FORMULA ASLink-PT-01a-ReachabilityCardinality-2025-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-01a-ReachabilityCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2025-05-30 00:53:12] [INFO ] Flatten gal took : 210 ms
BEST_FIRST walk for 40002 steps (287 resets) in 291 ms. (136 steps per ms) remains 4/5 properties
FORMULA ASLink-PT-01a-ReachabilityCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (284 resets) in 157 ms. (253 steps per ms) remains 4/4 properties
[2025-05-30 00:53:12] [INFO ] Flatten gal took : 104 ms
BEST_FIRST walk for 40003 steps (280 resets) in 191 ms. (208 steps per ms) remains 4/4 properties
[2025-05-30 00:53:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11895327836991920831.gal : 63 ms
BEST_FIRST walk for 40003 steps (257 resets) in 185 ms. (215 steps per ms) remains 4/4 properties
[2025-05-30 00:53:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10152801446514205266.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/ReachabilityCardinality11895327836991920831.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10152801446514205266.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 ...330
// Phase 1: matrix 728 rows 431 cols
[2025-05-30 00:53:12] [INFO ] Computed 80 invariants in 37 ms
Loading property file /tmp/ReachabilityCardinality10152801446514205266.prop.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :4 after 8
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :8 after 36
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :36 after 70
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :70 after 270
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :270 after 1675
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :1675 after 5670
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :5670 after 6105
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 77/134 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 77/146 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 3/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 14/148 variables, 7/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 14/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :6105 after 29932
At refinement iteration 9 (OVERLAPS) 278/426 variables, 56/226 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/426 variables, 278/504 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/426 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 5/431 variables, 2/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/431 variables, 5/511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :29932 after 81277
At refinement iteration 14 (INCLUDED_ONLY) 0/431 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 728/1159 variables, 431/942 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1159 variables, 0/942 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/1159 variables, 0/942 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1159/1159 variables, and 942 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1289 ms.
Refiners :[Domain max(s): 431/431 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 61/61 constraints, State Equation: 431/431 constraints, PredecessorRefiner: 4/3 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 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 77/134 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 77/146 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem ASLink-PT-01a-ReachabilityCardinality-2025-14 is UNSAT
FORMULA ASLink-PT-01a-ReachabilityCardinality-2025-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 3/149 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/149 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 14/148 variables, 7/156 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 14/170 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 0/170 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem ASLink-PT-01a-ReachabilityCardinality-2025-05 is UNSAT
FORMULA ASLink-PT-01a-ReachabilityCardinality-2025-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-01a-ReachabilityCardinality-2025-13 is UNSAT
FORMULA ASLink-PT-01a-ReachabilityCardinality-2025-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 9 (OVERLAPS) 278/426 variables, 56/226 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/426 variables, 278/504 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/426 variables, 0/504 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/431 variables, 2/506 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/431 variables, 5/511 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/431 variables, 0/511 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 728/1159 variables, 431/942 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1159 variables, 1/943 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1159 variables, 0/943 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1159 variables, 0/943 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1159/1159 variables, and 943 constraints, problems are : Problem set: 3 solved, 1 unsolved in 976 ms.
Refiners :[Domain max(s): 431/431 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 61/61 constraints, State Equation: 431/431 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2438ms problems are : Problem set: 3 solved, 1 unsolved
Parikh walk visited 0 properties in 79 ms.
Support contains 3 out of 431 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 431/431 places, 728/728 transitions.
Ensure Unique test removed 4 places
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 425 transition count 697
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 68 place count 394 transition count 697
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 68 place count 394 transition count 668
Deduced a syphon composed of 29 places in 3 ms
Ensure Unique test removed 11 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 69 rules applied. Total rules applied 137 place count 354 transition count 668
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 138 place count 354 transition count 667
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 139 place count 353 transition count 667
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 143 place count 349 transition count 650
Ensure Unique test removed 1 places
Iterating global reduction 4 with 5 rules applied. Total rules applied 148 place count 348 transition count 650
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 6 rules applied. Total rules applied 154 place count 347 transition count 645
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 157 place count 344 transition count 645
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 158 place count 343 transition count 637
Iterating global reduction 6 with 1 rules applied. Total rules applied 159 place count 343 transition count 637
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 160 place count 342 transition count 629
Iterating global reduction 6 with 1 rules applied. Total rules applied 161 place count 342 transition count 629
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 162 place count 341 transition count 621
Iterating global reduction 6 with 1 rules applied. Total rules applied 163 place count 341 transition count 621
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 164 place count 340 transition count 613
Iterating global reduction 6 with 1 rules applied. Total rules applied 165 place count 340 transition count 613
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 166 place count 339 transition count 605
Iterating global reduction 6 with 1 rules applied. Total rules applied 167 place count 339 transition count 605
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 168 place count 338 transition count 597
Iterating global reduction 6 with 1 rules applied. Total rules applied 169 place count 338 transition count 597
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 170 place count 337 transition count 589
Iterating global reduction 6 with 1 rules applied. Total rules applied 171 place count 337 transition count 589
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 172 place count 336 transition count 581
Iterating global reduction 6 with 1 rules applied. Total rules applied 173 place count 336 transition count 581
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 174 place count 335 transition count 573
Iterating global reduction 6 with 1 rules applied. Total rules applied 175 place count 335 transition count 573
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 176 place count 334 transition count 565
Iterating global reduction 6 with 1 rules applied. Total rules applied 177 place count 334 transition count 565
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 178 place count 333 transition count 557
Iterating global reduction 6 with 1 rules applied. Total rules applied 179 place count 333 transition count 557
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 180 place count 332 transition count 549
Iterating global reduction 6 with 1 rules applied. Total rules applied 181 place count 332 transition count 549
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 182 place count 331 transition count 541
Iterating global reduction 6 with 1 rules applied. Total rules applied 183 place count 331 transition count 541
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 184 place count 330 transition count 533
Iterating global reduction 6 with 1 rules applied. Total rules applied 185 place count 330 transition count 533
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 186 place count 329 transition count 525
Iterating global reduction 6 with 1 rules applied. Total rules applied 187 place count 329 transition count 525
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 201 place count 322 transition count 518
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 203 place count 322 transition count 518
Applied a total of 203 rules in 281 ms. Remains 322 /431 variables (removed 109) and now considering 518/728 (removed 210) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 289 ms. Remains : 322/431 places, 518/728 transitions.
RANDOM walk for 40000 steps (783 resets) in 359 ms. (111 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (338 resets) in 147 ms. (270 steps per ms) remains 1/1 properties
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :81277 after 382978
Finished probabilistic random walk after 470911 steps, run visited all 1 properties in 1748 ms. (steps per millisecond=269 )
Probabilistic random walk after 470911 steps, saw 166601 distinct states, run finished after 1752 ms. (steps per millisecond=268 ) properties seen :1
FORMULA ASLink-PT-01a-ReachabilityCardinality-2025-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 6061 ms.

BK_STOP 1748566397475

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-01a"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-01a.tgz
mv ASLink-PT-01a execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;