Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r532-smll-171683810800126.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool ltsminxred
Input is SieveSingleMsgMbox-PT-d2m36, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r532-smll-171683810800126
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 19:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K Apr 12 19:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 12 19:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 12 19:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.1M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-2024-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-2024-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-2024-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-2024-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-2024-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-2024-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-2024-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-2024-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-2024-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-2024-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-2024-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-2024-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-2024-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-2024-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-2024-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717249208817

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m36
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:40:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 13:40:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:40:11] [INFO ] Load time of PNML (sax parser for PT used): 429 ms
[2024-06-01 13:40:11] [INFO ] Transformed 2398 places.
[2024-06-01 13:40:11] [INFO ] Transformed 1954 transitions.
[2024-06-01 13:40:12] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 671 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 48 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1984 places in 34 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8779 resets) in 3177 ms. (12 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3710 resets) in 816 ms. (48 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3793 resets) in 519 ms. (76 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 219709 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :0 out of 2
Probabilistic random walk after 219709 steps, saw 100322 distinct states, run finished after 3013 ms. (steps per millisecond=72 ) properties seen :0
// Phase 1: matrix 1954 rows 414 cols
[2024-06-01 13:40:16] [INFO ] Computed 6 invariants in 91 ms
[2024-06-01 13:40:17] [INFO ] State equation strengthened by 1674 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 147/152 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 52/204 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-2024-12 is UNSAT
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 210/414 variables, 3/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/414 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1954/2368 variables, 414/420 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2368/2368 variables, and 2094 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2719 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 414/414 constraints, ReadFeed: 1674/1674 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 148/151 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 52/203 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 211/414 variables, 3/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 13:40:21] [INFO ] Deduced a trap composed of 25 places in 704 ms of which 26 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/414 variables, 1/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/414 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1954/2368 variables, 414/421 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2368/2368 variables, and 2095 constraints, problems are : Problem set: 1 solved, 1 unsolved in 3457 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 414/414 constraints, ReadFeed: 1674/1674 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 6763ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 184 ms.
Support contains 3 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Graph (complete) has 2618 edges and 414 vertex of which 388 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.10 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 830 transitions.
Iterating post reduction 0 with 830 rules applied. Total rules applied 831 place count 388 transition count 1124
Discarding 117 places :
Symmetric choice reduction at 1 with 117 rule applications. Total rules 948 place count 271 transition count 379
Iterating global reduction 1 with 117 rules applied. Total rules applied 1065 place count 271 transition count 379
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 1075 place count 271 transition count 369
Discarding 91 places :
Symmetric choice reduction at 2 with 91 rule applications. Total rules 1166 place count 180 transition count 278
Iterating global reduction 2 with 91 rules applied. Total rules applied 1257 place count 180 transition count 278
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 1296 place count 180 transition count 239
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 1334 place count 142 transition count 186
Iterating global reduction 3 with 38 rules applied. Total rules applied 1372 place count 142 transition count 186
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 1395 place count 142 transition count 163
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1404 place count 133 transition count 150
Iterating global reduction 4 with 9 rules applied. Total rules applied 1413 place count 133 transition count 150
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1422 place count 124 transition count 141
Iterating global reduction 4 with 9 rules applied. Total rules applied 1431 place count 124 transition count 141
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1436 place count 119 transition count 135
Iterating global reduction 4 with 5 rules applied. Total rules applied 1441 place count 119 transition count 135
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1443 place count 119 transition count 133
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1447 place count 115 transition count 129
Iterating global reduction 5 with 4 rules applied. Total rules applied 1451 place count 115 transition count 129
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1452 place count 114 transition count 128
Iterating global reduction 5 with 1 rules applied. Total rules applied 1453 place count 114 transition count 128
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1454 place count 113 transition count 127
Iterating global reduction 5 with 1 rules applied. Total rules applied 1455 place count 113 transition count 127
Applied a total of 1455 rules in 260 ms. Remains 113 /414 variables (removed 301) and now considering 127/1954 (removed 1827) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 279 ms. Remains : 113/414 places, 127/1954 transitions.
RANDOM walk for 40000 steps (9084 resets) in 165 ms. (240 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (4158 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1972884 steps, run timeout after 3001 ms. (steps per millisecond=657 ) properties seen :0 out of 1
Probabilistic random walk after 1972884 steps, saw 921635 distinct states, run finished after 3001 ms. (steps per millisecond=657 ) properties seen :0
// Phase 1: matrix 127 rows 113 cols
[2024-06-01 13:40:27] [INFO ] Computed 4 invariants in 9 ms
[2024-06-01 13:40:27] [INFO ] State equation strengthened by 48 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/73 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/82 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 97/179 variables, 82/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 34/213 variables, 17/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 35/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/213 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 27/240 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/240 variables, 13/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/240 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/240 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 165 constraints, problems are : Problem set: 0 solved, 1 unsolved in 209 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/73 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/82 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 97/179 variables, 82/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 34/213 variables, 17/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 35/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/213 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/213 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 27/240 variables, 14/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/240 variables, 13/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:40:27] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 13 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/240 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/240 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/240 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 167 constraints, problems are : Problem set: 0 solved, 1 unsolved in 393 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 623ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 46 ms.
Support contains 3 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 127/127 transitions.
Applied a total of 0 rules in 17 ms. Remains 113 /113 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 113/113 places, 127/127 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 127/127 transitions.
Applied a total of 0 rules in 16 ms. Remains 113 /113 variables (removed 0) and now considering 127/127 (removed 0) transitions.
[2024-06-01 13:40:27] [INFO ] Invariant cache hit.
[2024-06-01 13:40:28] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-06-01 13:40:28] [INFO ] Invariant cache hit.
[2024-06-01 13:40:28] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-06-01 13:40:28] [INFO ] Implicit Places using invariants and state equation in 485 ms returned []
Implicit Place search using SMT with State Equation took 680 ms to find 0 implicit places.
[2024-06-01 13:40:28] [INFO ] Redundant transitions in 6 ms returned []
Running 126 sub problems to find dead transitions.
[2024-06-01 13:40:28] [INFO ] Invariant cache hit.
[2024-06-01 13:40:28] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (OVERLAPS) 1/113 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (OVERLAPS) 127/240 variables, 113/117 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 48/165 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-06-01 13:40:33] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 3 ms to minimize.
Problem TDEAD117 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD56 is UNSAT
At refinement iteration 8 (OVERLAPS) 0/240 variables, 1/166 constraints. Problems are: Problem set: 3 solved, 123 unsolved
[2024-06-01 13:40:35] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 2 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 1/167 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 0/167 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 11 (OVERLAPS) 0/240 variables, 0/167 constraints. Problems are: Problem set: 3 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 167 constraints, problems are : Problem set: 3 solved, 123 unsolved in 10486 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 3 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 4/113 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 2/4 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 2/6 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 127/240 variables, 113/119 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 48/167 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 123/290 constraints. Problems are: Problem set: 3 solved, 123 unsolved
[2024-06-01 13:40:43] [INFO ] Deduced a trap composed of 48 places in 65 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 1/291 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 0/291 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 11 (OVERLAPS) 0/240 variables, 0/291 constraints. Problems are: Problem set: 3 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 291 constraints, problems are : Problem set: 3 solved, 123 unsolved in 14899 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 123/126 constraints, Known Traps: 3/3 constraints]
After SMT, in 25749ms problems are : Problem set: 3 solved, 123 unsolved
Search for dead transitions found 3 dead transitions in 25757ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 113/113 places, 124/127 transitions.
Graph (complete) has 316 edges and 113 vertex of which 110 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 110 /113 variables (removed 3) and now considering 124/124 (removed 0) transitions.
// Phase 1: matrix 124 rows 110 cols
[2024-06-01 13:40:54] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 13:40:54] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-06-01 13:40:54] [INFO ] Invariant cache hit.
[2024-06-01 13:40:54] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-06-01 13:40:54] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 593 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 110/113 places, 124/127 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 27074 ms. Remains : 110/113 places, 124/127 transitions.
RANDOM walk for 40000 steps (9084 resets) in 129 ms. (307 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (4078 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2105999 steps, run timeout after 3001 ms. (steps per millisecond=701 ) properties seen :0 out of 1
Probabilistic random walk after 2105999 steps, saw 984938 distinct states, run finished after 3001 ms. (steps per millisecond=701 ) properties seen :0
[2024-06-01 13:40:57] [INFO ] Invariant cache hit.
[2024-06-01 13:40:57] [INFO ] State equation strengthened by 47 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 62/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/69 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 85/154 variables, 69/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 41/195 variables, 18/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 31/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 39/234 variables, 23/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 16/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/234 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 160 constraints, problems are : Problem set: 0 solved, 1 unsolved in 275 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 110/110 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 62/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/69 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:40:58] [INFO ] Deduced a trap composed of 29 places in 239 ms of which 1 ms to minimize.
[2024-06-01 13:40:58] [INFO ] Deduced a trap composed of 46 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 85/154 variables, 69/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 41/195 variables, 18/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 31/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/195 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/195 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 39/234 variables, 23/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/234 variables, 16/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:40:58] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/234 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/234 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/234 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 164 constraints, problems are : Problem set: 0 solved, 1 unsolved in 546 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 110/110 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 830ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 121 ms.
Support contains 3 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 124/124 transitions.
Applied a total of 0 rules in 11 ms. Remains 110 /110 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 110/110 places, 124/124 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 124/124 transitions.
Applied a total of 0 rules in 8 ms. Remains 110 /110 variables (removed 0) and now considering 124/124 (removed 0) transitions.
[2024-06-01 13:40:58] [INFO ] Invariant cache hit.
[2024-06-01 13:40:59] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-06-01 13:40:59] [INFO ] Invariant cache hit.
[2024-06-01 13:40:59] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-06-01 13:40:59] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 555 ms to find 0 implicit places.
[2024-06-01 13:40:59] [INFO ] Redundant transitions in 4 ms returned []
Running 123 sub problems to find dead transitions.
[2024-06-01 13:40:59] [INFO ] Invariant cache hit.
[2024-06-01 13:40:59] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 1/110 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 123 unsolved
Problem TDEAD49 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD112 is UNSAT
At refinement iteration 4 (OVERLAPS) 124/234 variables, 110/113 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 47/160 constraints. Problems are: Problem set: 3 solved, 120 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 0/160 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/234 variables, 0/160 constraints. Problems are: Problem set: 3 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 160 constraints, problems are : Problem set: 3 solved, 120 unsolved in 5112 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 110/110 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/107 variables, 2/3 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 123/230 variables, 107/110 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 46/156 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 16/172 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 0/172 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 4/234 variables, 3/175 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 1/176 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 104/280 constraints. Problems are: Problem set: 3 solved, 120 unsolved
[2024-06-01 13:41:11] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 2 ms to minimize.
[2024-06-01 13:41:11] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 2/282 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/282 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 13 (OVERLAPS) 0/234 variables, 0/282 constraints. Problems are: Problem set: 3 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 282 constraints, problems are : Problem set: 3 solved, 120 unsolved in 17974 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 110/110 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 120/123 constraints, Known Traps: 2/2 constraints]
After SMT, in 23416ms problems are : Problem set: 3 solved, 120 unsolved
Search for dead transitions found 3 dead transitions in 23420ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 110/110 places, 121/124 transitions.
Graph (complete) has 307 edges and 110 vertex of which 107 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 107 /110 variables (removed 3) and now considering 121/121 (removed 0) transitions.
// Phase 1: matrix 121 rows 107 cols
[2024-06-01 13:41:22] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 13:41:23] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-06-01 13:41:23] [INFO ] Invariant cache hit.
[2024-06-01 13:41:23] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-06-01 13:41:23] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 576 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 107/110 places, 121/124 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 24581 ms. Remains : 107/110 places, 121/124 transitions.
RANDOM walk for 40000 steps (8946 resets) in 101 ms. (392 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (4085 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2151668 steps, run timeout after 3001 ms. (steps per millisecond=716 ) properties seen :0 out of 1
Probabilistic random walk after 2151668 steps, saw 1003287 distinct states, run finished after 3001 ms. (steps per millisecond=716 ) properties seen :0
[2024-06-01 13:41:26] [INFO ] Invariant cache hit.
[2024-06-01 13:41:26] [INFO ] State equation strengthened by 46 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/69 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 85/154 variables, 69/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 38/192 variables, 17/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 31/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 36/228 variables, 21/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/228 variables, 15/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/228 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/228 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 156 constraints, problems are : Problem set: 0 solved, 1 unsolved in 250 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/69 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 85/154 variables, 69/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:41:26] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 38/192 variables, 17/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 31/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/192 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 36/228 variables, 21/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/228 variables, 15/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/228 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/228 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 158 constraints, problems are : Problem set: 0 solved, 1 unsolved in 300 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 559ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 23 ms.
Support contains 3 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 121/121 transitions.
Applied a total of 0 rules in 9 ms. Remains 107 /107 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 107/107 places, 121/121 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 121/121 transitions.
Applied a total of 0 rules in 9 ms. Remains 107 /107 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2024-06-01 13:41:27] [INFO ] Invariant cache hit.
[2024-06-01 13:41:27] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-06-01 13:41:27] [INFO ] Invariant cache hit.
[2024-06-01 13:41:27] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-06-01 13:41:27] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
[2024-06-01 13:41:27] [INFO ] Redundant transitions in 3 ms returned []
Running 120 sub problems to find dead transitions.
[2024-06-01 13:41:27] [INFO ] Invariant cache hit.
[2024-06-01 13:41:27] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (OVERLAPS) 1/107 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (OVERLAPS) 121/228 variables, 107/110 constraints. Problems are: Problem set: 0 solved, 120 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 46/156 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 0/228 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 156 constraints, problems are : Problem set: 0 solved, 120 unsolved in 5530 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (OVERLAPS) 1/107 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (OVERLAPS) 121/228 variables, 107/110 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 46/156 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 120/276 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-06-01 13:41:37] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 2 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 1/277 constraints. Problems are: Problem set: 5 solved, 115 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/228 variables, 0/277 constraints. Problems are: Problem set: 5 solved, 115 unsolved
At refinement iteration 10 (OVERLAPS) 0/228 variables, 0/277 constraints. Problems are: Problem set: 5 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 277 constraints, problems are : Problem set: 5 solved, 115 unsolved in 14448 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 1/1 constraints]
After SMT, in 20145ms problems are : Problem set: 5 solved, 115 unsolved
Search for dead transitions found 5 dead transitions in 20153ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) removed 5 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 107/107 places, 116/121 transitions.
Graph (complete) has 294 edges and 107 vertex of which 102 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 102 transition count 115
Applied a total of 2 rules in 11 ms. Remains 102 /107 variables (removed 5) and now considering 115/116 (removed 1) transitions.
// Phase 1: matrix 115 rows 102 cols
[2024-06-01 13:41:47] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 13:41:47] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-06-01 13:41:47] [INFO ] Invariant cache hit.
[2024-06-01 13:41:48] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-01 13:41:48] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 500 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 102/107 places, 115/121 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 21140 ms. Remains : 102/107 places, 115/121 transitions.
RANDOM walk for 40000 steps (8949 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (4050 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2437114 steps, run timeout after 3001 ms. (steps per millisecond=812 ) properties seen :0 out of 1
Probabilistic random walk after 2437114 steps, saw 1135922 distinct states, run finished after 3001 ms. (steps per millisecond=812 ) properties seen :0
[2024-06-01 13:41:51] [INFO ] Invariant cache hit.
[2024-06-01 13:41:51] [INFO ] State equation strengthened by 44 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 36/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/41 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 61/102 variables, 41/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 68/170 variables, 31/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 27/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 47/217 variables, 30/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/217 variables, 17/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/217 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/217 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 217/217 variables, and 148 constraints, problems are : Problem set: 0 solved, 1 unsolved in 137 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 36/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/41 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 61/102 variables, 41/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 68/170 variables, 31/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 27/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 47/217 variables, 30/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/217 variables, 17/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/217 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/217 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 217/217 variables, and 149 constraints, problems are : Problem set: 0 solved, 1 unsolved in 156 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 300ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 154 ms.
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 115/115 transitions.
Applied a total of 0 rules in 7 ms. Remains 102 /102 variables (removed 0) and now considering 115/115 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 102/102 places, 115/115 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 115/115 transitions.
Applied a total of 0 rules in 6 ms. Remains 102 /102 variables (removed 0) and now considering 115/115 (removed 0) transitions.
[2024-06-01 13:41:51] [INFO ] Invariant cache hit.
[2024-06-01 13:41:51] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-06-01 13:41:51] [INFO ] Invariant cache hit.
[2024-06-01 13:41:52] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-01 13:41:52] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 498 ms to find 0 implicit places.
[2024-06-01 13:41:52] [INFO ] Redundant transitions in 5 ms returned []
Running 114 sub problems to find dead transitions.
[2024-06-01 13:41:52] [INFO ] Invariant cache hit.
[2024-06-01 13:41:52] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (OVERLAPS) 1/102 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (OVERLAPS) 115/217 variables, 102/104 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 44/148 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-06-01 13:41:55] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (OVERLAPS) 0/217 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 217/217 variables, and 149 constraints, problems are : Problem set: 0 solved, 114 unsolved in 6376 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (OVERLAPS) 1/102 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (OVERLAPS) 115/217 variables, 102/105 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 44/149 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 114/263 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/217 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (OVERLAPS) 0/217 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 217/217 variables, and 263 constraints, problems are : Problem set: 0 solved, 114 unsolved in 9216 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 1/1 constraints]
After SMT, in 15797ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 15800ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16318 ms. Remains : 102/102 places, 115/115 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 102 transition count 107
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 96 transition count 107
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 14 place count 96 transition count 91
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 46 place count 80 transition count 91
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 56 place count 75 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 74 transition count 94
Applied a total of 58 rules in 39 ms. Remains 74 /102 variables (removed 28) and now considering 94/115 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 74 cols
[2024-06-01 13:42:08] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 13:42:08] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 13:42:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 13:42:08] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-01 13:42:08] [INFO ] After 77ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 13:42:08] [INFO ] After 94ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 13:42:08] [INFO ] After 171ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 270 ms.
[2024-06-01 13:42:08] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2024-06-01 13:42:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 102 places, 115 transitions and 455 arcs took 9 ms.
[2024-06-01 13:42:08] [INFO ] Flatten gal took : 87 ms
Total runtime 117750 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-2024-14

BK_STOP 1717249329204

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2024
rfs formula name SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-2024-14
rfs formula type AG
rfs formula formula --invariant=/tmp/688/inv_0_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="SieveSingleMsgMbox-PT-d2m36"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is SieveSingleMsgMbox-PT-d2m36, 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 r532-smll-171683810800126"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d2m36.tgz
mv SieveSingleMsgMbox-PT-d2m36 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;