Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 924K
-rw-r--r-- 1 mcc users 6.3K Jun 6 09:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Jun 6 09:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Jun 6 09:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 6 09:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 6 12:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 12:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 6 12:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 9.9K Jun 6 09:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Jun 6 09:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 6 09:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Jun 6 09:07 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 482K 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-B03-ReachabilityFireability-2025-00
FORMULA_NAME MedleyB-PT-B03-ReachabilityFireability-2025-01
FORMULA_NAME MedleyB-PT-B03-ReachabilityFireability-2025-02
FORMULA_NAME MedleyB-PT-B03-ReachabilityFireability-2025-03
FORMULA_NAME MedleyB-PT-B03-ReachabilityFireability-2025-04
FORMULA_NAME MedleyB-PT-B03-ReachabilityFireability-2025-05
FORMULA_NAME MedleyB-PT-B03-ReachabilityFireability-2025-06
FORMULA_NAME MedleyB-PT-B03-ReachabilityFireability-2025-07
FORMULA_NAME MedleyB-PT-B03-ReachabilityFireability-2025-08
FORMULA_NAME MedleyB-PT-B03-ReachabilityFireability-2025-09
FORMULA_NAME MedleyB-PT-B03-ReachabilityFireability-2025-10
FORMULA_NAME MedleyB-PT-B03-ReachabilityFireability-2025-11
FORMULA_NAME MedleyB-PT-B03-ReachabilityFireability-2025-12
FORMULA_NAME MedleyB-PT-B03-ReachabilityFireability-2025-13
FORMULA_NAME MedleyB-PT-B03-ReachabilityFireability-2025-14
FORMULA_NAME MedleyB-PT-B03-ReachabilityFireability-2025-15

=== Now, execution of the tool begins

