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

About the Execution of ITS-Tools for ErlangenMainframeV0-PT-0707

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

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.8M
-rw-r--r-- 1 mcc users 7.8K Jun 6 09:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Jun 6 09:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Jun 6 08:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Jun 6 08:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Jun 6 11:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Jun 6 11:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Jun 6 11:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 11:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 11K Jun 6 09:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Jun 6 09:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Jun 6 09:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Jun 6 09:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 11:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 11:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 5 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 5.4M 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 ErlangenMainframeV0-PT-0707-ReachabilityFireability-2025-00
FORMULA_NAME ErlangenMainframeV0-PT-0707-ReachabilityFireability-2025-01
FORMULA_NAME ErlangenMainframeV0-PT-0707-ReachabilityFireability-2025-02
FORMULA_NAME ErlangenMainframeV0-PT-0707-ReachabilityFireability-2025-03
FORMULA_NAME ErlangenMainframeV0-PT-0707-ReachabilityFireability-2025-04
FORMULA_NAME ErlangenMainframeV0-PT-0707-ReachabilityFireability-2025-05
FORMULA_NAME ErlangenMainframeV0-PT-0707-ReachabilityFireability-2025-06
FORMULA_NAME ErlangenMainframeV0-PT-0707-ReachabilityFireability-2025-07
FORMULA_NAME ErlangenMainframeV0-PT-0707-ReachabilityFireability-2025-08
FORMULA_NAME ErlangenMainframeV0-PT-0707-ReachabilityFireability-2025-09
FORMULA_NAME ErlangenMainframeV0-PT-0707-ReachabilityFireability-2025-10
FORMULA_NAME ErlangenMainframeV0-PT-0707-ReachabilityFireability-2025-11
FORMULA_NAME ErlangenMainframeV0-PT-0707-ReachabilityFireability-2025-12
FORMULA_NAME ErlangenMainframeV0-PT-0707-ReachabilityFireability-2025-13
FORMULA_NAME ErlangenMainframeV0-PT-0707-ReachabilityFireability-2025-14
FORMULA_NAME ErlangenMainframeV0-PT-0707-ReachabilityFireability-2025-15

=== Now, execution of the tool begins

