Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 173K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 50K 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 DoubleExponent-PT-003-ReachabilityCardinality-2025-00
FORMULA_NAME DoubleExponent-PT-003-ReachabilityCardinality-2025-01
FORMULA_NAME DoubleExponent-PT-003-ReachabilityCardinality-2025-02
FORMULA_NAME DoubleExponent-PT-003-ReachabilityCardinality-2025-03
FORMULA_NAME DoubleExponent-PT-003-ReachabilityCardinality-2025-04
FORMULA_NAME DoubleExponent-PT-003-ReachabilityCardinality-2025-05
FORMULA_NAME DoubleExponent-PT-003-ReachabilityCardinality-2025-06
FORMULA_NAME DoubleExponent-PT-003-ReachabilityCardinality-2025-07
FORMULA_NAME DoubleExponent-PT-003-ReachabilityCardinality-2025-08
FORMULA_NAME DoubleExponent-PT-003-ReachabilityCardinality-2025-09
FORMULA_NAME DoubleExponent-PT-003-ReachabilityCardinality-2025-10
FORMULA_NAME DoubleExponent-PT-003-ReachabilityCardinality-2025-11
FORMULA_NAME DoubleExponent-PT-003-ReachabilityCardinality-2025-12
FORMULA_NAME DoubleExponent-PT-003-ReachabilityCardinality-2025-13
FORMULA_NAME DoubleExponent-PT-003-ReachabilityCardinality-2025-14
FORMULA_NAME DoubleExponent-PT-003-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1748729982853

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-003
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-05-31 22:19:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-31 22:19:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 22:19:44] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2025-05-31 22:19:44] [INFO ] Transformed 163 places.
[2025-05-31 22:19:44] [INFO ] Transformed 148 transitions.
[2025-05-31 22:19:44] [INFO ] Parsed PT model containing 163 places and 148 transitions and 417 arcs in 149 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
[2025-05-31 22:19:44] [INFO ] Flatten gal took : 108 ms
[2025-05-31 22:19:44] [INFO ] Flatten gal took : 43 ms
[2025-05-31 22:19:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17192801231205991240.gal : 24 ms
[2025-05-31 22:19:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8970935989619264873.prop : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17192801231205991240.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8970935989619264873.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (1308 resets) in 2146 ms. (18 steps per ms) remains 16/16 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 4001 steps (114 resets) in 169 ms. (23 steps per ms) remains 16/16 properties
Loading property file /tmp/ReachabilityCardinality8970935989619264873.prop.
BEST_FIRST walk for 4000 steps (110 resets) in 72 ms. (54 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (120 resets) in 43 ms. (90 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (94 resets) in 53 ms. (74 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (109 resets) in 46 ms. (85 steps per ms) remains 16/16 properties
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :4 after 7
BEST_FIRST walk for 4000 steps (115 resets) in 86 ms. (45 steps per ms) remains 16/16 properties
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :7 after 11
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :11 after 12
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :12 after 25
SDD proceeding with computation,16 properties remain. new max is 128
BEST_FIRST walk for 4001 steps (118 resets) in 38 ms. (102 steps per ms) remains 16/16 properties
SDD size :25 after 32
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :32 after 73
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :73 after 149
BEST_FIRST walk for 4000 steps (113 resets) in 45 ms. (86 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (115 resets) in 47 ms. (83 steps per ms) remains 16/16 properties
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :149 after 517
BEST_FIRST walk for 4002 steps (116 resets) in 39 ms. (100 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (141 resets) in 32 ms. (121 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (140 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (107 resets) in 31 ms. (125 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (114 resets) in 47 ms. (83 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (110 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (107 resets) in 35 ms. (111 steps per ms) remains 16/16 properties
SDD proceeding with computation,16 properties remain. new max is 2048
SDD size :517 after 2692
Reachability property DoubleExponent-PT-003-ReachabilityCardinality-2025-06 is true.
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,15 properties remain. new max is 2048
SDD size :48682 after 59745
Interrupted probabilistic random walk after 176002 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :1 out of 16
Probabilistic random walk after 176002 steps, saw 88027 distinct states, run finished after 3017 ms. (steps per millisecond=58 ) properties seen :1
// Phase 1: matrix 148 rows 163 cols
[2025-05-31 22:19:48] [INFO ] Computed 19 invariants in 15 ms
Excessive predecessor constraint size, skipping predecessor.
Invariant property DoubleExponent-PT-003-ReachabilityCardinality-2025-14 does not hold.
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2025-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
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/156 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 14 unsolved
Problem DoubleExponent-PT-003-ReachabilityCardinality-2025-00 is UNSAT
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2025-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem DoubleExponent-PT-003-ReachabilityCardinality-2025-02 is UNSAT
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2025-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem DoubleExponent-PT-003-ReachabilityCardinality-2025-04 is UNSAT
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2025-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem DoubleExponent-PT-003-ReachabilityCardinality-2025-08 is UNSAT
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2025-08 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 7/163 variables, 5/13 constraints. Problems are: Problem set: 5 solved, 10 unsolved
Problem DoubleExponent-PT-003-ReachabilityCardinality-2025-07 is UNSAT
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2025-07 TRUE TECHNIQUES SMT_REFINEMENT
Problem DoubleExponent-PT-003-ReachabilityCardinality-2025-11 is UNSAT
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2025-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem DoubleExponent-PT-003-ReachabilityCardinality-2025-12 is UNSAT
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2025-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 6/19 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/19 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 148/311 variables, 163/182 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 0/182 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/311 variables, 0/182 constraints. Problems are: Problem set: 8 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 182 constraints, problems are : Problem set: 8 solved, 7 unsolved in 2864 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 15/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 7 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 2/2 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/2 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 35/156 variables, 5/7 constraints. Problems are: Problem set: 8 solved, 7 unsolved
Problem DoubleExponent-PT-003-ReachabilityCardinality-2025-09 is UNSAT
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2025-09 TRUE TECHNIQUES SMT_REFINEMENT
Problem DoubleExponent-PT-003-ReachabilityCardinality-2025-13 is UNSAT
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2025-13 TRUE TECHNIQUES SMT_REFINEMENT
Problem DoubleExponent-PT-003-ReachabilityCardinality-2025-15 is UNSAT
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2025-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 5/12 constraints. Problems are: Problem set: 11 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:52] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:52] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:52] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:52] [INFO ] Deduced a trap composed of 66 places in 72 ms of which 12 ms to minimize.
Problem DoubleExponent-PT-003-ReachabilityCardinality-2025-01 is UNSAT
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2025-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem DoubleExponent-PT-003-ReachabilityCardinality-2025-05 is UNSAT
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2025-05 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 4/16 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/16 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 7/163 variables, 7/23 constraints. Problems are: Problem set: 13 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:52] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:52] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 2/25 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 0/25 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 148/311 variables, 163/188 constraints. Problems are: Problem set: 13 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:52] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:52] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/311 variables, 2/190 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/311 variables, 0/190 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/311 variables, 0/190 constraints. Problems are: Problem set: 13 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 311/311 variables, and 190 constraints, problems are : Problem set: 13 solved, 2 unsolved in 1300 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 2/11 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4384ms problems are : Problem set: 13 solved, 2 unsolved
Parikh walk visited 0 properties in 618 ms.
Support contains 77 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 148/148 transitions.
Graph (complete) has 269 edges and 163 vertex of which 161 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 161 transition count 146
Reduce places removed 2 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 7 rules applied. Total rules applied 10 place count 159 transition count 141
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 15 place count 154 transition count 141
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 15 place count 154 transition count 139
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 19 place count 152 transition count 139
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 33 place count 145 transition count 132
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 34 place count 145 transition count 131
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 35 place count 144 transition count 131
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 4 with 7 rules applied. Total rules applied 42 place count 144 transition count 124
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 49 place count 137 transition count 124
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 51 place count 137 transition count 124
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 52 place count 137 transition count 124
Applied a total of 52 rules in 56 ms. Remains 137 /163 variables (removed 26) and now considering 124/148 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 137/163 places, 124/148 transitions.
RANDOM walk for 40000 steps (1623 resets) in 238 ms. (167 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (1904 resets) in 311 ms. (128 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (1904 resets) in 129 ms. (307 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 571678 steps, run timeout after 3001 ms. (steps per millisecond=190 ) properties seen :0 out of 2
Probabilistic random walk after 571678 steps, saw 285964 distinct states, run finished after 3001 ms. (steps per millisecond=190 ) properties seen :0
// Phase 1: matrix 124 rows 137 cols
[2025-05-31 22:19:56] [INFO ] Computed 17 invariants in 4 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 4/81 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 52/133 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 124/257 variables, 133/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/261 variables, 4/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/261 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 261/261 variables, and 154 constraints, problems are : Problem set: 0 solved, 2 unsolved in 830 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 4/81 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 52/133 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 124/257 variables, 133/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/261 variables, 4/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:58] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:58] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:58] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/261 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/261 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/261 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 261/261 variables, and 157 constraints, problems are : Problem set: 0 solved, 2 unsolved in 726 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1577ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 325 ms.
Support contains 77 out of 137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 137/137 places, 124/124 transitions.
Applied a total of 0 rules in 6 ms. Remains 137 /137 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 137/137 places, 124/124 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 137/137 places, 124/124 transitions.
Applied a total of 0 rules in 4 ms. Remains 137 /137 variables (removed 0) and now considering 124/124 (removed 0) transitions.
[2025-05-31 22:19:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:19:58] [INFO ] Implicit Places using invariants in 63 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 72 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 136/137 places, 124/124 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 123
Applied a total of 2 rules in 9 ms. Remains 135 /136 variables (removed 1) and now considering 123/124 (removed 1) transitions.
// Phase 1: matrix 123 rows 135 cols
[2025-05-31 22:19:58] [INFO ] Computed 16 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:19:58] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-05-31 22:19:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:19:59] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 135/137 places, 123/124 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 267 ms. Remains : 135/137 places, 123/124 transitions.
RANDOM walk for 40000 steps (1569 resets) in 119 ms. (333 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (1904 resets) in 140 ms. (283 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (1904 resets) in 134 ms. (296 steps per ms) remains 2/2 properties
SDD proceeding with computation,14 properties remain. new max is 2048
SDD size :318071 after 329127
Interrupted probabilistic random walk after 596378 steps, run timeout after 3001 ms. (steps per millisecond=198 ) properties seen :0 out of 2
Probabilistic random walk after 596378 steps, saw 298544 distinct states, run finished after 3001 ms. (steps per millisecond=198 ) properties seen :0
[2025-05-31 22:20:02] [INFO ] Invariant cache hit.
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/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 4/81 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 47/128 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 7/258 variables, 7/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/258 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 151 constraints, problems are : Problem set: 0 solved, 2 unsolved in 727 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 4/81 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 47/128 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 7/258 variables, 7/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:20:03] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:20:03] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:20:03] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 3/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:20:03] [INFO ] Deduced a trap along path composed of 16 places in 37 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/258 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 155 constraints, problems are : Problem set: 0 solved, 2 unsolved in 887 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1623ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 305 ms.
Support contains 77 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 123/123 transitions.
Applied a total of 0 rules in 3 ms. Remains 135 /135 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 135/135 places, 123/123 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 123/123 transitions.
Applied a total of 0 rules in 7 ms. Remains 135 /135 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2025-05-31 22:20:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:20:04] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-05-31 22:20:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:20:04] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 22:20:04] [INFO ] Redundant transitions in 5 ms returned []
Running 122 sub problems to find dead transitions.
[2025-05-31 22:20:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:20:05] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 2/135 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 123/258 variables, 135/152 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:20:07] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:20:07] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:20:07] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:20:07] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:20:07] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:20:07] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:20:08] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 7/159 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:20:10] [INFO ] Deduced a trap along path composed of 4 places in 19 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:20:11] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/258 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 13 (OVERLAPS) 0/258 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 161 constraints, problems are : Problem set: 0 solved, 122 unsolved in 13521 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 2/135 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 123/258 variables, 135/160 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 122/282 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:20:20] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:20:27] [INFO ] Deduced a trap along path composed of 9 places in 86 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:20:27] [INFO ] Deduced a trap along path composed of 28 places in 46 ms of which 1 ms to minimize.
SDD proceeding with computation,14 properties remain. new max is 4096
SDD size :853893 after 856044
At refinement iteration 12 (INCLUDED_ONLY) 0/258 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:20:33] [INFO ] Deduced a trap composed of 31 places in 269 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/258 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:20:39] [INFO ] Deduced a trap composed of 38 places in 496 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/258 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 258/258 variables, and 288 constraints, problems are : Problem set: 0 solved, 122 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 43578ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 43578ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43809 ms. Remains : 135/135 places, 123/123 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-31 22:20:47] [INFO ] Flatten gal took : 18 ms
[2025-05-31 22:20:47] [INFO ] Applying decomposition
[2025-05-31 22:20:48] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7143197259452343160.txt' '-o' '/tmp/graph7143197259452343160.bin' '-w' '/tmp/graph7143197259452343160.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7143197259452343160.bin' '-l' '-1' '-v' '-w' '/tmp/graph7143197259452343160.weights' '-q' '0' '-e' '0.001'
[2025-05-31 22:20:48] [INFO ] Decomposing Gal with order
[2025-05-31 22:20:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 22:20:48] [INFO ] Removed a total of 43 redundant transitions.
[2025-05-31 22:20:48] [INFO ] Flatten gal took : 65 ms
[2025-05-31 22:20:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2025-05-31 22:20:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality440143078245905377.gal : 18 ms
[2025-05-31 22:20:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10810363081220011511.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality440143078245905377.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10810363081220011511.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/ReachabilityCardinality10810363081220011511.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 9
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :9 after 12
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :12 after 26
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :26 after 39
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :39 after 75
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :75 after 147
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :147 after 353
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :353 after 1732
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :4601 after 4690
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :28506 after 28519
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :97064 after 97097
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :237206 after 237362
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :518189 after 535406
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :1.11086e+06 after 1.1227e+06
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :2.31321e+06 after 2.31544e+06
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flatf,2.38507e+06,84.2762,217368,2,120395,29,995775,8,0,898,437220,0
Total reachable state count : 2385072

Verifying 2 reachability properties.
Invariant property DoubleExponent-PT-003-ReachabilityCardinality-2025-03 is true.
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DoubleExponent-PT-003-ReachabilityCardinality-2025-03,0,85.0372,217368,1,0,29,995775,8,0,1549,437220,0
Reachability property DoubleExponent-PT-003-ReachabilityCardinality-2025-10 does not hold.
FORMULA DoubleExponent-PT-003-ReachabilityCardinality-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
No reachable states exhibit your property : DoubleExponent-PT-003-ReachabilityCardinality-2025-10

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DoubleExponent-PT-003-ReachabilityCardinality-2025-10,0,85.7012,217368,1,0,29,995775,8,0,1938,437220,0
All properties solved without resorting to model-checking.
Total runtime 150133 ms.

BK_STOP 1748730134280

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleExponent-PT-003"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is DoubleExponent-PT-003, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r072-tall-174860067500478"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-003.tgz
mv DoubleExponent-PT-003 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;