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-171683810800143.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-d2m96, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r532-smll-171683810800143
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:40 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 14K Apr 12 19:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 12 19:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 12 19:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 12 19:38 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-d2m96-ReachabilityFireability-2024-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-ReachabilityFireability-2024-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-ReachabilityFireability-2024-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-ReachabilityFireability-2024-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-ReachabilityFireability-2024-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-ReachabilityFireability-2024-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-ReachabilityFireability-2024-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-ReachabilityFireability-2024-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-ReachabilityFireability-2024-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-ReachabilityFireability-2024-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-ReachabilityFireability-2024-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-ReachabilityFireability-2024-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-ReachabilityFireability-2024-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-ReachabilityFireability-2024-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-ReachabilityFireability-2024-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717251355654

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m96
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:15:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 14:15:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:15:58] [INFO ] Load time of PNML (sax parser for PT used): 484 ms
[2024-06-01 14:15:58] [INFO ] Transformed 2398 places.
[2024-06-01 14:15:58] [INFO ] Transformed 1954 transitions.
[2024-06-01 14:15:58] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 889 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 38 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1984 places in 35 ms
Reduce places removed 1984 places and 0 transitions.
RANDOM walk for 40000 steps (8867 resets) in 3946 ms. (10 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (157 resets) in 201 ms. (19 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (161 resets) in 144 ms. (27 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (172 resets) in 201 ms. (19 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (170 resets) in 105 ms. (37 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (182 resets) in 58 ms. (67 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (161 resets) in 62 ms. (63 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (176 resets) in 102 ms. (38 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (186 resets) in 53 ms. (74 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (171 resets) in 56 ms. (70 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (171 resets) in 49 ms. (80 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (186 resets) in 53 ms. (74 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (189 resets) in 41 ms. (95 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (146 resets) in 341 ms. (11 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (191 resets) in 199 ms. (20 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (354 resets) in 255 ms. (15 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (182 resets) in 158 ms. (25 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 145102 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :6 out of 16
Probabilistic random walk after 145102 steps, saw 66487 distinct states, run finished after 3009 ms. (steps per millisecond=48 ) properties seen :6
FORMULA SieveSingleMsgMbox-PT-d2m96-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d2m96-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d2m96-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d2m96-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d2m96-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d2m96-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 1954 rows 414 cols
[2024-06-01 14:16:04] [INFO ] Computed 6 invariants in 66 ms
[2024-06-01 14:16:04] [INFO ] State equation strengthened by 1674 read => feed constraints.
Problem SieveSingleMsgMbox-PT-d2m96-ReachabilityFireability-2024-06 is UNSAT
FORMULA SieveSingleMsgMbox-PT-d2m96-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 172/259 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Problem SieveSingleMsgMbox-PT-d2m96-ReachabilityFireability-2024-07 is UNSAT
FORMULA SieveSingleMsgMbox-PT-d2m96-ReachabilityFireability-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem SieveSingleMsgMbox-PT-d2m96-ReachabilityFireability-2024-10 is UNSAT
FORMULA SieveSingleMsgMbox-PT-d2m96-ReachabilityFireability-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem SieveSingleMsgMbox-PT-d2m96-ReachabilityFireability-2024-12 is UNSAT
FORMULA SieveSingleMsgMbox-PT-d2m96-ReachabilityFireability-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 155/414 variables, 3/6 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/414 variables, 0/6 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1954/2368 variables, 414/420 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2368 variables, 1674/2094 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2368 variables, 0/2094 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/2368 variables, 0/2094 constraints. Problems are: Problem set: 4 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2368/2368 variables, and 2094 constraints, problems are : Problem set: 4 solved, 6 unsolved in 5082 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: 10/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 194/241 variables, 3/3 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 173/414 variables, 3/6 constraints. Problems are: Problem set: 4 solved, 6 unsolved
[2024-06-01 14:16:10] [INFO ] Deduced a trap composed of 152 places in 288 ms of which 47 ms to minimize.
[2024-06-01 14:16:11] [INFO ] Deduced a trap composed of 155 places in 138 ms of which 4 ms to minimize.
[2024-06-01 14:16:11] [INFO ] Deduced a trap composed of 44 places in 170 ms of which 3 ms to minimize.
[2024-06-01 14:16:11] [INFO ] Deduced a trap composed of 134 places in 166 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/414 variables, 4/10 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/414 variables, 0/10 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 1954/2368 variables, 414/424 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2368 variables, 1674/2098 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2368 variables, 4/2102 constraints. Problems are: Problem set: 4 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2368/2368 variables, and 2102 constraints, problems are : Problem set: 4 solved, 6 unsolved in 5010 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: 6/6 constraints, Known Traps: 4/4 constraints]
After SMT, in 11349ms problems are : Problem set: 4 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 47 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.9 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 82 places :
Symmetric choice reduction at 1 with 82 rule applications. Total rules 913 place count 306 transition count 893
Iterating global reduction 1 with 82 rules applied. Total rules applied 995 place count 306 transition count 893
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 1010 place count 306 transition count 878
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 1055 place count 261 transition count 833
Iterating global reduction 2 with 45 rules applied. Total rules applied 1100 place count 261 transition count 833
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 1117 place count 261 transition count 816
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 1145 place count 233 transition count 785
Iterating global reduction 3 with 28 rules applied. Total rules applied 1173 place count 233 transition count 785
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Iterating post reduction 3 with 97 rules applied. Total rules applied 1270 place count 233 transition count 688
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1274 place count 229 transition count 678
Iterating global reduction 4 with 4 rules applied. Total rules applied 1278 place count 229 transition count 678
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1282 place count 225 transition count 674
Iterating global reduction 4 with 4 rules applied. Total rules applied 1286 place count 225 transition count 674
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1287 place count 224 transition count 672
Iterating global reduction 4 with 1 rules applied. Total rules applied 1288 place count 224 transition count 672
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1289 place count 223 transition count 671
Iterating global reduction 4 with 1 rules applied. Total rules applied 1290 place count 223 transition count 671
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1291 place count 222 transition count 670
Iterating global reduction 4 with 1 rules applied. Total rules applied 1292 place count 222 transition count 670
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1293 place count 221 transition count 669
Iterating global reduction 4 with 1 rules applied. Total rules applied 1294 place count 221 transition count 669
Applied a total of 1294 rules in 381 ms. Remains 221 /414 variables (removed 193) and now considering 669/1954 (removed 1285) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 399 ms. Remains : 221/414 places, 669/1954 transitions.
RANDOM walk for 40000 steps (8905 resets) in 1003 ms. (39 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1896 resets) in 313 ms. (127 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1943 resets) in 216 ms. (184 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1886 resets) in 374 ms. (106 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1906 resets) in 216 ms. (184 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (1883 resets) in 286 ms. (139 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1855 resets) in 323 ms. (123 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 316084 steps, run timeout after 3001 ms. (steps per millisecond=105 ) properties seen :2 out of 6
Probabilistic random walk after 316084 steps, saw 151654 distinct states, run finished after 3001 ms. (steps per millisecond=105 ) properties seen :2
FORMULA SieveSingleMsgMbox-PT-d2m96-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d2m96-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 669 rows 221 cols
[2024-06-01 14:16:19] [INFO ] Computed 4 invariants in 14 ms
[2024-06-01 14:16:19] [INFO ] State equation strengthened by 502 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 102/128 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 14/142 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 511/653 variables, 142/146 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/653 variables, 344/490 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/653 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 237/890 variables, 79/569 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/890 variables, 158/727 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/890 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/890 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 890/890 variables, and 727 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1310 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 221/221 constraints, ReadFeed: 502/502 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 102/128 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 14/142 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 511/653 variables, 142/146 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/653 variables, 344/490 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/653 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 237/890 variables, 79/569 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/890 variables, 158/727 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/890 variables, 4/731 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 14:16:23] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/890 variables, 1/732 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/890 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/890 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 890/890 variables, and 732 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3836 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 221/221 constraints, ReadFeed: 502/502 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 5250ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 5290 ms.
Support contains 26 out of 221 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 221/221 places, 669/669 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 204 transition count 516
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 204 transition count 516
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 204 transition count 514
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 54 place count 186 transition count 493
Iterating global reduction 1 with 18 rules applied. Total rules applied 72 place count 186 transition count 493
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 82 place count 186 transition count 483
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 85 place count 183 transition count 480
Iterating global reduction 2 with 3 rules applied. Total rules applied 88 place count 183 transition count 480
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 90 place count 183 transition count 478
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 91 place count 182 transition count 477
Iterating global reduction 3 with 1 rules applied. Total rules applied 92 place count 182 transition count 477
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 93 place count 181 transition count 476
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 181 transition count 476
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 95 place count 180 transition count 475
Iterating global reduction 3 with 1 rules applied. Total rules applied 96 place count 180 transition count 475
Applied a total of 96 rules in 75 ms. Remains 180 /221 variables (removed 41) and now considering 475/669 (removed 194) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 180/221 places, 475/669 transitions.
RANDOM walk for 40000 steps (8914 resets) in 349 ms. (114 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1894 resets) in 238 ms. (167 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (1954 resets) in 195 ms. (204 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1854 resets) in 180 ms. (221 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1871 resets) in 167 ms. (238 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 450536 steps, run timeout after 3001 ms. (steps per millisecond=150 ) properties seen :1 out of 4
Probabilistic random walk after 450536 steps, saw 205496 distinct states, run finished after 3001 ms. (steps per millisecond=150 ) properties seen :1
FORMULA SieveSingleMsgMbox-PT-d2m96-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 475 rows 180 cols
[2024-06-01 14:16:33] [INFO ] Computed 4 invariants in 6 ms
[2024-06-01 14:16:33] [INFO ] State equation strengthened by 334 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 76/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 14/95 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 11/106 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 233/339 variables, 106/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 92/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 316/655 variables, 74/276 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/655 variables, 242/518 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/655 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/655 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 655/655 variables, and 518 constraints, problems are : Problem set: 0 solved, 3 unsolved in 639 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 180/180 constraints, ReadFeed: 334/334 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 76/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 14/95 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 11/106 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 233/339 variables, 106/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 92/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 316/655 variables, 74/276 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/655 variables, 242/518 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/655 variables, 3/521 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/655 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/655 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 655/655 variables, and 521 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1770 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 180/180 constraints, ReadFeed: 334/334 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 2451ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 22443 ms.
Support contains 5 out of 180 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 475/475 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 160 transition count 245
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 160 transition count 245
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 60 place count 140 transition count 225
Iterating global reduction 0 with 20 rules applied. Total rules applied 80 place count 140 transition count 225
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 89 place count 140 transition count 216
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 102 place count 127 transition count 195
Iterating global reduction 1 with 13 rules applied. Total rules applied 115 place count 127 transition count 195
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 125 place count 127 transition count 185
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 127 place count 125 transition count 182
Iterating global reduction 2 with 2 rules applied. Total rules applied 129 place count 125 transition count 182
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 131 place count 123 transition count 180
Iterating global reduction 2 with 2 rules applied. Total rules applied 133 place count 123 transition count 180
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 134 place count 122 transition count 179
Iterating global reduction 2 with 1 rules applied. Total rules applied 135 place count 122 transition count 179
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 136 place count 121 transition count 178
Iterating global reduction 2 with 1 rules applied. Total rules applied 137 place count 121 transition count 178
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 138 place count 120 transition count 177
Iterating global reduction 2 with 1 rules applied. Total rules applied 139 place count 120 transition count 177
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 140 place count 119 transition count 174
Iterating global reduction 2 with 1 rules applied. Total rules applied 141 place count 119 transition count 174
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 142 place count 118 transition count 173
Iterating global reduction 2 with 1 rules applied. Total rules applied 143 place count 118 transition count 173
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 144 place count 117 transition count 172
Iterating global reduction 2 with 1 rules applied. Total rules applied 145 place count 117 transition count 172
Applied a total of 145 rules in 56 ms. Remains 117 /180 variables (removed 63) and now considering 172/475 (removed 303) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 117/180 places, 172/475 transitions.
RANDOM walk for 40000 steps (9025 resets) in 137 ms. (289 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1933 resets) in 72 ms. (547 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1867 resets) in 66 ms. (597 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1937 resets) in 53 ms. (740 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 626596 steps, run timeout after 3001 ms. (steps per millisecond=208 ) properties seen :1 out of 3
Probabilistic random walk after 626596 steps, saw 280466 distinct states, run finished after 3001 ms. (steps per millisecond=208 ) properties seen :1
FORMULA SieveSingleMsgMbox-PT-d2m96-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 172 rows 117 cols
[2024-06-01 14:17:01] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 14:17:01] [INFO ] State equation strengthened by 89 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 51/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/69 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/76 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 142/218 variables, 76/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 59/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 71/289 variables, 41/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/289 variables, 30/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/289 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/289 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 210 constraints, problems are : Problem set: 0 solved, 2 unsolved in 223 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 117/117 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 51/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/69 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/76 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 142/218 variables, 76/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 59/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 71/289 variables, 41/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/289 variables, 30/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/289 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/289 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/289 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 212 constraints, problems are : Problem set: 0 solved, 2 unsolved in 421 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 117/117 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 658ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 7155 ms.
Support contains 4 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 172/172 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 116 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 116 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 115 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 115 transition count 158
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 115 transition count 157
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 114 transition count 155
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 114 transition count 155
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 114 transition count 154
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 113 transition count 153
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 113 transition count 153
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 112 transition count 152
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 112 transition count 152
Applied a total of 12 rules in 34 ms. Remains 112 /117 variables (removed 5) and now considering 152/172 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 112/117 places, 152/172 transitions.
RANDOM walk for 40000 steps (9003 resets) in 91 ms. (434 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1875 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1850 resets) in 44 ms. (888 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 610697 steps, run timeout after 3001 ms. (steps per millisecond=203 ) properties seen :0 out of 2
Probabilistic random walk after 610697 steps, saw 279644 distinct states, run finished after 3001 ms. (steps per millisecond=203 ) properties seen :0
// Phase 1: matrix 152 rows 112 cols
[2024-06-01 14:17:12] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 14:17:12] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 49/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/74 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 135/209 variables, 74/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 57/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/209 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 55/264 variables, 38/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/264 variables, 17/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/264 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/264 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 264/264 variables, and 190 constraints, problems are : Problem set: 0 solved, 2 unsolved in 187 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 112/112 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 49/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/74 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 135/209 variables, 74/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 57/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/209 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 55/264 variables, 38/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/264 variables, 17/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/264 variables, 2/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 14:17:13] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/264 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/264 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/264 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 264/264 variables, and 193 constraints, problems are : Problem set: 0 solved, 2 unsolved in 847 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 112/112 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1060ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1025 ms.
Support contains 4 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 152/152 transitions.
Applied a total of 0 rules in 7 ms. Remains 112 /112 variables (removed 0) and now considering 152/152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 112/112 places, 152/152 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 152/152 transitions.
Applied a total of 0 rules in 4 ms. Remains 112 /112 variables (removed 0) and now considering 152/152 (removed 0) transitions.
[2024-06-01 14:17:14] [INFO ] Invariant cache hit.
[2024-06-01 14:17:15] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-06-01 14:17:15] [INFO ] Invariant cache hit.
[2024-06-01 14:17:15] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-06-01 14:17:15] [INFO ] Implicit Places using invariants and state equation in 352 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
[2024-06-01 14:17:15] [INFO ] Redundant transitions in 5 ms returned []
Running 151 sub problems to find dead transitions.
[2024-06-01 14:17:15] [INFO ] Invariant cache hit.
[2024-06-01 14:17:15] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (OVERLAPS) 1/112 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 5 (OVERLAPS) 152/264 variables, 112/116 constraints. Problems are: Problem set: 0 solved, 151 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/264 variables, 74/190 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/264 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 8 (OVERLAPS) 0/264 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Real declared 264/264 variables, and 190 constraints, problems are : Problem set: 0 solved, 151 unsolved in 8073 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 112/112 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 151 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (OVERLAPS) 1/112 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 5 (OVERLAPS) 152/264 variables, 112/116 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/264 variables, 74/190 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/264 variables, 151/341 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-06-01 14:17:27] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD138 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 1/342 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/264 variables, 0/342 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 10 (OVERLAPS) 0/264 variables, 0/342 constraints. Problems are: Problem set: 3 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Int declared 264/264 variables, and 342 constraints, problems are : Problem set: 3 solved, 148 unsolved in 16007 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 112/112 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 1/1 constraints]
After SMT, in 24411ms problems are : Problem set: 3 solved, 148 unsolved
Search for dead transitions found 3 dead transitions in 24415ms
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 : 112/112 places, 149/152 transitions.
Graph (complete) has 334 edges and 112 vertex of which 109 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 7 ms. Remains 109 /112 variables (removed 3) and now considering 149/149 (removed 0) transitions.
// Phase 1: matrix 149 rows 109 cols
[2024-06-01 14:17:39] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 14:17:40] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-06-01 14:17:40] [INFO ] Invariant cache hit.
[2024-06-01 14:17:40] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-06-01 14:17:40] [INFO ] Implicit Places using invariants and state equation in 634 ms returned []
Implicit Place search using SMT with State Equation took 762 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 109/112 places, 149/152 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 25715 ms. Remains : 109/112 places, 149/152 transitions.
RANDOM walk for 40000 steps (9018 resets) in 155 ms. (256 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1824 resets) in 85 ms. (465 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1864 resets) in 86 ms. (459 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 594531 steps, run timeout after 3001 ms. (steps per millisecond=198 ) properties seen :0 out of 2
Probabilistic random walk after 594531 steps, saw 272591 distinct states, run finished after 3001 ms. (steps per millisecond=198 ) properties seen :0
[2024-06-01 14:17:43] [INFO ] Invariant cache hit.
[2024-06-01 14:17:43] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 49/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/61 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 129/190 variables, 61/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 53/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 68/258 variables, 48/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 20/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/258 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 185 constraints, problems are : Problem set: 0 solved, 2 unsolved in 173 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 109/109 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 49/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/61 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 129/190 variables, 61/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 53/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 68/258 variables, 48/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 20/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 2/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 14:17:44] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/258 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/258 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 188 constraints, problems are : Problem set: 0 solved, 2 unsolved in 792 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 109/109 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 973ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 10192 ms.
Support contains 4 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 149/149 transitions.
Applied a total of 0 rules in 4 ms. Remains 109 /109 variables (removed 0) and now considering 149/149 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 109/109 places, 149/149 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 149/149 transitions.
Applied a total of 0 rules in 4 ms. Remains 109 /109 variables (removed 0) and now considering 149/149 (removed 0) transitions.
[2024-06-01 14:17:55] [INFO ] Invariant cache hit.
[2024-06-01 14:17:55] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-01 14:17:55] [INFO ] Invariant cache hit.
[2024-06-01 14:17:55] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-06-01 14:17:55] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
[2024-06-01 14:17:55] [INFO ] Redundant transitions in 5 ms returned []
Running 148 sub problems to find dead transitions.
[2024-06-01 14:17:55] [INFO ] Invariant cache hit.
[2024-06-01 14:17:55] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (OVERLAPS) 1/109 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 148 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD133 is UNSAT
At refinement iteration 4 (OVERLAPS) 149/258 variables, 109/112 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 73/185 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 0/185 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 7 (OVERLAPS) 0/258 variables, 0/185 constraints. Problems are: Problem set: 3 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 185 constraints, problems are : Problem set: 3 solved, 145 unsolved in 6087 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 109/109 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 2/3 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 4 (OVERLAPS) 148/254 variables, 106/109 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 72/181 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 15/196 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 0/196 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 8 (OVERLAPS) 4/258 variables, 3/199 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 1/200 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 130/330 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 0/330 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 12 (OVERLAPS) 0/258 variables, 0/330 constraints. Problems are: Problem set: 3 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 330 constraints, problems are : Problem set: 3 solved, 145 unsolved in 18121 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 109/109 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 145/148 constraints, Known Traps: 0/0 constraints]
After SMT, in 24405ms problems are : Problem set: 3 solved, 145 unsolved
Search for dead transitions found 3 dead transitions in 24408ms
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 : 109/109 places, 146/149 transitions.
Graph (complete) has 325 edges and 109 vertex of which 106 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 106 /109 variables (removed 3) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 106 cols
[2024-06-01 14:18:19] [INFO ] Computed 3 invariants in 2 ms
[2024-06-01 14:18:20] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-06-01 14:18:20] [INFO ] Invariant cache hit.
[2024-06-01 14:18:20] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 14:18:20] [INFO ] Implicit Places using invariants and state equation in 551 ms returned []
Implicit Place search using SMT with State Equation took 671 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 106/109 places, 146/149 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 25598 ms. Remains : 106/109 places, 146/149 transitions.
RANDOM walk for 40000 steps (9027 resets) in 144 ms. (275 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1859 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1903 resets) in 49 ms. (800 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 756894 steps, run timeout after 3001 ms. (steps per millisecond=252 ) properties seen :0 out of 2
Probabilistic random walk after 756894 steps, saw 343711 distinct states, run finished after 3001 ms. (steps per millisecond=252 ) properties seen :0
[2024-06-01 14:18:23] [INFO ] Invariant cache hit.
[2024-06-01 14:18:23] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 49/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/61 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 127/188 variables, 61/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 53/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 64/252 variables, 45/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 19/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/252 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/252 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 181 constraints, problems are : Problem set: 0 solved, 2 unsolved in 180 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 106/106 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 49/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/61 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 127/188 variables, 61/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 53/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 64/252 variables, 45/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 19/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/252 variables, 2/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/252 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/252 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 183 constraints, problems are : Problem set: 0 solved, 2 unsolved in 491 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 106/106 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 680ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1362 ms.
Support contains 4 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 146/146 transitions.
Applied a total of 0 rules in 4 ms. Remains 106 /106 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 106/106 places, 146/146 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 146/146 transitions.
Applied a total of 0 rules in 4 ms. Remains 106 /106 variables (removed 0) and now considering 146/146 (removed 0) transitions.
[2024-06-01 14:18:25] [INFO ] Invariant cache hit.
[2024-06-01 14:18:25] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-01 14:18:25] [INFO ] Invariant cache hit.
[2024-06-01 14:18:25] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 14:18:26] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 470 ms to find 0 implicit places.
[2024-06-01 14:18:26] [INFO ] Redundant transitions in 7 ms returned []
Running 145 sub problems to find dead transitions.
[2024-06-01 14:18:26] [INFO ] Invariant cache hit.
[2024-06-01 14:18:26] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (OVERLAPS) 146/252 variables, 106/109 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 72/181 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (OVERLAPS) 0/252 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 181 constraints, problems are : Problem set: 0 solved, 145 unsolved in 7762 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 106/106 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (OVERLAPS) 146/252 variables, 106/109 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 72/181 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 145/326 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (OVERLAPS) 0/252 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 326 constraints, problems are : Problem set: 0 solved, 145 unsolved in 12651 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 106/106 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 0/0 constraints]
After SMT, in 20676ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 20679ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21169 ms. Remains : 106/106 places, 146/146 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 106 transition count 140
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 101 transition count 140
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 11 place count 101 transition count 125
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 41 place count 86 transition count 125
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 57 place count 78 transition count 117
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
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 59 place count 77 transition count 127
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 77 transition count 126
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 61 place count 76 transition count 126
Applied a total of 61 rules in 21 ms. Remains 76 /106 variables (removed 30) and now considering 126/146 (removed 20) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 126 rows 76 cols
[2024-06-01 14:18:46] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 14:18:46] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 14:18:47] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 14:18:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 14:18:47] [INFO ] After 131ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 14:18:47] [INFO ] After 209ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 14:18:47] [INFO ] After 304ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 493 ms.
[2024-06-01 14:18:47] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2024-06-01 14:18:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 106 places, 146 transitions and 578 arcs took 9 ms.
[2024-06-01 14:18:47] [INFO ] Flatten gal took : 107 ms
Total runtime 169904 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-d2m96-ReachabilityFireability-2024-04
Could not compute solution for formula : SieveSingleMsgMbox-PT-d2m96-ReachabilityFireability-2024-11

BK_STOP 1717251528408

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name SieveSingleMsgMbox-PT-d2m96-ReachabilityFireability-2024-04
rfs formula type EF
rfs formula formula --invariant=/tmp/705/inv_0_
rfs formula name SieveSingleMsgMbox-PT-d2m96-ReachabilityFireability-2024-11
rfs formula type EF
rfs formula formula --invariant=/tmp/705/inv_1_
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-d2m96"
export BK_EXAMINATION="ReachabilityFireability"
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-d2m96, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r532-smll-171683810800143"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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