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

About the Execution of ITS-Tools for LeafsetExtension-PT-S16C3

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

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 14K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.4K 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 4.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K 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 6 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 905K 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 LeafsetExtension-PT-S16C3-ReachabilityCardinality-2025-00
FORMULA_NAME LeafsetExtension-PT-S16C3-ReachabilityCardinality-2025-01
FORMULA_NAME LeafsetExtension-PT-S16C3-ReachabilityCardinality-2025-02
FORMULA_NAME LeafsetExtension-PT-S16C3-ReachabilityCardinality-2025-03
FORMULA_NAME LeafsetExtension-PT-S16C3-ReachabilityCardinality-2025-04
FORMULA_NAME LeafsetExtension-PT-S16C3-ReachabilityCardinality-2025-05
FORMULA_NAME LeafsetExtension-PT-S16C3-ReachabilityCardinality-2025-06
FORMULA_NAME LeafsetExtension-PT-S16C3-ReachabilityCardinality-2025-07
FORMULA_NAME LeafsetExtension-PT-S16C3-ReachabilityCardinality-2025-08
FORMULA_NAME LeafsetExtension-PT-S16C3-ReachabilityCardinality-2025-09
FORMULA_NAME LeafsetExtension-PT-S16C3-ReachabilityCardinality-2025-10
FORMULA_NAME LeafsetExtension-PT-S16C3-ReachabilityCardinality-2025-11
FORMULA_NAME LeafsetExtension-PT-S16C3-ReachabilityCardinality-2025-12
FORMULA_NAME LeafsetExtension-PT-S16C3-ReachabilityCardinality-2025-13
FORMULA_NAME LeafsetExtension-PT-S16C3-ReachabilityCardinality-2025-14
FORMULA_NAME LeafsetExtension-PT-S16C3-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1748891842414

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S16C3
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-02 19:17:23] [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-06-02 19:17:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 19:17:24] [INFO ] Load time of PNML (sax parser for PT used): 141 ms
[2025-06-02 19:17:24] [INFO ] Transformed 1542 places.
[2025-06-02 19:17:24] [INFO ] Transformed 1449 transitions.
[2025-06-02 19:17:24] [INFO ] Parsed PT model containing 1542 places and 1449 transitions and 4668 arcs in 255 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (1523 resets) in 2034 ms. (19 steps per ms) remains 9/16 properties
FORMULA LeafsetExtension-PT-S16C3-ReachabilityCardinality-2025-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C3-ReachabilityCardinality-2025-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C3-ReachabilityCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C3-ReachabilityCardinality-2025-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C3-ReachabilityCardinality-2025-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C3-ReachabilityCardinality-2025-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C3-ReachabilityCardinality-2025-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-02 19:17:24] [INFO ] Flatten gal took : 213 ms
BEST_FIRST walk for 40004 steps (173 resets) in 151 ms. (263 steps per ms) remains 9/9 properties
[2025-06-02 19:17:24] [INFO ] Flatten gal took : 102 ms
BEST_FIRST walk for 40003 steps (170 resets) in 489 ms. (81 steps per ms) remains 9/9 properties
[2025-06-02 19:17:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3539605599866187171.gal : 125 ms
[2025-06-02 19:17:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7620646446622555185.prop : 9 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/ReachabilityCardinality3539605599866187171.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7620646446622555185.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (174 resets) in 591 ms. (67 steps per ms) remains 9/9 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
BEST_FIRST walk for 40003 steps (169 resets) in 160 ms. (248 steps per ms) remains 9/9 properties
Loading property file /tmp/ReachabilityCardinality7620646446622555185.prop.
BEST_FIRST walk for 40003 steps (173 resets) in 382 ms. (104 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (173 resets) in 161 ms. (246 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (172 resets) in 156 ms. (254 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (169 resets) in 218 ms. (182 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (170 resets) in 97 ms. (408 steps per ms) remains 9/9 properties
// Phase 1: matrix 1449 rows 1542 cols
[2025-06-02 19:17:25] [INFO ] Computed 93 invariants in 88 ms
Excessive predecessor constraint size, skipping predecessor.
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/231 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 6/237 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :12 after 14
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :14 after 15
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :15 after 16
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :16 after 17
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :17 after 24
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :24 after 25
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :25 after 33
At refinement iteration 3 (OVERLAPS) 1287/1524 variables, 69/75 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :33 after 46
SDD proceeding with computation,9 properties remain. new max is 2048
SDD size :46 after 64
SDD proceeding with computation,9 properties remain. new max is 4096
SDD size :64 after 97
SDD proceeding with computation,9 properties remain. new max is 8192
SDD size :97 after 168
At refinement iteration 4 (INCLUDED_ONLY) 0/1524 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem LeafsetExtension-PT-S16C3-ReachabilityCardinality-2025-00 is UNSAT
FORMULA LeafsetExtension-PT-S16C3-ReachabilityCardinality-2025-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S16C3-ReachabilityCardinality-2025-02 is UNSAT
FORMULA LeafsetExtension-PT-S16C3-ReachabilityCardinality-2025-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S16C3-ReachabilityCardinality-2025-07 is UNSAT
FORMULA LeafsetExtension-PT-S16C3-ReachabilityCardinality-2025-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S16C3-ReachabilityCardinality-2025-12 is UNSAT
FORMULA LeafsetExtension-PT-S16C3-ReachabilityCardinality-2025-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 13/1537 variables, 13/88 constraints. Problems are: Problem set: 4 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,9 properties remain. new max is 16384
SDD size :168 after 299
[2025-06-02 19:17:28] [INFO ] Deduced a trap composed of 61 places in 932 ms of which 152 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:17:29] [INFO ] Deduced a trap composed of 61 places in 745 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,9 properties remain. new max is 32768
SDD size :299 after 5616
[2025-06-02 19:17:29] [INFO ] Deduced a trap composed of 61 places in 875 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:17:30] [INFO ] Deduced a trap composed of 61 places in 816 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:17:31] [INFO ] Deduced a trap composed of 61 places in 786 ms of which 104 ms to minimize.
SMT process timed out in 5980ms, After SMT, problems are : Problem set: 4 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 188 out of 1542 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1542/1542 places, 1449/1449 transitions.
Graph (complete) has 2953 edges and 1542 vertex of which 1099 are kept as prefixes of interest. Removing 443 places using SCC suffix rule.5 ms
Discarding 443 places :
Also discarding 107 output transitions
Drop transitions (Output transitions of discarded places.) removed 107 transitions
Drop transitions (Empty/Sink Transition effects.) removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 270 transitions
Trivial Post-agglo rules discarded 270 transitions
Performed 270 trivial Post agglomeration. Transition count delta: 270
Iterating post reduction 0 with 335 rules applied. Total rules applied 336 place count 1099 transition count 1007
Reduce places removed 271 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 280 rules applied. Total rules applied 616 place count 828 transition count 998
Reduce places removed 9 places and 0 transitions.
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Iterating post reduction 2 with 52 rules applied. Total rules applied 668 place count 819 transition count 955
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 3 with 43 rules applied. Total rules applied 711 place count 776 transition count 955
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 27 Pre rules applied. Total rules applied 711 place count 776 transition count 928
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 765 place count 749 transition count 928
Discarding 102 places :
Symmetric choice reduction at 4 with 102 rule applications. Total rules 867 place count 647 transition count 826
Iterating global reduction 4 with 102 rules applied. Total rules applied 969 place count 647 transition count 826
Free-agglomeration rule (complex) applied 40 times.
Iterating global reduction 4 with 40 rules applied. Total rules applied 1009 place count 647 transition count 786
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 4 with 40 rules applied. Total rules applied 1049 place count 607 transition count 786
Partial Free-agglomeration rule applied 32 times.
Drop transitions (Partial Free agglomeration) removed 32 transitions
Iterating global reduction 5 with 32 rules applied. Total rules applied 1081 place count 607 transition count 786
Applied a total of 1081 rules in 240 ms. Remains 607 /1542 variables (removed 935) and now considering 786/1449 (removed 663) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 252 ms. Remains : 607/1542 places, 786/1449 transitions.
RANDOM walk for 40000 steps (2631 resets) in 561 ms. (71 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (210 resets) in 241 ms. (165 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (209 resets) in 407 ms. (98 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (211 resets) in 143 ms. (277 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (211 resets) in 181 ms. (219 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (209 resets) in 143 ms. (277 steps per ms) remains 5/5 properties
SDD proceeding with computation,9 properties remain. new max is 65536
SDD size :5616 after 15341
Interrupted probabilistic random walk after 218837 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :0 out of 5
Probabilistic random walk after 218837 steps, saw 69853 distinct states, run finished after 3005 ms. (steps per millisecond=72 ) properties seen :0
// Phase 1: matrix 786 rows 607 cols
[2025-06-02 19:17:35] [INFO ] Computed 43 invariants in 12 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/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 2/190 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 348/538 variables, 35/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/538 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 10/548 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem LeafsetExtension-PT-S16C3-ReachabilityCardinality-2025-11 is UNSAT
FORMULA LeafsetExtension-PT-S16C3-ReachabilityCardinality-2025-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S16C3-ReachabilityCardinality-2025-14 is UNSAT
FORMULA LeafsetExtension-PT-S16C3-ReachabilityCardinality-2025-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (OVERLAPS) 763/1311 variables, 548/590 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1311 variables, 0/590 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 75/1386 variables, 52/642 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1386 variables, 0/642 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 7/1393 variables, 1/643 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1393 variables, 7/650 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1393 variables, 0/650 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/1393 variables, 0/650 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1393/1393 variables, and 650 constraints, problems are : Problem set: 2 solved, 3 unsolved in 1655 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 607/607 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 3 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 343/479 variables, 30/31 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:17:37] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:17:37] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:17:37] [INFO ] Deduced a trap composed of 34 places in 245 ms of which 36 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/479 variables, 3/34 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/479 variables, 0/34 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1/480 variables, 1/35 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/480 variables, 0/35 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 19/499 variables, 8/43 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:17:38] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 18 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/499 variables, 1/44 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/499 variables, 0/44 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 709/1208 variables, 499/543 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1208 variables, 1/544 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1208 variables, 0/544 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 148/1356 variables, 78/622 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1356 variables, 0/622 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 19/1375 variables, 3/625 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1375 variables, 19/644 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1375 variables, 0/644 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 17/1392 variables, 10/654 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1392 variables, 0/654 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 1/1393 variables, 1/655 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1393 variables, 0/655 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 0/1393 variables, 0/655 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1393/1393 variables, and 655 constraints, problems are : Problem set: 2 solved, 3 unsolved in 2841 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 607/607 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4574ms problems are : Problem set: 2 solved, 3 unsolved
FORMULA LeafsetExtension-PT-S16C3-ReachabilityCardinality-2025-03 FALSE TECHNIQUES PARIKH_WALK
FORMULA LeafsetExtension-PT-S16C3-ReachabilityCardinality-2025-09 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
FORMULA LeafsetExtension-PT-S16C3-ReachabilityCardinality-2025-15 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 3 properties in 39 ms.
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 16243 ms.

BK_STOP 1748891860095

--------------------
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
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
++ sed s/.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="LeafsetExtension-PT-S16C3"
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 LeafsetExtension-PT-S16C3, 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 r114-tall-174876423300742"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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