Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 107K 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 MedleyA-PT-10-ReachabilityCardinality-2025-00
FORMULA_NAME MedleyA-PT-10-ReachabilityCardinality-2025-01
FORMULA_NAME MedleyA-PT-10-ReachabilityCardinality-2025-02
FORMULA_NAME MedleyA-PT-10-ReachabilityCardinality-2025-03
FORMULA_NAME MedleyA-PT-10-ReachabilityCardinality-2025-04
FORMULA_NAME MedleyA-PT-10-ReachabilityCardinality-2025-05
FORMULA_NAME MedleyA-PT-10-ReachabilityCardinality-2025-06
FORMULA_NAME MedleyA-PT-10-ReachabilityCardinality-2025-07
FORMULA_NAME MedleyA-PT-10-ReachabilityCardinality-2025-08
FORMULA_NAME MedleyA-PT-10-ReachabilityCardinality-2025-09
FORMULA_NAME MedleyA-PT-10-ReachabilityCardinality-2025-10
FORMULA_NAME MedleyA-PT-10-ReachabilityCardinality-2025-11
FORMULA_NAME MedleyA-PT-10-ReachabilityCardinality-2025-12
FORMULA_NAME MedleyA-PT-10-ReachabilityCardinality-2025-13
FORMULA_NAME MedleyA-PT-10-ReachabilityCardinality-2025-14
FORMULA_NAME MedleyA-PT-10-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1748857641902

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-02 09:47:24] [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 09:47:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 09:47:25] [INFO ] Load time of PNML (sax parser for PT used): 222 ms
[2025-06-02 09:47:25] [INFO ] Transformed 149 places.
[2025-06-02 09:47:25] [INFO ] Transformed 340 transitions.
[2025-06-02 09:47:25] [INFO ] Found NUPN structural information;
[2025-06-02 09:47:25] [INFO ] Parsed PT model containing 149 places and 340 transitions and 1721 arcs in 604 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 48 ms.
Working with output stream class java.io.PrintStream
FORMULA MedleyA-PT-10-ReachabilityCardinality-2025-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 09:47:26] [INFO ] Flatten gal took : 275 ms
RANDOM walk for 40000 steps (1766 resets) in 3105 ms. (12 steps per ms) remains 10/15 properties
FORMULA MedleyA-PT-10-ReachabilityCardinality-2025-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-10-ReachabilityCardinality-2025-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-10-ReachabilityCardinality-2025-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-10-ReachabilityCardinality-2025-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-10-ReachabilityCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-02 09:47:26] [INFO ] Flatten gal took : 132 ms
BEST_FIRST walk for 40004 steps (427 resets) in 388 ms. (102 steps per ms) remains 10/10 properties
[2025-06-02 09:47:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3875230776155843029.gal : 93 ms
BEST_FIRST walk for 40003 steps (485 resets) in 608 ms. (65 steps per ms) remains 10/10 properties
[2025-06-02 09:47:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15672779370884633933.prop : 5 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/ReachabilityCardinality3875230776155843029.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15672779370884633933.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40002 steps (455 resets) in 288 ms. (138 steps per ms) remains 10/10 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40004 steps (422 resets) in 376 ms. (106 steps per ms) remains 10/10 properties
Loading property file /tmp/ReachabilityCardinality15672779370884633933.prop.
BEST_FIRST walk for 40002 steps (502 resets) in 401 ms. (99 steps per ms) remains 10/10 properties
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :7 after 17
BEST_FIRST walk for 40003 steps (434 resets) in 158 ms. (251 steps per ms) remains 10/10 properties
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :17 after 40
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :40 after 97
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :97 after 2769
BEST_FIRST walk for 40003 steps (434 resets) in 230 ms. (173 steps per ms) remains 10/10 properties
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :2769 after 4119
BEST_FIRST walk for 40003 steps (459 resets) in 296 ms. (134 steps per ms) remains 10/10 properties
Reachability property MedleyA-PT-10-ReachabilityCardinality-2025-15 is true.
FORMULA MedleyA-PT-10-ReachabilityCardinality-2025-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
BEST_FIRST walk for 40004 steps (429 resets) in 261 ms. (152 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (422 resets) in 138 ms. (287 steps per ms) remains 10/10 properties
Reachability property MedleyA-PT-10-ReachabilityCardinality-2025-12 is true.
FORMULA MedleyA-PT-10-ReachabilityCardinality-2025-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
// Phase 1: matrix 340 rows 149 cols
[2025-06-02 09:47:27] [INFO ] Computed 12 invariants in 32 ms
Excessive predecessor constraint size, skipping predecessor.
Reachability property MedleyA-PT-10-ReachabilityCardinality-2025-08 is true.
FORMULA MedleyA-PT-10-ReachabilityCardinality-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Invariant property MedleyA-PT-10-ReachabilityCardinality-2025-07 does not hold.
FORMULA MedleyA-PT-10-ReachabilityCardinality-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :4119 after 36674
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :36674 after 90239
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :90239 after 262043
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 85/85 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/85 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Problem MedleyA-PT-10-ReachabilityCardinality-2025-09 is UNSAT
FORMULA MedleyA-PT-10-ReachabilityCardinality-2025-09 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 40/125 variables, 7/92 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 40/132 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/132 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 24/149 variables, 5/137 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 24/161 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/161 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 340/489 variables, 149/310 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/489 variables, 0/310 constraints. Problems are: Problem set: 3 solved, 5 unsolved
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :262043 after 610064
At refinement iteration 10 (OVERLAPS) 0/489 variables, 0/310 constraints. Problems are: Problem set: 3 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 489/489 variables, and 310 constraints, problems are : Problem set: 3 solved, 5 unsolved in 1301 ms.
Refiners :[Domain max(s): 149/149 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 8/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 5 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 65/65 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/65 constraints. Problems are: Problem set: 3 solved, 5 unsolved
Problem MedleyA-PT-10-ReachabilityCardinality-2025-01 is UNSAT
FORMULA MedleyA-PT-10-ReachabilityCardinality-2025-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem MedleyA-PT-10-ReachabilityCardinality-2025-03 is UNSAT
FORMULA MedleyA-PT-10-ReachabilityCardinality-2025-03 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 56/121 variables, 7/72 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 56/128 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/128 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 28/149 variables, 5/133 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 28/161 constraints. Problems are: Problem set: 5 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:47:29] [INFO ] Deduced a trap composed of 21 places in 256 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:47:29] [INFO ] Deduced a trap composed of 18 places in 200 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:47:29] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:47:30] [INFO ] Deduced a trap composed of 24 places in 177 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:47:30] [INFO ] Deduced a trap composed of 20 places in 198 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:47:30] [INFO ] Deduced a trap composed of 41 places in 156 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:47:30] [INFO ] Deduced a trap composed of 42 places in 158 ms of which 16 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 7/168 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 0/168 constraints. Problems are: Problem set: 5 solved, 3 unsolved
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :610064 after 1.23274e+06
At refinement iteration 9 (OVERLAPS) 340/489 variables, 149/317 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/489 variables, 2/319 constraints. Problems are: Problem set: 5 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:47:31] [INFO ] Deduced a trap composed of 24 places in 226 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:47:31] [INFO ] Deduced a trap composed of 29 places in 188 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:47:31] [INFO ] Deduced a trap composed of 31 places in 149 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:47:31] [INFO ] Deduced a trap composed of 32 places in 134 ms of which 16 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/489 variables, 4/323 constraints. Problems are: Problem set: 5 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:47:32] [INFO ] Deduced a trap along path composed of 3 places in 48 ms of which 13 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/489 variables, 1/324 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/489 variables, 0/324 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/489 variables, 0/324 constraints. Problems are: Problem set: 5 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 489/489 variables, and 324 constraints, problems are : Problem set: 5 solved, 3 unsolved in 4024 ms.
Refiners :[Domain max(s): 149/149 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 5559ms problems are : Problem set: 5 solved, 3 unsolved
Parikh walk visited 0 properties in 510 ms.
Support contains 27 out of 149 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 340/340 transitions.
Graph (complete) has 543 edges and 149 vertex of which 146 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 146 transition count 327
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 16 rules applied. Total rules applied 29 place count 135 transition count 322
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 34 place count 131 transition count 321
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 34 place count 131 transition count 320
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 130 transition count 320
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 65 place count 101 transition count 283
Iterating global reduction 3 with 29 rules applied. Total rules applied 94 place count 101 transition count 283
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 96 place count 101 transition count 281
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 103 place count 94 transition count 263
Iterating global reduction 4 with 7 rules applied. Total rules applied 110 place count 94 transition count 263
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 111 place count 93 transition count 261
Iterating global reduction 4 with 1 rules applied. Total rules applied 112 place count 93 transition count 261
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 113 place count 92 transition count 258
Iterating global reduction 4 with 1 rules applied. Total rules applied 114 place count 92 transition count 258
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 138 place count 80 transition count 246
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 140 place count 80 transition count 244
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 142 place count 78 transition count 242
Iterating global reduction 5 with 2 rules applied. Total rules applied 144 place count 78 transition count 242
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 150 place count 75 transition count 250
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 157 place count 75 transition count 243
Free-agglomeration rule applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 161 place count 75 transition count 239
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 165 place count 71 transition count 239
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 167 place count 71 transition count 238
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 169 place count 69 transition count 238
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 171 place count 69 transition count 238
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 172 place count 68 transition count 237
Applied a total of 172 rules in 175 ms. Remains 68 /149 variables (removed 81) and now considering 237/340 (removed 103) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 183 ms. Remains : 68/149 places, 237/340 transitions.
RANDOM walk for 40000 steps (3307 resets) in 424 ms. (94 steps per ms) remains 2/3 properties
FORMULA MedleyA-PT-10-ReachabilityCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (919 resets) in 139 ms. (285 steps per ms) remains 1/2 properties
FORMULA MedleyA-PT-10-ReachabilityCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (969 resets) in 154 ms. (258 steps per ms) remains 1/1 properties
[2025-06-02 09:47:33] [INFO ] Flow matrix only has 213 transitions (discarded 24 similar events)
// Phase 1: matrix 213 rows 68 cols
[2025-06-02 09:47:33] [INFO ] Computed 11 invariants in 4 ms
[2025-06-02 09:47:33] [INFO ] State equation strengthened by 64 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/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/65 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 212/277 variables, 65/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 64/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/281 variables, 3/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/281 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/281 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 281/281 variables, and 143 constraints, problems are : Problem set: 0 solved, 1 unsolved in 166 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 68/68 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/65 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 212/277 variables, 65/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 64/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/281 variables, 3/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/281 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/281 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 281/281 variables, and 143 constraints, problems are : Problem set: 0 solved, 1 unsolved in 240 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 68/68 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 443ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 16 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 237/237 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 0 with 1 rules applied. Total rules applied 1 place count 68 transition count 236
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 67 transition count 236
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 67 transition count 235
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 66 transition count 235
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 6 place count 64 transition count 233
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 64 transition count 233
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 60 transition count 229
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 59 transition count 228
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 59 transition count 228
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 59 transition count 226
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 22 place count 57 transition count 226
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 23 place count 56 transition count 223
Iterating global reduction 3 with 1 rules applied. Total rules applied 24 place count 56 transition count 223
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 56 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 26 place count 55 transition count 222
Applied a total of 26 rules in 58 ms. Remains 55 /68 variables (removed 13) and now considering 222/237 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 55/68 places, 222/237 transitions.
RANDOM walk for 40000 steps (3409 resets) in 419 ms. (95 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1015 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2768 steps, run visited all 1 properties in 24 ms. (steps per millisecond=115 )
Probabilistic random walk after 2768 steps, saw 1039 distinct states, run finished after 29 ms. (steps per millisecond=95 ) properties seen :1
FORMULA MedleyA-PT-10-ReachabilityCardinality-2025-06 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 10166 ms.

BK_STOP 1748857654745

--------------------
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="MedleyA-PT-10"
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 MedleyA-PT-10, 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 r128-smll-174876524100174"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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