Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339900454.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is MedleyB-PT-B04, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339900454
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 7.5K Jun 6 09:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Jun 6 09:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Jun 6 09:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K Jun 6 09:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 6 12:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 6 12:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 12:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 10K Jun 6 09:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Jun 6 09:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Jun 6 09:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K Jun 6 09:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 6 12:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 4 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 1005K Jun 5 20:08 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1749390591262

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyB-PT-B04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-08 13:49:52] [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-08 13:49:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 13:49:52] [INFO ] Load time of PNML (sax parser for PT used): 156 ms
[2025-06-08 13:49:52] [INFO ] Transformed 829 places.
[2025-06-08 13:49:52] [INFO ] Transformed 2410 transitions.
[2025-06-08 13:49:52] [INFO ] Found NUPN structural information;
[2025-06-08 13:49:52] [INFO ] Parsed PT model containing 829 places and 2410 transitions and 20118 arcs in 266 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
FORMULA MedleyB-PT-B04-ReachabilityCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B04-ReachabilityCardinality-2025-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B04-ReachabilityCardinality-2025-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B04-ReachabilityCardinality-2025-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (380 resets) in 1987 ms. (20 steps per ms) remains 7/12 properties
FORMULA MedleyB-PT-B04-ReachabilityCardinality-2025-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyB-PT-B04-ReachabilityCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyB-PT-B04-ReachabilityCardinality-2025-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyB-PT-B04-ReachabilityCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyB-PT-B04-ReachabilityCardinality-2025-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (59 resets) in 273 ms. (145 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (59 resets) in 515 ms. (77 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (59 resets) in 185 ms. (215 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (59 resets) in 420 ms. (95 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (58 resets) in 172 ms. (231 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (60 resets) in 102 ms. (388 steps per ms) remains 7/7 properties
[2025-06-08 13:49:55] [INFO ] Flatten gal took : 552 ms
BEST_FIRST walk for 40004 steps (57 resets) in 73 ms. (540 steps per ms) remains 7/7 properties
// Phase 1: matrix 2410 rows 829 cols
[2025-06-08 13:49:55] [INFO ] Computed 7 invariants in 54 ms
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
[2025-06-08 13:49:55] [INFO ] Flatten gal took : 195 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-08 13:49:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5491707105477223804.gal : 134 ms
[2025-06-08 13:49:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16091192388224691558.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/ReachabilityCardinality5491707105477223804.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16091192388224691558.prop' '--nowitness' '--gen-order' 'FOLLOW'
All remaining problems are real, not stopping.

At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 7 unsolved
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem MedleyB-PT-B04-ReachabilityCardinality-2025-07 is UNSAT
FORMULA MedleyB-PT-B04-ReachabilityCardinality-2025-07 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 738/829 variables, 7/98 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/829 variables, 738/836 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Loading property file /tmp/ReachabilityCardinality16091192388224691558.prop.
At refinement iteration 4 (INCLUDED_ONLY) 0/829 variables, 0/836 constraints. Problems are: Problem set: 1 solved, 6 unsolved
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :10 after 13
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :13 after 16
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :16 after 17
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :17 after 149
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :149 after 2115
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :2115 after 9107
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :9107 after 11918
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :11918 after 16390
At refinement iteration 5 (OVERLAPS) 2410/3239 variables, 829/1665 constraints. Problems are: Problem set: 1 solved, 6 unsolved
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :16390 after 43196
At refinement iteration 6 (INCLUDED_ONLY) 0/3239 variables, 0/1665 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/3239 variables, 0/1665 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3239/3239 variables, and 1665 constraints, problems are : Problem set: 1 solved, 6 unsolved in 5048 ms.
Refiners :[Domain max(s): 829/829 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 829/829 constraints, PredecessorRefiner: 7/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 64/64 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/64 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 765/829 variables, 7/71 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/829 variables, 765/836 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,7 properties remain. new max is 8192
SDD size :43196 after 377166
[2025-06-08 13:50:01] [INFO ] Deduced a trap composed of 188 places in 908 ms of which 257 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:50:02] [INFO ] Deduced a trap composed of 188 places in 899 ms of which 192 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:50:03] [INFO ] Deduced a trap composed of 188 places in 895 ms of which 222 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:50:04] [INFO ] Deduced a trap composed of 188 places in 937 ms of which 314 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:50:05] [INFO ] Deduced a trap composed of 188 places in 729 ms of which 161 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:50:05] [INFO ] Deduced a trap composed of 188 places in 606 ms of which 99 ms to minimize.
SMT process timed out in 10648ms, After SMT, problems are : Problem set: 1 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 64 out of 829 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 829/829 places, 2410/2410 transitions.
Graph (trivial) has 726 edges and 829 vertex of which 78 / 829 are part of one of the 13 SCC in 6 ms
Free SCC test removed 65 places
Drop transitions (Empty/Sink Transition effects.) removed 83 transitions
Reduce isomorphic transitions removed 83 transitions.
Graph (complete) has 1582 edges and 764 vertex of which 756 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.21 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 443 transitions
Trivial Post-agglo rules discarded 443 transitions
Performed 443 trivial Post agglomeration. Transition count delta: 443
Iterating post reduction 0 with 446 rules applied. Total rules applied 448 place count 756 transition count 1877
Reduce places removed 443 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 461 rules applied. Total rules applied 909 place count 313 transition count 1859
Reduce places removed 9 places and 0 transitions.
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Iterating post reduction 2 with 42 rules applied. Total rules applied 951 place count 304 transition count 1826
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 34 rules applied. Total rules applied 985 place count 271 transition count 1825
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 985 place count 271 transition count 1809
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 1017 place count 255 transition count 1809
Discarding 37 places :
Symmetric choice reduction at 4 with 37 rule applications. Total rules 1054 place count 218 transition count 1772
Iterating global reduction 4 with 37 rules applied. Total rules applied 1091 place count 218 transition count 1772
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
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 4 with 3 rules applied. Total rules applied 1094 place count 218 transition count 1769
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1095 place count 217 transition count 1769
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1095 place count 217 transition count 1768
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1097 place count 216 transition count 1768
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1105 place count 208 transition count 668
Iterating global reduction 6 with 8 rules applied. Total rules applied 1113 place count 208 transition count 668
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 1116 place count 208 transition count 665
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 7 with 40 rules applied. Total rules applied 1156 place count 188 transition count 645
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1157 place count 188 transition count 644
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1159 place count 186 transition count 642
Iterating global reduction 8 with 2 rules applied. Total rules applied 1161 place count 186 transition count 642
Performed 13 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 8 with 26 rules applied. Total rules applied 1187 place count 173 transition count 647
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1188 place count 173 transition count 646
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1190 place count 173 transition count 644
Free-agglomeration rule applied 35 times.
Iterating global reduction 9 with 35 rules applied. Total rules applied 1225 place count 173 transition count 609
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 9 with 35 rules applied. Total rules applied 1260 place count 138 transition count 609
Drop transitions (Redundant composition of simpler transitions.) removed 120 transitions
Redundant transition composition rules discarded 120 transitions
Iterating global reduction 10 with 120 rules applied. Total rules applied 1380 place count 138 transition count 489
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 1384 place count 138 transition count 489
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 1385 place count 138 transition count 489
Applied a total of 1385 rules in 566 ms. Remains 138 /829 variables (removed 691) and now considering 489/2410 (removed 1921) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 574 ms. Remains : 138/829 places, 489/2410 transitions.
RANDOM walk for 40000 steps (1663 resets) in 489 ms. (81 steps per ms) remains 4/6 properties
FORMULA MedleyB-PT-B04-ReachabilityCardinality-2025-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyB-PT-B04-ReachabilityCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (288 resets) in 198 ms. (201 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (286 resets) in 262 ms. (152 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (284 resets) in 203 ms. (196 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (278 resets) in 181 ms. (219 steps per ms) remains 4/4 properties
// Phase 1: matrix 489 rows 138 cols
[2025-06-08 13:50:06] [INFO ] Computed 6 invariants in 5 ms
[2025-06-08 13:50:06] [INFO ] State equation strengthened by 249 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 110/131 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 482/613 variables, 131/137 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/613 variables, 112/249 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/613 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 12/625 variables, 5/254 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/625 variables, 137/391 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/625 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/627 variables, 2/393 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/627 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/627 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 627/627 variables, and 393 constraints, problems are : Problem set: 0 solved, 4 unsolved in 440 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 138/138 constraints, ReadFeed: 249/249 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/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 110/131 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:50:07] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:50:07] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 13 ms to minimize.
Problem MedleyB-PT-B04-ReachabilityCardinality-2025-00 is UNSAT
FORMULA MedleyB-PT-B04-ReachabilityCardinality-2025-00 FALSE TECHNIQUES SMT_REFINEMENT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:50:07] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:50:07] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 4/10 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 482/613 variables, 131/141 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/613 variables, 112/253 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/613 variables, 2/255 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/613 variables, 0/255 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 12/625 variables, 5/260 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/625 variables, 137/397 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/625 variables, 1/398 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/625 variables, 0/398 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2/627 variables, 2/400 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/627 variables, 0/400 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/627 variables, 0/400 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 627/627 variables, and 400 constraints, problems are : Problem set: 1 solved, 3 unsolved in 2584 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 138/138 constraints, ReadFeed: 249/249 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3080ms problems are : Problem set: 1 solved, 3 unsolved
Parikh walk visited 0 properties in 267 ms.
Support contains 17 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 489/489 transitions.
Graph (trivial) has 93 edges and 138 vertex of which 14 / 138 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (complete) has 456 edges and 131 vertex of which 129 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 34 rules applied. Total rules applied 36 place count 129 transition count 440
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
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 1 with 36 rules applied. Total rules applied 72 place count 97 transition count 436
Reduce places removed 1 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 6 rules applied. Total rules applied 78 place count 96 transition count 431
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 83 place count 91 transition count 431
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 83 place count 91 transition count 427
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 91 place count 87 transition count 427
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 100 place count 78 transition count 418
Iterating global reduction 4 with 9 rules applied. Total rules applied 109 place count 78 transition count 418
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 110 place count 77 transition count 416
Iterating global reduction 4 with 1 rules applied. Total rules applied 111 place count 77 transition count 416
Performed 8 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 127 place count 69 transition count 384
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 4 with 64 rules applied. Total rules applied 191 place count 69 transition count 320
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 193 place count 67 transition count 317
Iterating global reduction 5 with 2 rules applied. Total rules applied 195 place count 67 transition count 317
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 205 place count 67 transition count 307
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 207 place count 66 transition count 313
Free-agglomeration rule applied 12 times with reduction of 16 identical transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 219 place count 66 transition count 285
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 5 with 28 rules applied. Total rules applied 247 place count 54 transition count 269
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 257 place count 54 transition count 259
Applied a total of 257 rules in 95 ms. Remains 54 /138 variables (removed 84) and now considering 259/489 (removed 230) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 54/138 places, 259/489 transitions.
RANDOM walk for 5425 steps (309 resets) in 147 ms. (36 steps per ms) remains 0/3 properties
FORMULA MedleyB-PT-B04-ReachabilityCardinality-2025-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyB-PT-B04-ReachabilityCardinality-2025-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyB-PT-B04-ReachabilityCardinality-2025-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_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 17928 ms.

BK_STOP 1749390610391

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="MedleyB-PT-B04"
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 MedleyB-PT-B04, 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 r254-tall-174931339900454"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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