Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 7.9K Jun 6 09:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Jun 6 09:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 6 09:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Jun 6 09:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 6 12:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 6 12:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 12:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 11K Jun 6 09:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Jun 6 09:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Jun 6 09:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Jun 6 09:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 6 12:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:09 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 253K 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-B02-ReachabilityCardinality-2025-00
FORMULA_NAME MedleyB-PT-B02-ReachabilityCardinality-2025-01
FORMULA_NAME MedleyB-PT-B02-ReachabilityCardinality-2025-02
FORMULA_NAME MedleyB-PT-B02-ReachabilityCardinality-2025-03
FORMULA_NAME MedleyB-PT-B02-ReachabilityCardinality-2025-04
FORMULA_NAME MedleyB-PT-B02-ReachabilityCardinality-2025-05
FORMULA_NAME MedleyB-PT-B02-ReachabilityCardinality-2025-06
FORMULA_NAME MedleyB-PT-B02-ReachabilityCardinality-2025-07
FORMULA_NAME MedleyB-PT-B02-ReachabilityCardinality-2025-08
FORMULA_NAME MedleyB-PT-B02-ReachabilityCardinality-2025-09
FORMULA_NAME MedleyB-PT-B02-ReachabilityCardinality-2025-10
FORMULA_NAME MedleyB-PT-B02-ReachabilityCardinality-2025-11
FORMULA_NAME MedleyB-PT-B02-ReachabilityCardinality-2025-12
FORMULA_NAME MedleyB-PT-B02-ReachabilityCardinality-2025-13
FORMULA_NAME MedleyB-PT-B02-ReachabilityCardinality-2025-14
FORMULA_NAME MedleyB-PT-B02-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1749387423217

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-B02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-08 12:57:04] [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 12:57:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 12:57:04] [INFO ] Load time of PNML (sax parser for PT used): 168 ms
[2025-06-08 12:57:04] [INFO ] Transformed 1227 places.
[2025-06-08 12:57:04] [INFO ] Transformed 1472 transitions.
[2025-06-08 12:57:04] [INFO ] Found NUPN structural information;
[2025-06-08 12:57:04] [INFO ] Parsed PT model containing 1227 places and 1472 transitions and 4160 arcs in 289 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
FORMULA MedleyB-PT-B02-ReachabilityCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B02-ReachabilityCardinality-2025-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B02-ReachabilityCardinality-2025-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B02-ReachabilityCardinality-2025-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (505 resets) in 1353 ms. (29 steps per ms) remains 9/12 properties
FORMULA MedleyB-PT-B02-ReachabilityCardinality-2025-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyB-PT-B02-ReachabilityCardinality-2025-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyB-PT-B02-ReachabilityCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (105 resets) in 166 ms. (239 steps per ms) remains 9/9 properties
[2025-06-08 12:57:05] [INFO ] Flatten gal took : 201 ms
[2025-06-08 12:57:05] [INFO ] Flatten gal took : 78 ms
BEST_FIRST walk for 40004 steps (107 resets) in 534 ms. (74 steps per ms) remains 9/9 properties
[2025-06-08 12:57:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7759300330385239995.gal : 79 ms
[2025-06-08 12:57:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6019070984918960016.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/ReachabilityCardinality7759300330385239995.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6019070984918960016.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40002 steps (101 resets) in 363 ms. (109 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 40004 steps (111 resets) in 229 ms. (173 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (109 resets) in 246 ms. (161 steps per ms) remains 9/9 properties
Loading property file /tmp/ReachabilityCardinality6019070984918960016.prop.
BEST_FIRST walk for 40003 steps (108 resets) in 118 ms. (336 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (108 resets) in 113 ms. (350 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (106 resets) in 91 ms. (434 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (106 resets) in 126 ms. (314 steps per ms) remains 9/9 properties
// Phase 1: matrix 1472 rows 1227 cols
[2025-06-08 12:57:06] [INFO ] Computed 5 invariants in 31 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/136 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem MedleyB-PT-B02-ReachabilityCardinality-2025-03 is UNSAT
FORMULA MedleyB-PT-B02-ReachabilityCardinality-2025-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem MedleyB-PT-B02-ReachabilityCardinality-2025-07 is UNSAT
FORMULA MedleyB-PT-B02-ReachabilityCardinality-2025-07 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 1091/1227 variables, 5/141 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1227 variables, 1091/1232 constraints. Problems are: Problem set: 2 solved, 7 unsolved
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :2 after 7
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :7 after 9
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :9 after 15
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :15 after 18
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :18 after 21
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :21 after 75
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :75 after 94
At refinement iteration 4 (INCLUDED_ONLY) 0/1227 variables, 0/1232 constraints. Problems are: Problem set: 2 solved, 7 unsolved
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :94 after 152
SDD proceeding with computation,9 properties remain. new max is 2048
SDD size :152 after 6493
SDD proceeding with computation,9 properties remain. new max is 4096
SDD size :6493 after 121039
At refinement iteration 5 (OVERLAPS) 1472/2699 variables, 1227/2459 constraints. Problems are: Problem set: 2 solved, 7 unsolved
SDD proceeding with computation,9 properties remain. new max is 8192
SDD size :121039 after 166779
At refinement iteration 6 (INCLUDED_ONLY) 0/2699 variables, 0/2459 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/2699 variables, 0/2459 constraints. Problems are: Problem set: 2 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2699/2699 variables, and 2459 constraints, problems are : Problem set: 2 solved, 7 unsolved in 1914 ms.
Refiners :[Domain max(s): 1227/1227 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 1227/1227 constraints, PredecessorRefiner: 9/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 7 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
SDD proceeding with computation,9 properties remain. new max is 16384
SDD size :166779 after 259870
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 115/115 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/115 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Problem MedleyB-PT-B02-ReachabilityCardinality-2025-01 is UNSAT
FORMULA MedleyB-PT-B02-ReachabilityCardinality-2025-01 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 1112/1227 variables, 5/120 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1227 variables, 1112/1232 constraints. Problems are: Problem set: 3 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:57:09] [INFO ] Deduced a trap composed of 395 places in 798 ms of which 381 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:57:10] [INFO ] Deduced a trap composed of 395 places in 661 ms of which 348 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 :259870 after 1.28279e+08
[2025-06-08 12:57:10] [INFO ] Deduced a trap composed of 395 places in 555 ms of which 249 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:57:11] [INFO ] Deduced a trap composed of 396 places in 280 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:57:11] [INFO ] Deduced a trap composed of 396 places in 416 ms of which 165 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:57:11] [INFO ] Deduced a trap composed of 397 places in 283 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:57:12] [INFO ] Deduced a trap composed of 397 places in 264 ms of which 19 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1227 variables, 7/1239 constraints. Problems are: Problem set: 3 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:57:12] [INFO ] Deduced a trap composed of 396 places in 417 ms of which 173 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1227 variables, 1/1240 constraints. Problems are: Problem set: 3 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1227/2699 variables, and 1240 constraints, problems are : Problem set: 3 solved, 6 unsolved in 5020 ms.
Refiners :[Domain max(s): 1227/1227 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/1227 constraints, PredecessorRefiner: 1/8 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7057ms problems are : Problem set: 3 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 89 out of 1227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1227/1227 places, 1472/1472 transitions.
Graph (trivial) has 1037 edges and 1227 vertex of which 39 / 1227 are part of one of the 8 SCC in 15 ms
Free SCC test removed 31 places
Drop transitions (Empty/Sink Transition effects.) removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Graph (complete) has 1692 edges and 1196 vertex of which 1188 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.14 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 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 748 transitions
Trivial Post-agglo rules discarded 748 transitions
Performed 748 trivial Post agglomeration. Transition count delta: 748
Iterating post reduction 0 with 752 rules applied. Total rules applied 754 place count 1188 transition count 675
Reduce places removed 748 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 757 rules applied. Total rules applied 1511 place count 440 transition count 666
Reduce places removed 4 places and 0 transitions.
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Iterating post reduction 2 with 64 rules applied. Total rules applied 1575 place count 436 transition count 606
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 3 with 60 rules applied. Total rules applied 1635 place count 376 transition count 606
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 56 Pre rules applied. Total rules applied 1635 place count 376 transition count 550
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 4 with 112 rules applied. Total rules applied 1747 place count 320 transition count 550
Discarding 44 places :
Symmetric choice reduction at 4 with 44 rule applications. Total rules 1791 place count 276 transition count 506
Iterating global reduction 4 with 44 rules applied. Total rules applied 1835 place count 276 transition count 506
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 2 rules applied. Total rules applied 1837 place count 276 transition count 504
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1838 place count 275 transition count 504
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1838 place count 275 transition count 503
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1840 place count 274 transition count 503
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 1857 place count 257 transition count 364
Iterating global reduction 6 with 17 rules applied. Total rules applied 1874 place count 257 transition count 364
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1876 place count 257 transition count 362
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1877 place count 256 transition count 361
Iterating global reduction 7 with 1 rules applied. Total rules applied 1878 place count 256 transition count 361
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 7 with 40 rules applied. Total rules applied 1918 place count 236 transition count 341
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1921 place count 233 transition count 338
Iterating global reduction 7 with 3 rules applied. Total rules applied 1924 place count 233 transition count 338
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1925 place count 232 transition count 337
Iterating global reduction 7 with 1 rules applied. Total rules applied 1926 place count 232 transition count 337
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1927 place count 231 transition count 336
Iterating global reduction 7 with 1 rules applied. Total rules applied 1928 place count 231 transition count 336
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1936 place count 227 transition count 337
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1938 place count 227 transition count 335
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 1942 place count 227 transition count 331
Free-agglomeration rule applied 32 times.
Iterating global reduction 8 with 32 rules applied. Total rules applied 1974 place count 227 transition count 299
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 8 with 32 rules applied. Total rules applied 2006 place count 195 transition count 299
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 9 with 13 rules applied. Total rules applied 2019 place count 195 transition count 286
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 2022 place count 195 transition count 286
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 2024 place count 195 transition count 284
Applied a total of 2024 rules in 506 ms. Remains 195 /1227 variables (removed 1032) and now considering 284/1472 (removed 1188) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 531 ms. Remains : 195/1227 places, 284/1472 transitions.
RANDOM walk for 40000 steps (2219 resets) in 316 ms. (126 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (415 resets) in 101 ms. (392 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (413 resets) in 119 ms. (333 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (412 resets) in 195 ms. (204 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (417 resets) in 64 ms. (615 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (418 resets) in 69 ms. (571 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (424 resets) in 107 ms. (370 steps per ms) remains 6/6 properties
Invariant property MedleyB-PT-B02-ReachabilityCardinality-2025-11 does not hold.
FORMULA MedleyB-PT-B02-ReachabilityCardinality-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Invariant property MedleyB-PT-B02-ReachabilityCardinality-2025-09 does not hold.
FORMULA MedleyB-PT-B02-ReachabilityCardinality-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Interrupted probabilistic random walk after 703776 steps, run timeout after 3001 ms. (steps per millisecond=234 ) properties seen :1 out of 6
Probabilistic random walk after 703776 steps, saw 142815 distinct states, run finished after 3010 ms. (steps per millisecond=233 ) properties seen :1
// Phase 1: matrix 284 rows 195 cols
[2025-06-08 12:57:17] [INFO ] Computed 5 invariants in 2 ms
[2025-06-08 12:57:17] [INFO ] State equation strengthened by 59 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/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 111/195 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 284/479 variables, 195/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/479 variables, 59/259 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/479 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/479 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 479/479 variables, and 259 constraints, problems are : Problem set: 0 solved, 4 unsolved in 346 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 195/195 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 111/195 variables, 5/5 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 12:57:17] [INFO ] Deduced a trap composed of 60 places in 94 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:57:17] [INFO ] Deduced a trap composed of 60 places in 90 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:57:17] [INFO ] Deduced a trap composed of 66 places in 68 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:57:17] [INFO ] Deduced a trap composed of 52 places in 80 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:57:17] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 5/10 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 12:57:18] [INFO ] Deduced a trap composed of 54 places in 98 ms of which 15 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 1/11 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 12:57:18] [INFO ] Deduced a trap composed of 61 places in 76 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:57:18] [INFO ] Deduced a trap composed of 59 places in 63 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 284/479 variables, 195/208 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/479 variables, 59/267 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/479 variables, 3/270 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/479 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/479 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 479/479 variables, and 270 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1508 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 195/195 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1873ms problems are : Problem set: 0 solved, 4 unsolved
FORMULA MedleyB-PT-B02-ReachabilityCardinality-2025-13 FALSE TECHNIQUES PARIKH_WALK
FORMULA MedleyB-PT-B02-ReachabilityCardinality-2025-00 FALSE TECHNIQUES PARIKH_WALK
FORMULA MedleyB-PT-B02-ReachabilityCardinality-2025-04 TRUE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 424 steps, including 16 resets, run visited all 1 properties in 2 ms. (steps per millisecond=212 )
FORMULA MedleyB-PT-B02-ReachabilityCardinality-2025-06 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 61 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 14572 ms.

BK_STOP 1749387439077

--------------------
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="MedleyB-PT-B02"
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-B02, 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-174931339900438"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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