Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 90K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748851501816

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-06-02 08:05:04] [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-02 08:05:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 08:05:04] [INFO ] Load time of PNML (sax parser for PT used): 188 ms
[2025-06-02 08:05:04] [INFO ] Transformed 147 places.
[2025-06-02 08:05:04] [INFO ] Transformed 312 transitions.
[2025-06-02 08:05:04] [INFO ] Found NUPN structural information;
[2025-06-02 08:05:04] [INFO ] Parsed PT model containing 147 places and 312 transitions and 1378 arcs in 424 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 28 ms.
Working with output stream class java.io.PrintStream
[2025-06-02 08:05:05] [INFO ] Flatten gal took : 120 ms
RANDOM walk for 40000 steps (1988 resets) in 2352 ms. (16 steps per ms) remains 16/16 properties
[2025-06-02 08:05:05] [INFO ] Flatten gal took : 91 ms
BEST_FIRST walk for 4003 steps (55 resets) in 133 ms. (29 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (63 resets) in 161 ms. (24 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (67 resets) in 107 ms. (37 steps per ms) remains 16/16 properties
[2025-06-02 08:05:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17365039227990694584.gal : 69 ms
BEST_FIRST walk for 4002 steps (53 resets) in 69 ms. (57 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (59 resets) in 122 ms. (32 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (55 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (51 resets) in 78 ms. (50 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (48 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (54 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (58 resets) in 77 ms. (51 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (47 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (56 resets) in 80 ms. (49 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (51 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (59 resets) in 21 ms. (181 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (59 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (57 resets) in 87 ms. (45 steps per ms) remains 16/16 properties
[2025-06-02 08:05:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14694358243102418081.prop : 18 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/ReachabilityCardinality17365039227990694584.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14694358243102418081.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 ...330
Loading property file /tmp/ReachabilityCardinality14694358243102418081.prop.
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :7 after 10
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :10 after 38
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :38 after 74
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :2276 after 3020
Reachability property MedleyA-PT-08-ReachabilityFireability-2025-07 is true.
FORMULA MedleyA-PT-08-ReachabilityFireability-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Invariant property MedleyA-PT-08-ReachabilityFireability-2025-04 does not hold.
FORMULA MedleyA-PT-08-ReachabilityFireability-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,14 properties remain. new max is 128
SDD size :3020 after 5302
Invariant property MedleyA-PT-08-ReachabilityFireability-2025-10 does not hold.
FORMULA MedleyA-PT-08-ReachabilityFireability-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,13 properties remain. new max is 128
SDD size :5302 after 10692
Reachability property MedleyA-PT-08-ReachabilityFireability-2025-09 is true.
FORMULA MedleyA-PT-08-ReachabilityFireability-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Invariant property MedleyA-PT-08-ReachabilityFireability-2025-02 does not hold.
FORMULA MedleyA-PT-08-ReachabilityFireability-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property MedleyA-PT-08-ReachabilityFireability-2025-01 is true.
FORMULA MedleyA-PT-08-ReachabilityFireability-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :10692 after 15361
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :15361 after 18092
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :18092 after 49968
Reachability property MedleyA-PT-08-ReachabilityFireability-2025-03 is true.
FORMULA MedleyA-PT-08-ReachabilityFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :49968 after 117897
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :117897 after 213949
Interrupted probabilistic random walk after 396844 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :2 out of 16
Probabilistic random walk after 396844 steps, saw 78892 distinct states, run finished after 3018 ms. (steps per millisecond=131 ) properties seen :2
FORMULA MedleyA-PT-08-ReachabilityFireability-2025-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 312 rows 147 cols
[2025-06-02 08:05:09] [INFO ] Computed 11 invariants in 37 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
SDD proceeding with computation,9 properties remain. new max is 2048
SDD size :213949 after 372518
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem MedleyA-PT-08-ReachabilityFireability-2025-11 is UNSAT
FORMULA MedleyA-PT-08-ReachabilityFireability-2025-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem MedleyA-PT-08-ReachabilityFireability-2025-12 is UNSAT
FORMULA MedleyA-PT-08-ReachabilityFireability-2025-12 FALSE TECHNIQUES SMT_REFINEMENT
Problem MedleyA-PT-08-ReachabilityFireability-2025-13 is UNSAT
FORMULA MedleyA-PT-08-ReachabilityFireability-2025-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 62/115 variables, 6/59 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 62/121 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/121 constraints. Problems are: Problem set: 3 solved, 5 unsolved
Problem MedleyA-PT-08-ReachabilityFireability-2025-05 is UNSAT
FORMULA MedleyA-PT-08-ReachabilityFireability-2025-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem MedleyA-PT-08-ReachabilityFireability-2025-14 is UNSAT
FORMULA MedleyA-PT-08-ReachabilityFireability-2025-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 32/147 variables, 5/126 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 32/158 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 0/158 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 312/459 variables, 147/305 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/459 variables, 0/305 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/459 variables, 0/305 constraints. Problems are: Problem set: 5 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 459/459 variables, and 305 constraints, problems are : Problem set: 5 solved, 3 unsolved in 881 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 8/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 41/41 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/41 constraints. Problems are: Problem set: 5 solved, 3 unsolved
Problem MedleyA-PT-08-ReachabilityFireability-2025-15 is UNSAT
FORMULA MedleyA-PT-08-ReachabilityFireability-2025-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 69/110 variables, 6/47 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 69/116 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/116 constraints. Problems are: Problem set: 6 solved, 2 unsolved
Problem MedleyA-PT-08-ReachabilityFireability-2025-00 is UNSAT
FORMULA MedleyA-PT-08-ReachabilityFireability-2025-00 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 37/147 variables, 5/121 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 37/158 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 0/158 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 312/459 variables, 147/305 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/459 variables, 0/305 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/459 variables, 0/305 constraints. Problems are: Problem set: 7 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 459/459 variables, and 305 constraints, problems are : Problem set: 7 solved, 1 unsolved in 490 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 2/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1558ms problems are : Problem set: 7 solved, 1 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 33 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 312/312 transitions.
Graph (complete) has 508 edges and 147 vertex of which 142 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 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 0 with 7 rules applied. Total rules applied 8 place count 142 transition count 303
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 139 transition count 301
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 15 place count 137 transition count 301
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 15 place count 137 transition count 298
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 21 place count 134 transition count 298
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 59 place count 96 transition count 252
Iterating global reduction 3 with 38 rules applied. Total rules applied 97 place count 96 transition count 252
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 101 place count 96 transition count 248
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 106 place count 91 transition count 239
Iterating global reduction 4 with 5 rules applied. Total rules applied 111 place count 91 transition count 239
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 119 place count 87 transition count 235
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 120 place count 86 transition count 234
Iterating global reduction 4 with 1 rules applied. Total rules applied 121 place count 86 transition count 234
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 129 place count 82 transition count 262
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 4 with 36 rules applied. Total rules applied 165 place count 82 transition count 226
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 165 place count 82 transition count 223
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 171 place count 79 transition count 223
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 174 place count 79 transition count 220
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 177 place count 76 transition count 220
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 178 place count 76 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 179 place count 75 transition count 219
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 182 place count 75 transition count 219
Applied a total of 182 rules in 168 ms. Remains 75 /147 variables (removed 72) and now considering 219/312 (removed 93) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 179 ms. Remains : 75/147 places, 219/312 transitions.
RANDOM walk for 40000 steps (2959 resets) in 601 ms. (66 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (698 resets) in 225 ms. (177 steps per ms) remains 1/1 properties
SDD proceeding with computation,9 properties remain. new max is 4096
SDD size :372518 after 996040
Interrupted probabilistic random walk after 1806655 steps, run timeout after 3001 ms. (steps per millisecond=602 ) properties seen :0 out of 1
Probabilistic random walk after 1806655 steps, saw 324686 distinct states, run finished after 3001 ms. (steps per millisecond=602 ) properties seen :0
// Phase 1: matrix 219 rows 75 cols
[2025-06-02 08:05:14] [INFO ] Computed 9 invariants in 4 ms
[2025-06-02 08:05:14] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 21/54 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 17/71 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 219/290 variables, 71/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/294 variables, 4/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/294 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/294 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 294/294 variables, and 104 constraints, problems are : Problem set: 0 solved, 1 unsolved in 208 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 75/75 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 21/54 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 17/71 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 219/290 variables, 71/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:05:14] [INFO ] Deduced a trap along path composed of 2 places in 37 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/294 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:05:14] [INFO ] Deduced a trap along path composed of 2 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:05:15] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/294 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/294 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/294 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 294/294 variables, and 107 constraints, problems are : Problem set: 0 solved, 1 unsolved in 455 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 75/75 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 692ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 33 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 219/219 transitions.
Applied a total of 0 rules in 8 ms. Remains 75 /75 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 75/75 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 219/219 transitions.
Applied a total of 0 rules in 7 ms. Remains 75 /75 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2025-06-02 08:05:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:05:15] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-06-02 08:05:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:05:15] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-02 08:05:15] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 08:05:15] [INFO ] Redundant transitions in 20 ms returned []
Running 218 sub problems to find dead transitions.
[2025-06-02 08:05:15] [INFO ] Invariant cache hit.
[2025-06-02 08:05:15] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/75 variables, 4/9 constraints. Problems are: Problem set: 50 solved, 168 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:05:18] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:05:19] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:05:19] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:05:19] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 4/13 constraints. Problems are: Problem set: 50 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/13 constraints. Problems are: Problem set: 50 solved, 168 unsolved
At refinement iteration 5 (OVERLAPS) 219/294 variables, 75/88 constraints. Problems are: Problem set: 50 solved, 168 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 20/108 constraints. Problems are: Problem set: 50 solved, 168 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:05:23] [INFO ] Deduced a trap along path composed of 2 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:05:23] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 2/110 constraints. Problems are: Problem set: 50 solved, 168 unsolved
SDD proceeding with computation,9 properties remain. new max is 8192
SDD size :996040 after 4.47741e+06
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 0/110 constraints. Problems are: Problem set: 50 solved, 168 unsolved
At refinement iteration 9 (OVERLAPS) 0/294 variables, 0/110 constraints. Problems are: Problem set: 50 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 294/294 variables, and 110 constraints, problems are : Problem set: 50 solved, 168 unsolved in 16101 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 75/75 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 50 solved, 168 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 5/5 constraints. Problems are: Problem set: 50 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/5 constraints. Problems are: Problem set: 50 solved, 168 unsolved
At refinement iteration 2 (OVERLAPS) 1/75 variables, 4/9 constraints. Problems are: Problem set: 50 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 4/13 constraints. Problems are: Problem set: 50 solved, 168 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:05:32] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 1/14 constraints. Problems are: Problem set: 50 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/14 constraints. Problems are: Problem set: 50 solved, 168 unsolved
At refinement iteration 6 (OVERLAPS) 219/294 variables, 75/89 constraints. Problems are: Problem set: 50 solved, 168 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 20/109 constraints. Problems are: Problem set: 50 solved, 168 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 168/277 constraints. Problems are: Problem set: 50 solved, 168 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:05:36] [INFO ] Deduced a trap composed of 38 places in 160 ms of which 10 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/294 variables, 1/278 constraints. Problems are: Problem set: 50 solved, 168 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:05:39] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/294 variables, 1/279 constraints. Problems are: Problem set: 50 solved, 168 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/294 variables, 2/281 constraints. Problems are: Problem set: 50 solved, 168 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:05:49] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/294 variables, 1/282 constraints. Problems are: Problem set: 50 solved, 168 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:05:52] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 5 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/294 variables, 1/283 constraints. Problems are: Problem set: 50 solved, 168 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:05:59] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 8 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/294 variables, 1/284 constraints. Problems are: Problem set: 50 solved, 168 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 294/294 variables, and 284 constraints, problems are : Problem set: 50 solved, 168 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 75/75 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 168/218 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 46585ms problems are : Problem set: 50 solved, 168 unsolved
Search for dead transitions found 50 dead transitions in 46591ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 75/75 places, 169/219 transitions.
Applied a total of 0 rules in 7 ms. Remains 75 /75 variables (removed 0) and now considering 169/169 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 08:06:02] [INFO ] Redundant transitions in 15 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 46968 ms. Remains : 75/75 places, 169/219 transitions.
RANDOM walk for 40000 steps (2947 resets) in 539 ms. (74 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (734 resets) in 343 ms. (116 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2120279 steps, run timeout after 3001 ms. (steps per millisecond=706 ) properties seen :0 out of 1
Probabilistic random walk after 2120279 steps, saw 379771 distinct states, run finished after 3001 ms. (steps per millisecond=706 ) properties seen :0
// Phase 1: matrix 169 rows 75 cols
[2025-06-02 08:06:05] [INFO ] Computed 9 invariants in 4 ms
[2025-06-02 08:06:05] [INFO ] State equation strengthened by 6 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/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 21/54 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 17/71 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 169/240 variables, 71/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 6/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/244 variables, 4/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/244 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/244 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 244/244 variables, and 90 constraints, problems are : Problem set: 0 solved, 1 unsolved in 156 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 75/75 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 21/54 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 17/71 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 169/240 variables, 71/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 6/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/244 variables, 4/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:06:05] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/244 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/244 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/244 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 244/244 variables, and 91 constraints, problems are : Problem set: 0 solved, 1 unsolved in 219 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 75/75 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 389ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 33 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 169/169 transitions.
Applied a total of 0 rules in 8 ms. Remains 75 /75 variables (removed 0) and now considering 169/169 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 75/75 places, 169/169 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 169/169 transitions.
Applied a total of 0 rules in 9 ms. Remains 75 /75 variables (removed 0) and now considering 169/169 (removed 0) transitions.
[2025-06-02 08:06:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:06:05] [INFO ] Implicit Places using invariants in 67 ms returned [38]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 70 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 74/75 places, 169/169 transitions.
Applied a total of 0 rules in 6 ms. Remains 74 /74 variables (removed 0) and now considering 169/169 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 85 ms. Remains : 74/75 places, 169/169 transitions.
RANDOM walk for 40000 steps (2960 resets) in 134 ms. (296 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (732 resets) in 163 ms. (243 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2232411 steps, run timeout after 3001 ms. (steps per millisecond=743 ) properties seen :0 out of 1
Probabilistic random walk after 2232411 steps, saw 400247 distinct states, run finished after 3001 ms. (steps per millisecond=743 ) properties seen :0
// Phase 1: matrix 169 rows 74 cols
[2025-06-02 08:06:08] [INFO ] Computed 8 invariants in 6 ms
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/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 27/60 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 10/70 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 169/239 variables, 70/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/243 variables, 4/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:06:09] [INFO ] Deduced a trap along path composed of 2 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/243 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/243 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/243 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 83 constraints, problems are : Problem set: 0 solved, 1 unsolved in 292 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 74/74 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 27/60 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 10/70 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 169/239 variables, 70/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/243 variables, 4/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:06:09] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/243 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/243 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/243 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/243 variables, and 84 constraints, problems are : Problem set: 0 solved, 1 unsolved in 279 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 74/74 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 584ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 74 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=74 )
FORMULA MedleyA-PT-08-ReachabilityFireability-2025-06 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 9 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 65156 ms.

BK_STOP 1748851569640

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

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