BK_START 1749388525100

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyB-PT-B03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-06-08 13:15:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-08 13:15:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 13:15:26] [INFO ] Load time of PNML (sax parser for PT used): 131 ms
[2025-06-08 13:15:26] [INFO ] Transformed 1529 places.
[2025-06-08 13:15:26] [INFO ] Transformed 2131 transitions.
[2025-06-08 13:15:26] [INFO ] Found NUPN structural information;
[2025-06-08 13:15:26] [INFO ] Parsed PT model containing 1529 places and 2131 transitions and 8591 arcs in 234 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (423 resets) in 1733 ms. (23 steps per ms) remains 14/16 properties
FORMULA MedleyB-PT-B03-ReachabilityFireability-2025-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyB-PT-B03-ReachabilityFireability-2025-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (78 resets) in 353 ms. (113 steps per ms) remains 14/14 properties
[2025-06-08 13:15:27] [INFO ] Flatten gal took : 345 ms
BEST_FIRST walk for 40004 steps (78 resets) in 590 ms. (67 steps per ms) remains 14/14 properties
[2025-06-08 13:15:27] [INFO ] Flatten gal took : 147 ms
BEST_FIRST walk for 40004 steps (77 resets) in 605 ms. (66 steps per ms) remains 14/14 properties
[2025-06-08 13:15:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10556423701266822450.gal : 121 ms
[2025-06-08 13:15:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1709526846802282907.prop : 3 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/ReachabilityCardinality10556423701266822450.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1709526846802282907.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40004 steps (51 resets) in 525 ms. (76 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (78 resets) in 185 ms. (215 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (78 resets) in 131 ms. (303 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (79 resets) in 305 ms. (130 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (51 resets) in 208 ms. (191 steps per ms) remains 14/14 properties
Loading property file /tmp/ReachabilityCardinality1709526846802282907.prop.
BEST_FIRST walk for 40003 steps (77 resets) in 125 ms. (317 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (77 resets) in 184 ms. (216 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (78 resets) in 121 ms. (327 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (75 resets) in 269 ms. (148 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (45 resets) in 241 ms. (165 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (78 resets) in 117 ms. (339 steps per ms) remains 14/14 properties
// Phase 1: matrix 2131 rows 1529 cols
[2025-06-08 13:15:28] [INFO ] Computed 6 invariants in 39 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/203 variables, 203/203 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem MedleyB-PT-B03-ReachabilityFireability-2025-02 is UNSAT
FORMULA MedleyB-PT-B03-ReachabilityFireability-2025-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem MedleyB-PT-B03-ReachabilityFireability-2025-03 is UNSAT
FORMULA MedleyB-PT-B03-ReachabilityFireability-2025-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem MedleyB-PT-B03-ReachabilityFireability-2025-10 is UNSAT
FORMULA MedleyB-PT-B03-ReachabilityFireability-2025-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem MedleyB-PT-B03-ReachabilityFireability-2025-13 is UNSAT
FORMULA MedleyB-PT-B03-ReachabilityFireability-2025-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 1326/1529 variables, 6/209 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1529 variables, 1326/1535 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1529 variables, 0/1535 constraints. Problems are: Problem set: 4 solved, 10 unsolved
SDD proceeding with computation,14 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,14 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,14 properties remain. new max is 16
SDD size :3 after 12
SDD proceeding with computation,14 properties remain. new max is 32
SDD size :12 after 14
SDD proceeding with computation,14 properties remain. new max is 64
SDD size :14 after 19
SDD proceeding with computation,14 properties remain. new max is 128
SDD size :19 after 63
SDD proceeding with computation,14 properties remain. new max is 256
SDD size :63 after 211
SDD proceeding with computation,14 properties remain. new max is 512
SDD size :211 after 1007
At refinement iteration 5 (OVERLAPS) 2131/3660 variables, 1529/3064 constraints. Problems are: Problem set: 4 solved, 10 unsolved
SDD proceeding with computation,14 properties remain. new max is 1024
SDD size :1007 after 1216
SDD proceeding with computation,14 properties remain. new max is 2048
SDD size :1216 after 2174
SDD proceeding with computation,14 properties remain. new max is 4096
SDD size :2174 after 7598
At refinement iteration 6 (INCLUDED_ONLY) 0/3660 variables, 0/3064 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/3660 variables, 0/3064 constraints. Problems are: Problem set: 4 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3660/3660 variables, and 3064 constraints, problems are : Problem set: 4 solved, 10 unsolved in 3721 ms.
Refiners :[Domain max(s): 1529/1529 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 1529/1529 constraints, PredecessorRefiner: 14/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 10 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 145/145 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/145 constraints. Problems are: Problem set: 4 solved, 10 unsolved
Problem MedleyB-PT-B03-ReachabilityFireability-2025-11 is UNSAT
FORMULA MedleyB-PT-B03-ReachabilityFireability-2025-11 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 1384/1529 variables, 6/151 constraints. Problems are: Problem set: 5 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1529 variables, 1384/1535 constraints. Problems are: Problem set: 5 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:15:33] [INFO ] Deduced a trap composed of 205 places in 984 ms of which 346 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:15:34] [INFO ] Deduced a trap composed of 395 places in 1119 ms of which 493 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:15:35] [INFO ] Deduced a trap composed of 207 places in 391 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:15:36] [INFO ] Deduced a trap composed of 206 places in 640 ms of which 202 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,14 properties remain. new max is 8192
SDD size :7598 after 695131
[2025-06-08 13:15:36] [INFO ] Deduced a trap composed of 397 places in 518 ms of which 173 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:15:37] [INFO ] Deduced a trap composed of 396 places in 806 ms of which 379 ms to minimize.
SMT process timed out in 9397ms, After SMT, problems are : Problem set: 5 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 122 out of 1529 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1529/1529 places, 2131/2131 transitions.
Graph (trivial) has 1208 edges and 1529 vertex of which 65 / 1529 are part of one of the 12 SCC in 8 ms
Free SCC test removed 53 places
Drop transitions (Empty/Sink Transition effects.) removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Graph (complete) has 2202 edges and 1476 vertex of which 1468 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.10 ms
Discarding 8 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 889 transitions
Trivial Post-agglo rules discarded 889 transitions
Performed 889 trivial Post agglomeration. Transition count delta: 889
Iterating post reduction 0 with 892 rules applied. Total rules applied 894 place count 1468 transition count 1167
Reduce places removed 889 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 895 rules applied. Total rules applied 1789 place count 579 transition count 1161
Reduce places removed 3 places and 0 transitions.
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Iterating post reduction 2 with 91 rules applied. Total rules applied 1880 place count 576 transition count 1073
Reduce places removed 88 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 3 with 94 rules applied. Total rules applied 1974 place count 488 transition count 1067
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1977 place count 485 transition count 1067
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 77 Pre rules applied. Total rules applied 1977 place count 485 transition count 990
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 5 with 154 rules applied. Total rules applied 2131 place count 408 transition count 990
Discarding 78 places :
Symmetric choice reduction at 5 with 78 rule applications. Total rules 2209 place count 330 transition count 912
Iterating global reduction 5 with 78 rules applied. Total rules applied 2287 place count 330 transition count 912
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 5 with 7 rules applied. Total rules applied 2294 place count 330 transition count 905
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2295 place count 329 transition count 905
Discarding 13 places :
Symmetric choice reduction at 7 with 13 rule applications. Total rules 2308 place count 316 transition count 892
Iterating global reduction 7 with 13 rules applied. Total rules applied 2321 place count 316 transition count 892
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 2324 place count 316 transition count 889
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 2327 place count 313 transition count 885
Iterating global reduction 8 with 3 rules applied. Total rules applied 2330 place count 313 transition count 885
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 2332 place count 311 transition count 883
Iterating global reduction 8 with 2 rules applied. Total rules applied 2334 place count 311 transition count 883
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 2336 place count 311 transition count 881
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 9 with 24 rules applied. Total rules applied 2360 place count 299 transition count 869
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 2364 place count 295 transition count 865
Iterating global reduction 9 with 4 rules applied. Total rules applied 2368 place count 295 transition count 865
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 2371 place count 292 transition count 862
Iterating global reduction 9 with 3 rules applied. Total rules applied 2374 place count 292 transition count 862
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 2376 place count 290 transition count 860
Iterating global reduction 9 with 2 rules applied. Total rules applied 2378 place count 290 transition count 860
Performed 8 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 9 with 16 rules applied. Total rules applied 2394 place count 282 transition count 864
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2395 place count 282 transition count 863
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 2400 place count 282 transition count 858
Free-agglomeration rule applied 15 times.
Iterating global reduction 10 with 15 rules applied. Total rules applied 2415 place count 282 transition count 843
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 10 with 15 rules applied. Total rules applied 2430 place count 267 transition count 843
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 2433 place count 267 transition count 840
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 11 with 4 rules applied. Total rules applied 2437 place count 267 transition count 840
Applied a total of 2437 rules in 327 ms. Remains 267 /1529 variables (removed 1262) and now considering 840/2131 (removed 1291) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 334 ms. Remains : 267/1529 places, 840/2131 transitions.
RANDOM walk for 40000 steps (1859 resets) in 839 ms. (47 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (304 resets) in 66 ms. (597 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (300 resets) in 119 ms. (333 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (311 resets) in 67 ms. (588 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (306 resets) in 104 ms. (380 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (312 resets) in 183 ms. (217 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (247 resets) in 186 ms. (213 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (323 resets) in 51 ms. (769 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (209 resets) in 212 ms. (187 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (307 resets) in 35 ms. (1111 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 434415 steps, run timeout after 3001 ms. (steps per millisecond=144 ) properties seen :0 out of 9
Probabilistic random walk after 434415 steps, saw 92448 distinct states, run finished after 3006 ms. (steps per millisecond=144 ) properties seen :0
// Phase 1: matrix 840 rows 267 cols
[2025-06-08 13:15:41] [INFO ] Computed 4 invariants in 14 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 95/217 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 840/1057 variables, 217/221 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1057 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 50/1107 variables, 50/271 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:15:42] [INFO ] Deduced a trap composed of 71 places in 181 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1107 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1107 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/1107 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1107/1107 variables, and 272 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1638 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 9/5 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 95/217 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:15:43] [INFO ] Deduced a trap composed of 70 places in 148 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:15:44] [INFO ] Deduced a trap composed of 68 places in 195 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:15:44] [INFO ] Deduced a trap composed of 76 places in 176 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:15:44] [INFO ] Deduced a trap composed of 70 places in 161 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:15:44] [INFO ] Deduced a trap composed of 76 places in 182 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:15:44] [INFO ] Deduced a trap composed of 82 places in 178 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:15:45] [INFO ] Deduced a trap composed of 84 places in 160 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:15:45] [INFO ] Deduced a trap composed of 71 places in 164 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:15:45] [INFO ] Deduced a trap composed of 86 places in 158 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 840/1057 variables, 217/231 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1057 variables, 3/234 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1057 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 50/1107 variables, 50/284 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1107 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:15:47] [INFO ] Deduced a trap composed of 68 places in 189 ms of which 10 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1107 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:15:47] [INFO ] Deduced a trap composed of 65 places in 182 ms of which 8 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1107 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1107 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 0/1107 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1107/1107 variables, and 288 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5722 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 9/5 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7414ms problems are : Problem set: 0 solved, 9 unsolved
FORMULA MedleyB-PT-B03-ReachabilityFireability-2025-05 TRUE TECHNIQUES PARIKH_WALK
FORMULA MedleyB-PT-B03-ReachabilityFireability-2025-08 TRUE TECHNIQUES PARIKH_WALK
FORMULA MedleyB-PT-B03-ReachabilityFireability-2025-12 TRUE TECHNIQUES PARIKH_WALK
FORMULA MedleyB-PT-B03-ReachabilityFireability-2025-14 TRUE TECHNIQUES PARIKH_WALK
FORMULA MedleyB-PT-B03-ReachabilityFireability-2025-15 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 5 properties in 889 ms.
Support contains 45 out of 267 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 267/267 places, 840/840 transitions.
Graph (trivial) has 153 edges and 267 vertex of which 8 / 267 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 830 edges and 263 vertex of which 262 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 262 transition count 766
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 75 rules applied. Total rules applied 142 place count 198 transition count 755
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 152 place count 190 transition count 753
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 152 place count 190 transition count 748
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 162 place count 185 transition count 748
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 173 place count 174 transition count 727
Iterating global reduction 3 with 11 rules applied. Total rules applied 184 place count 174 transition count 727
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 184 place count 174 transition count 726
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 186 place count 173 transition count 726
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 190 place count 169 transition count 642
Iterating global reduction 3 with 4 rules applied. Total rules applied 194 place count 169 transition count 642
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 195 place count 169 transition count 641
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 196 place count 168 transition count 640
Iterating global reduction 4 with 1 rules applied. Total rules applied 197 place count 168 transition count 640
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 217 place count 158 transition count 630
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 220 place count 158 transition count 627
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 225 place count 153 transition count 622
Iterating global reduction 5 with 5 rules applied. Total rules applied 230 place count 153 transition count 622
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 232 place count 151 transition count 620
Iterating global reduction 5 with 2 rules applied. Total rules applied 234 place count 151 transition count 620
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 236 place count 149 transition count 618
Iterating global reduction 5 with 2 rules applied. Total rules applied 238 place count 149 transition count 618
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 239 place count 149 transition count 617
Free-agglomeration rule applied 31 times.
Iterating global reduction 6 with 31 rules applied. Total rules applied 270 place count 149 transition count 586
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 6 with 31 rules applied. Total rules applied 301 place count 118 transition count 586
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 7 with 30 rules applied. Total rules applied 331 place count 118 transition count 556
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 335 place count 118 transition count 556
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 336 place count 118 transition count 555
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 337 place count 118 transition count 555
Applied a total of 337 rules in 206 ms. Remains 118 /267 variables (removed 149) and now considering 555/840 (removed 285) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 206 ms. Remains : 118/267 places, 555/840 transitions.
RANDOM walk for 40000 steps (2546 resets) in 178 ms. (223 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (430 resets) in 44 ms. (888 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (426 resets) in 93 ms. (425 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (437 resets) in 53 ms. (740 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (337 resets) in 82 ms. (481 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 811594 steps, run timeout after 3001 ms. (steps per millisecond=270 ) properties seen :0 out of 4
Probabilistic random walk after 811594 steps, saw 139504 distinct states, run finished after 3001 ms. (steps per millisecond=270 ) properties seen :0
// Phase 1: matrix 555 rows 118 cols
[2025-06-08 13:15:53] [INFO ] Computed 5 invariants in 3 ms
[2025-06-08 13:15:53] [INFO ] State equation strengthened by 273 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 62/107 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 554/661 variables, 107/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/661 variables, 138/250 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/661 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 12/673 variables, 11/261 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/673 variables, 135/396 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/673 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/673 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 673/673 variables, and 396 constraints, problems are : Problem set: 0 solved, 4 unsolved in 542 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 118/118 constraints, ReadFeed: 273/273 constraints, PredecessorRefiner: 4/2 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 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 62/107 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 13:15:54] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 554/661 variables, 107/113 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/661 variables, 138/251 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/661 variables, 2/253 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:15:54] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/661 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/661 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 12/673 variables, 11/265 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/673 variables, 135/400 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/673 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/673 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 673/673 variables, and 400 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1152 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 118/118 constraints, ReadFeed: 273/273 constraints, PredecessorRefiner: 4/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1751ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 363 ms.
Support contains 45 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 555/555 transitions.
Applied a total of 0 rules in 42 ms. Remains 118 /118 variables (removed 0) and now considering 555/555 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 118/118 places, 555/555 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 555/555 transitions.
Applied a total of 0 rules in 40 ms. Remains 118 /118 variables (removed 0) and now considering 555/555 (removed 0) transitions.
[2025-06-08 13:15:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 13:15:55] [INFO ] Implicit Places using invariants in 164 ms returned []
[2025-06-08 13:15:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 13:15:56] [INFO ] State equation strengthened by 273 read => feed constraints.
[2025-06-08 13:15:56] [INFO ] Implicit Places using invariants and state equation in 434 ms returned []
Implicit Place search using SMT with State Equation took 624 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 13:15:56] [INFO ] Redundant transitions in 49 ms returned []
Running 543 sub problems to find dead transitions.
[2025-06-08 13:15:56] [INFO ] Invariant cache hit.
[2025-06-08 13:15:56] [INFO ] State equation strengthened by 273 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 543 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:16:01] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:16:01] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:16:01] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:16:01] [INFO ] Deduced a trap composed of 36 places in 130 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:16:01] [INFO ] Deduced a trap composed of 35 places in 95 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:16:02] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:16:02] [INFO ] Deduced a trap composed of 37 places in 167 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:16:02] [INFO ] Deduced a trap composed of 26 places in 207 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:16:02] [INFO ] Deduced a trap composed of 23 places in 272 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:16:03] [INFO ] Deduced a trap composed of 25 places in 183 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:16:03] [INFO ] Deduced a trap composed of 35 places in 195 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:16:03] [INFO ] Deduced a trap composed of 39 places in 115 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:16:03] [INFO ] Deduced a trap composed of 33 places in 127 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:16:03] [INFO ] Deduced a trap composed of 34 places in 105 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:16:03] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:16:03] [INFO ] Deduced a trap composed of 38 places in 102 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:16:04] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:16:04] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:16:04] [INFO ] Deduced a trap composed of 37 places in 123 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:16:04] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 543 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:16:04] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:16:05] [INFO ] Deduced a trap composed of 48 places in 91 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:16:05] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 5 (OVERLAPS) 555/673 variables, 118/146 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/673 variables, 273/419 constraints. Problems are: Problem set: 0 solved, 543 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:16:19] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:16:19] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:16:20] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:16:20] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:16:20] [INFO ] Deduced a trap composed of 36 places in 112 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/673 variables, 5/424 constraints. Problems are: Problem set: 0 solved, 543 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 673/673 variables, and 424 constraints, problems are : Problem set: 0 solved, 543 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 118/118 constraints, ReadFeed: 273/273 constraints, PredecessorRefiner: 543/229 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 543 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 28/33 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 4 (OVERLAPS) 555/673 variables, 118/151 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/673 variables, 273/424 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/673 variables, 229/653 constraints. Problems are: Problem set: 0 solved, 543 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:16:41] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:16:42] [INFO ] Deduced a trap composed of 36 places in 126 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:16:48] [INFO ] Deduced a trap composed of 36 places in 162 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 673/673 variables, and 656 constraints, problems are : Problem set: 0 solved, 543 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 118/118 constraints, ReadFeed: 273/273 constraints, PredecessorRefiner: 543/229 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61301ms problems are : Problem set: 0 solved, 543 unsolved
Search for dead transitions found 0 dead transitions in 61305ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62030 ms. Remains : 118/118 places, 555/555 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 118 transition count 555
Applied a total of 2 rules in 39 ms. Remains 118 /118 variables (removed 0) and now considering 555/555 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 555 rows 118 cols
[2025-06-08 13:16:57] [INFO ] Computed 5 invariants in 5 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-08 13:16:58] [INFO ] After 358ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-08 13:16:58] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-08 13:16:58] [INFO ] After 221ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:16:58] [INFO ] Deduced a trap composed of 27 places in 152 ms of which 11 ms to minimize.
[2025-06-08 13:16:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
TRAPS : Iteration 1
[2025-06-08 13:16:58] [INFO ] After 547ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2025-06-08 13:16:58] [INFO ] After 699ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2025-06-08 13:16:58] [INFO ] Flatten gal took : 137 ms
[2025-06-08 13:16:59] [INFO ] Flatten gal took : 60 ms
[2025-06-08 13:16:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14533991105410006111.gal : 7 ms
[2025-06-08 13:16:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality216449806439385985.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/ReachabilityCardinality14533991105410006111.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality216449806439385985.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality216449806439385985.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 17
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :17 after 18
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :18 after 26
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :26 after 180
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :180 after 220
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :220 after 540
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :540 after 3979
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :3979 after 6104
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :6104 after 52912
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :52912 after 80189
Invariant property MedleyB-PT-B03-ReachabilityFireability-2025-09 does not hold.
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :80189 after 638321
Reachability property MedleyB-PT-B03-ReachabilityFireability-2025-06 is true.
Invariant property MedleyB-PT-B03-ReachabilityFireability-2025-01 does not hold.
Invariant property MedleyB-PT-B03-ReachabilityFireability-2025-00 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 2049 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1.04392e+07,6.2371,78004,2,13562,20,176649,6,0,1028,194631,0
Total reachable state count : 10439228

Verifying 4 reachability properties.
Invariant property MedleyB-PT-B03-ReachabilityFireability-2025-00 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MedleyB-PT-B03-ReachabilityFireability-2025-00,364215,6.23891,78004,2,2592,20,176649,7,0,1031,194631,0
Invariant property MedleyB-PT-B03-ReachabilityFireability-2025-01 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MedleyB-PT-B03-ReachabilityFireability-2025-01,5184,6.24123,78004,2,463,20,176649,8,0,1074,194631,0
Reachability property MedleyB-PT-B03-ReachabilityFireability-2025-06 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MedleyB-PT-B03-ReachabilityFireability-2025-06,343635,6.24211,78004,2,2588,20,176649,9,0,1076,194631,0
Invariant property MedleyB-PT-B03-ReachabilityFireability-2025-09 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MedleyB-PT-B03-ReachabilityFireability-2025-09,15135,6.84078,78004,2,1573,20,176649,10,0,1145,194631,0
Over-approximation ignoring read arcs solved 0 properties in 8203 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-08 13:17:06] [INFO ] Flatten gal took : 68 ms
[2025-06-08 13:17:06] [INFO ] Applying decomposition
[2025-06-08 13:17:06] [INFO ] Flatten gal took : 65 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10750821962267016622.txt' '-o' '/tmp/graph10750821962267016622.bin' '-w' '/tmp/graph10750821962267016622.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10750821962267016622.bin' '-l' '-1' '-v' '-w' '/tmp/graph10750821962267016622.weights' '-q' '0' '-e' '0.001'
[2025-06-08 13:17:06] [INFO ] Decomposing Gal with order
[2025-06-08 13:17:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 13:17:07] [INFO ] Removed a total of 2886 redundant transitions.
[2025-06-08 13:17:07] [INFO ] Flatten gal took : 196 ms
[2025-06-08 13:17:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 43 ms.
[2025-06-08 13:17:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2883818003050479819.gal : 27 ms
[2025-06-08 13:17:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16860116630981827411.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/ReachabilityCardinality2883818003050479819.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16860116630981827411.prop' '--nowitness'

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 ...308
Loading property file /tmp/ReachabilityCardinality16860116630981827411.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :1 after 1.21826e+11
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,6.38825e+12,10.1589,327428,6721,18,321034,897,2150,2.93152e+06,53,1136,0
Total reachable state count : 6388248983373

Verifying 4 reachability properties.
Invariant property MedleyB-PT-B03-ReachabilityFireability-2025-00 does not hold.
FORMULA MedleyB-PT-B03-ReachabilityFireability-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MedleyB-PT-B03-ReachabilityFireability-2025-00,8.21406e+06,10.1981,327428,677,13,321034,897,2151,2.93152e+06,55,1136,0
Invariant property MedleyB-PT-B03-ReachabilityFireability-2025-01 does not hold.
FORMULA MedleyB-PT-B03-ReachabilityFireability-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MedleyB-PT-B03-ReachabilityFireability-2025-01,2.31941e+10,10.2303,327428,1754,14,321034,897,2210,2.93152e+06,60,1136,11181
Reachability property MedleyB-PT-B03-ReachabilityFireability-2025-06 is true.
FORMULA MedleyB-PT-B03-ReachabilityFireability-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MedleyB-PT-B03-ReachabilityFireability-2025-06,8.21406e+06,10.2312,327428,676,13,321034,897,2210,2.93152e+06,60,1136,11181
Invariant property MedleyB-PT-B03-ReachabilityFireability-2025-09 does not hold.
FORMULA MedleyB-PT-B03-ReachabilityFireability-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MedleyB-PT-B03-ReachabilityFireability-2025-09,6.84346e+06,10.3085,327428,1367,14,321034,897,2267,2.93152e+06,60,1136,24546
All properties solved without resorting to model-checking.
Total runtime 111440 ms.

BK_STOP 1749388637869

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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-B03"
export BK_EXAMINATION="ReachabilityFireability"
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-B03, examination is ReachabilityFireability"
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-174931339900447"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyB-PT-B03.tgz
mv MedleyB-PT-B03 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;