BK_START 1749354805039

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV0-PT-0707
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-06-08 03:53: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 03:53:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 03:53:26] [INFO ] Load time of PNML (sax parser for PT used): 515 ms
[2025-06-08 03:53:26] [INFO ] Transformed 243 places.
[2025-06-08 03:53:26] [INFO ] Transformed 6817 transitions.
[2025-06-08 03:53:26] [INFO ] Found NUPN structural information;
[2025-06-08 03:53:26] [INFO ] Parsed PT model containing 243 places and 6817 transitions and 114442 arcs in 675 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 5605 ms. (7 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 217 ms. (18 steps per ms) remains 16/16 properties
[2025-06-08 03:53:40] [INFO ] Flatten gal took : 12529 ms
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 231 ms. (17 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 284 ms. (14 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 259 ms. (15 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 142 ms. (28 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
[2025-06-08 03:53:40] [INFO ] Flatten gal took : 797 ms
[2025-06-08 03:53:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1718099763606153159.gal : 200 ms
[2025-06-08 03:53:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4914730307500871820.prop : 6 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/ReachabilityCardinality1718099763606153159.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4914730307500871820.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/ReachabilityCardinality4914730307500871820.prop.
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :4 after 11
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :11 after 195
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :195 after 4443
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :4443 after 106498
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :106498 after 542287
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :542287 after 543220
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :543220 after 544894
SDD proceeding with computation,16 properties remain. new max is 2048
SDD size :544894 after 549007
SDD proceeding with computation,16 properties remain. new max is 4096
SDD size :549007 after 552127
SDD proceeding with computation,16 properties remain. new max is 8192
SDD size :552127 after 2.08061e+06
SDD proceeding with computation,16 properties remain. new max is 16384
SDD size :2.08061e+06 after 5.48345e+06
Probabilistic random walk after 1000001 steps, saw 575352 distinct states, run finished after 27953 ms. (steps per millisecond=35 ) properties seen :0
// Phase 1: matrix 6817 rows 243 cols
[2025-06-08 03:54:08] [INFO ] Computed 20 invariants in 139 ms
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 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem ErlangenMainframeV0-PT-0707-ReachabilityFireability-2025-12 is UNSAT
FORMULA ErlangenMainframeV0-PT-0707-ReachabilityFireability-2025-12 FALSE TECHNIQUES SMT_REFINEMENT
Problem ErlangenMainframeV0-PT-0707-ReachabilityFireability-2025-13 is UNSAT
FORMULA ErlangenMainframeV0-PT-0707-ReachabilityFireability-2025-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 182/232 variables, 12/69 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 182/251 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/251 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 11/243 variables, 1/252 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 11/263 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 0/263 constraints. Problems are: Problem set: 2 solved, 14 unsolved
SDD proceeding with computation,16 properties remain. new max is 32768
SDD size :5.48345e+06 after 2.20744e+08
At refinement iteration 9 (OVERLAPS) 6817/7060 variables, 243/506 constraints. Problems are: Problem set: 2 solved, 14 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 7060/7060 variables, and 506 constraints, problems are : Problem set: 2 solved, 14 unsolved in 5091 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 16/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 14 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 2 solved, 14 unsolved
Problem ErlangenMainframeV0-PT-0707-ReachabilityFireability-2025-06 is UNSAT
FORMULA ErlangenMainframeV0-PT-0707-ReachabilityFireability-2025-06 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 7/57 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/57 constraints. Problems are: Problem set: 3 solved, 13 unsolved
Problem ErlangenMainframeV0-PT-0707-ReachabilityFireability-2025-00 is UNSAT
FORMULA ErlangenMainframeV0-PT-0707-ReachabilityFireability-2025-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem ErlangenMainframeV0-PT-0707-ReachabilityFireability-2025-05 is UNSAT
FORMULA ErlangenMainframeV0-PT-0707-ReachabilityFireability-2025-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem ErlangenMainframeV0-PT-0707-ReachabilityFireability-2025-10 is UNSAT
FORMULA ErlangenMainframeV0-PT-0707-ReachabilityFireability-2025-10 TRUE TECHNIQUES SMT_REFINEMENT
Problem ErlangenMainframeV0-PT-0707-ReachabilityFireability-2025-14 is UNSAT
FORMULA ErlangenMainframeV0-PT-0707-ReachabilityFireability-2025-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 182/232 variables, 12/69 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 182/251 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/251 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 11/243 variables, 1/252 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 11/263 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 0/263 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 6817/7060 variables, 243/506 constraints. Problems are: Problem set: 7 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 7060/7060 variables, and 506 constraints, problems are : Problem set: 7 solved, 9 unsolved in 5011 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 13/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10523ms problems are : Problem set: 7 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 46 out of 243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 6817/6817 transitions.
Graph (trivial) has 166 edges and 243 vertex of which 4 / 243 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 241 transition count 6734
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 159 place count 162 transition count 6734
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 159 place count 162 transition count 6730
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 167 place count 158 transition count 6730
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 210 place count 115 transition count 6687
Iterating global reduction 2 with 43 rules applied. Total rules applied 253 place count 115 transition count 6687
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 253 place count 115 transition count 6682
Deduced a syphon composed of 5 places in 8 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 263 place count 110 transition count 6682
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 307 place count 88 transition count 6660
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 309 place count 86 transition count 6643
Iterating global reduction 2 with 2 rules applied. Total rules applied 311 place count 86 transition count 6643
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 313 place count 86 transition count 6641
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 317 place count 84 transition count 6660
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 318 place count 84 transition count 6659
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 323 place count 84 transition count 6654
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 330 place count 79 transition count 6652
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 4 with 13 rules applied. Total rules applied 343 place count 79 transition count 6639
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 345 place count 79 transition count 6639
Partial Post-agglomeration rule applied 7 times.
Drop transitions (Partial Post agglomeration) removed 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 352 place count 79 transition count 6639
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 359 place count 79 transition count 6632
SDD proceeding with computation,16 properties remain. new max is 65536
SDD size :2.20744e+08 after 6.50518e+08
Applied a total of 359 rules in 8961 ms. Remains 79 /243 variables (removed 164) and now considering 6632/6817 (removed 185) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8974 ms. Remains : 79/243 places, 6632/6817 transitions.
RANDOM walk for 40000 steps (8 resets) in 2697 ms. (14 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 352 ms. (113 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 496 ms. (80 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 649 ms. (61 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 428 ms. (93 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 478 ms. (83 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 257 ms. (155 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 235 ms. (169 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 253 ms. (157 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 250 ms. (159 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 305735 steps, run timeout after 3001 ms. (steps per millisecond=101 ) properties seen :0 out of 9
Probabilistic random walk after 305735 steps, saw 49420 distinct states, run finished after 3003 ms. (steps per millisecond=101 ) properties seen :0
// Phase 1: matrix 6632 rows 79 cols
[2025-06-08 03:54:33] [INFO ] Computed 20 invariants in 89 ms
[2025-06-08 03:54:33] [INFO ] State equation strengthened by 32 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 5/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 7/58 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 21/79 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 6632/6711 variables, 79/99 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/6711 variables, 32/131 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/6711 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/6711 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6711/6711 variables, and 131 constraints, problems are : Problem set: 0 solved, 9 unsolved in 8144 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 79/79 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 9/0 constraints, Known Traps: 0/0 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/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 5/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 7/58 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 21/79 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 6632/6711 variables, 79/99 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/6711 variables, 32/131 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/6711 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/6711 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6711/6711 variables, and 131 constraints, problems are : Problem set: 0 solved, 9 unsolved in 16012 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 79/79 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 9/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24370ms problems are : Problem set: 0 solved, 9 unsolved
FORMULA ErlangenMainframeV0-PT-0707-ReachabilityFireability-2025-04 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 3599 ms.
Support contains 46 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 6632/6632 transitions.
Applied a total of 0 rules in 1043 ms. Remains 79 /79 variables (removed 0) and now considering 6632/6632 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1044 ms. Remains : 79/79 places, 6632/6632 transitions.
RANDOM walk for 40000 steps (8 resets) in 2086 ms. (19 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 246 ms. (161 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 468 ms. (85 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 627 ms. (63 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 491 ms. (81 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 207 ms. (192 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 214 ms. (186 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 255 ms. (156 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 249 ms. (160 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 285120 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :0 out of 8
Probabilistic random walk after 285120 steps, saw 46678 distinct states, run finished after 3001 ms. (steps per millisecond=95 ) properties seen :0
[2025-06-08 03:55:06] [INFO ] Invariant cache hit.
[2025-06-08 03:55:06] [INFO ] State equation strengthened by 32 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
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/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 5/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 7/58 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 21/79 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 6632/6711 variables, 79/99 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/6711 variables, 32/131 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/6711 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/6711 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6711/6711 variables, and 131 constraints, problems are : Problem set: 0 solved, 8 unsolved in 8034 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 79/79 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 8/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 5/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 7/58 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 21/79 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 6632/6711 variables, 79/99 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/6711 variables, 32/131 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/6711 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/6711 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6711/6711 variables, and 131 constraints, problems are : Problem set: 0 solved, 8 unsolved in 15594 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 79/79 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 8/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23834ms problems are : Problem set: 0 solved, 8 unsolved
FORMULA ErlangenMainframeV0-PT-0707-ReachabilityFireability-2025-01 TRUE TECHNIQUES PARIKH_WALK
FORMULA ErlangenMainframeV0-PT-0707-ReachabilityFireability-2025-07 TRUE TECHNIQUES PARIKH_WALK
FORMULA ErlangenMainframeV0-PT-0707-ReachabilityFireability-2025-08 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 3 properties in 3491 ms.
Support contains 46 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 6632/6632 transitions.
Applied a total of 0 rules in 1103 ms. Remains 79 /79 variables (removed 0) and now considering 6632/6632 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1104 ms. Remains : 79/79 places, 6632/6632 transitions.
RANDOM walk for 40000 steps (8 resets) in 2911 ms. (13 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 462 ms. (86 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 627 ms. (63 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 238 ms. (167 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 316 ms. (126 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 377 ms. (105 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 223791 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :0 out of 5
Probabilistic random walk after 223791 steps, saw 39309 distinct states, run finished after 3001 ms. (steps per millisecond=74 ) properties seen :0
[2025-06-08 03:55:39] [INFO ] Invariant cache hit.
[2025-06-08 03:55:39] [INFO ] State equation strengthened by 32 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 7/58 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 21/79 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 6632/6711 variables, 79/99 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/6711 variables, 32/131 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/6711 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/6711 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6711/6711 variables, and 131 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3341 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 79/79 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 7/58 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 21/79 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 6632/6711 variables, 79/99 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/6711 variables, 32/131 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/6711 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/6711 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6711/6711 variables, and 131 constraints, problems are : Problem set: 0 solved, 5 unsolved in 6810 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 79/79 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10225ms problems are : Problem set: 0 solved, 5 unsolved
FORMULA ErlangenMainframeV0-PT-0707-ReachabilityFireability-2025-02 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 1602 ms.
Support contains 46 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 6632/6632 transitions.
Applied a total of 0 rules in 1027 ms. Remains 79 /79 variables (removed 0) and now considering 6632/6632 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1029 ms. Remains : 79/79 places, 6632/6632 transitions.
RANDOM walk for 40000 steps (8 resets) in 1996 ms. (20 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 622 ms. (64 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 241 ms. (165 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 218 ms. (182 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 239 ms. (166 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 323566 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :0 out of 4
Probabilistic random walk after 323566 steps, saw 51716 distinct states, run finished after 3001 ms. (steps per millisecond=107 ) properties seen :0
[2025-06-08 03:55:56] [INFO ] Invariant cache hit.
[2025-06-08 03:55:56] [INFO ] State equation strengthened by 32 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 7/58 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 21/79 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 6632/6711 variables, 79/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/6711 variables, 32/131 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/6711 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/6711 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6711/6711 variables, and 131 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3064 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 79/79 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 4/0 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 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 7/58 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 21/79 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 6632/6711 variables, 79/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/6711 variables, 32/131 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/6711 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/6711 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6711/6711 variables, and 131 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4703 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 79/79 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7823ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 1553 ms.
Support contains 46 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 6632/6632 transitions.
Applied a total of 0 rules in 1025 ms. Remains 79 /79 variables (removed 0) and now considering 6632/6632 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1033 ms. Remains : 79/79 places, 6632/6632 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 6632/6632 transitions.
Applied a total of 0 rules in 1034 ms. Remains 79 /79 variables (removed 0) and now considering 6632/6632 (removed 0) transitions.
[2025-06-08 03:56:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:56:08] [INFO ] Implicit Places using invariants in 55 ms returned [64]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 80 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 78/79 places, 6632/6632 transitions.
Applied a total of 0 rules in 1030 ms. Remains 78 /78 variables (removed 0) and now considering 6632/6632 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2145 ms. Remains : 78/79 places, 6632/6632 transitions.
RANDOM walk for 40000 steps (8 resets) in 1988 ms. (20 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 608 ms. (65 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 241 ms. (165 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 249 ms. (160 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 250 ms. (159 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 196566 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :0 out of 4
Probabilistic random walk after 196566 steps, saw 36054 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :0
// Phase 1: matrix 6632 rows 78 cols
[2025-06-08 03:56:13] [INFO ] Computed 19 invariants in 58 ms
[2025-06-08 03:56:13] [INFO ] State equation strengthened by 18 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 26/72 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 6/78 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 6632/6710 variables, 78/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6710 variables, 18/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/6710 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/6710 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6710/6710 variables, and 115 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3570 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 78/78 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 4/0 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 120.0 s and query timeout 12000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 26/72 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 6/78 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 6632/6710 variables, 78/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6710 variables, 18/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/6710 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/6710 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6710/6710 variables, and 115 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4969 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 78/78 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8680ms problems are : Problem set: 0 solved, 4 unsolved
FORMULA ErlangenMainframeV0-PT-0707-ReachabilityFireability-2025-03 FALSE TECHNIQUES PARIKH_WALK
FORMULA ErlangenMainframeV0-PT-0707-ReachabilityFireability-2025-09 TRUE TECHNIQUES PARIKH_WALK
FORMULA ErlangenMainframeV0-PT-0707-ReachabilityFireability-2025-11 TRUE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 821 steps, including 33 resets, run visited all 1 properties in 29 ms. (steps per millisecond=28 )
FORMULA ErlangenMainframeV0-PT-0707-ReachabilityFireability-2025-15 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 4 properties in 822 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 176428 ms.

BK_STOP 1749354982750

--------------------
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="ErlangenMainframeV0-PT-0707"
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 ErlangenMainframeV0-PT-0707, 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-174931339600295"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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