About the Execution of LTSMin+red for SieveSingleMsgMbox-PT-d2m96
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 478.151 | 103210.00 | 150914.00 | 598.60 | FFFTFTTTFFFTFFFF | normal |
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-171683810800139.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r532-smll-171683810800139
=====================================================================
--------------------
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-LTLCardinality-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717250857295
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
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:07:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 14:07:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:07:40] [INFO ] Load time of PNML (sax parser for PT used): 666 ms
[2024-06-01 14:07:40] [INFO ] Transformed 2398 places.
[2024-06-01 14:07:40] [INFO ] Transformed 1954 transitions.
[2024-06-01 14:07:40] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 935 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 33 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 9 formulas.
Deduced a syphon composed of 1984 places in 35 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 4 out of 414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 828 transitions.
Iterating post reduction 0 with 853 rules applied. Total rules applied 853 place count 389 transition count 1126
Discarding 116 places :
Symmetric choice reduction at 1 with 116 rule applications. Total rules 969 place count 273 transition count 382
Iterating global reduction 1 with 116 rules applied. Total rules applied 1085 place count 273 transition count 382
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 1093 place count 273 transition count 374
Discarding 92 places :
Symmetric choice reduction at 2 with 92 rule applications. Total rules 1185 place count 181 transition count 282
Iterating global reduction 2 with 92 rules applied. Total rules applied 1277 place count 181 transition count 282
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 2 with 40 rules applied. Total rules applied 1317 place count 181 transition count 242
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 1355 place count 143 transition count 189
Iterating global reduction 3 with 38 rules applied. Total rules applied 1393 place count 143 transition count 189
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 1416 place count 143 transition count 166
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 1426 place count 133 transition count 151
Iterating global reduction 4 with 10 rules applied. Total rules applied 1436 place count 133 transition count 151
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 1446 place count 123 transition count 141
Iterating global reduction 4 with 10 rules applied. Total rules applied 1456 place count 123 transition count 141
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1461 place count 118 transition count 135
Iterating global reduction 4 with 5 rules applied. Total rules applied 1466 place count 118 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 1468 place count 118 transition count 133
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1473 place count 113 transition count 128
Iterating global reduction 5 with 5 rules applied. Total rules applied 1478 place count 113 transition count 128
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1481 place count 110 transition count 125
Iterating global reduction 5 with 3 rules applied. Total rules applied 1484 place count 110 transition count 125
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1485 place count 109 transition count 124
Iterating global reduction 5 with 1 rules applied. Total rules applied 1486 place count 109 transition count 124
Applied a total of 1486 rules in 246 ms. Remains 109 /414 variables (removed 305) and now considering 124/1954 (removed 1830) transitions.
// Phase 1: matrix 124 rows 109 cols
[2024-06-01 14:07:41] [INFO ] Computed 5 invariants in 31 ms
[2024-06-01 14:07:42] [INFO ] Implicit Places using invariants in 540 ms returned []
[2024-06-01 14:07:42] [INFO ] Invariant cache hit.
[2024-06-01 14:07:42] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-06-01 14:07:42] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 937 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2024-06-01 14:07:42] [INFO ] Invariant cache hit.
[2024-06-01 14:07:42] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (OVERLAPS) 1/109 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-06-01 14:07:45] [INFO ] Deduced a trap composed of 31 places in 133 ms of which 38 ms to minimize.
[2024-06-01 14:07:45] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 124/233 variables, 109/116 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/233 variables, 50/166 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/233 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-06-01 14:07:48] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
Problem TDEAD54 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD50 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/233 variables, 1/167 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/233 variables, 0/167 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 11 (OVERLAPS) 0/233 variables, 0/167 constraints. Problems are: Problem set: 3 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 233/233 variables, and 167 constraints, problems are : Problem set: 3 solved, 120 unsolved in 10065 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 109/109 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 3 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 4/109 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 3/5 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 3/8 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 124/233 variables, 109/117 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/233 variables, 50/167 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/233 variables, 120/287 constraints. Problems are: Problem set: 3 solved, 120 unsolved
[2024-06-01 14:07:57] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 2 ms to minimize.
[2024-06-01 14:07:57] [INFO ] Deduced a trap composed of 53 places in 74 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/233 variables, 2/289 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/233 variables, 0/289 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 11 (OVERLAPS) 0/233 variables, 0/289 constraints. Problems are: Problem set: 3 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 233/233 variables, and 289 constraints, problems are : Problem set: 3 solved, 120 unsolved in 13692 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 109/109 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 120/123 constraints, Known Traps: 5/5 constraints]
After SMT, in 24427ms problems are : Problem set: 3 solved, 120 unsolved
Search for dead transitions found 3 dead transitions in 24455ms
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 LTL mode, iteration 1 : 109/414 places, 121/1954 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 106 transition count 121
Applied a total of 3 rules in 5 ms. Remains 106 /109 variables (removed 3) and now considering 121/121 (removed 0) transitions.
// Phase 1: matrix 121 rows 106 cols
[2024-06-01 14:08:06] [INFO ] Computed 4 invariants in 3 ms
[2024-06-01 14:08:07] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-06-01 14:08:07] [INFO ] Invariant cache hit.
[2024-06-01 14:08:07] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 14:08:07] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 458 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 106/414 places, 121/1954 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 26144 ms. Remains : 106/414 places, 121/1954 transitions.
Support contains 4 out of 106 places after structural reductions.
[2024-06-01 14:08:07] [INFO ] Flatten gal took : 57 ms
[2024-06-01 14:08:07] [INFO ] Flatten gal took : 27 ms
[2024-06-01 14:08:07] [INFO ] Input system was already deterministic with 121 transitions.
RANDOM walk for 40000 steps (8838 resets) in 2364 ms. (16 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (3911 resets) in 544 ms. (73 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (3872 resets) in 253 ms. (157 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (3884 resets) in 122 ms. (325 steps per ms) remains 3/3 properties
[2024-06-01 14:08:08] [INFO ] Invariant cache hit.
[2024-06-01 14:08:08] [INFO ] State equation strengthened by 49 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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 57/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 21/81 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 106/187 variables, 81/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 34/119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 40/227 variables, 25/144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 15/159 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/227 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 159 constraints, problems are : Problem set: 0 solved, 3 unsolved in 203 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 106/106 constraints, ReadFeed: 49/49 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 57/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 14:08:09] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 21/81 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 106/187 variables, 81/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 34/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 3/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/187 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 40/227 variables, 25/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/227 variables, 15/163 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 14:08:09] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/227 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/227 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/227 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 164 constraints, problems are : Problem set: 0 solved, 3 unsolved in 454 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 106/106 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 665ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 663 ms.
Support contains 3 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 121/121 transitions.
Graph (complete) has 301 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 105 transition count 119
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 104 transition count 118
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 104 transition count 118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 104 transition count 117
Applied a total of 6 rules in 26 ms. Remains 104 /106 variables (removed 2) and now considering 117/121 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 104/106 places, 117/121 transitions.
RANDOM walk for 40000 steps (8954 resets) in 188 ms. (211 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (4085 resets) in 157 ms. (253 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (4105 resets) in 91 ms. (434 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (4093 resets) in 143 ms. (277 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 520343 steps, run timeout after 3003 ms. (steps per millisecond=173 ) properties seen :1 out of 3
Probabilistic random walk after 520343 steps, saw 244508 distinct states, run finished after 3009 ms. (steps per millisecond=172 ) properties seen :1
// Phase 1: matrix 117 rows 104 cols
[2024-06-01 14:08:13] [INFO ] Computed 3 invariants in 2 ms
[2024-06-01 14:08:13] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 52/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/63 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 78/141 variables, 63/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 41/182 variables, 18/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 29/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 39/221 variables, 23/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/221 variables, 16/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/221 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/221 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 221/221 variables, and 152 constraints, problems are : Problem set: 0 solved, 2 unsolved in 159 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 45/45 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 52/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/63 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 14:08:13] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 2 ms to minimize.
[2024-06-01 14:08:13] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 78/141 variables, 63/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/141 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 41/182 variables, 18/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 29/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/182 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/182 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 39/221 variables, 23/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/221 variables, 16/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 14:08:13] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/221 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/221 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/221 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 221/221 variables, and 157 constraints, problems are : Problem set: 0 solved, 2 unsolved in 437 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 606ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 115 ms.
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 117/117 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 103 transition count 115
Applied a total of 3 rules in 12 ms. Remains 103 /104 variables (removed 1) and now considering 115/117 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 103/104 places, 115/117 transitions.
RANDOM walk for 40000 steps (8967 resets) in 217 ms. (183 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (4049 resets) in 130 ms. (305 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (4102 resets) in 131 ms. (303 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 526141 steps, run timeout after 3001 ms. (steps per millisecond=175 ) properties seen :0 out of 2
Probabilistic random walk after 526141 steps, saw 247623 distinct states, run finished after 3001 ms. (steps per millisecond=175 ) properties seen :0
// Phase 1: matrix 115 rows 103 cols
[2024-06-01 14:08:17] [INFO ] Computed 3 invariants in 2 ms
[2024-06-01 14:08:17] [INFO ] State equation strengthened by 43 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 51/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) 6/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/62 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 76/138 variables, 62/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 41/179 variables, 18/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 27/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/179 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 39/218 variables, 23/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/218 variables, 16/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/218 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/218 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 149 constraints, problems are : Problem set: 0 solved, 2 unsolved in 193 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 103/103 constraints, ReadFeed: 43/43 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 51/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) 6/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/62 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 14:08:17] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 2 ms to minimize.
[2024-06-01 14:08:17] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 76/138 variables, 62/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 41/179 variables, 18/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/179 variables, 27/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/179 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/179 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 39/218 variables, 23/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/218 variables, 16/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 14:08:17] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/218 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/218 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/218 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/218 variables, and 154 constraints, problems are : Problem set: 0 solved, 2 unsolved in 464 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 103/103 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 679ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 153 ms.
Support contains 2 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 115/115 transitions.
Applied a total of 0 rules in 23 ms. Remains 103 /103 variables (removed 0) and now considering 115/115 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 103/103 places, 115/115 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 115/115 transitions.
Applied a total of 0 rules in 12 ms. Remains 103 /103 variables (removed 0) and now considering 115/115 (removed 0) transitions.
[2024-06-01 14:08:18] [INFO ] Invariant cache hit.
[2024-06-01 14:08:18] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-06-01 14:08:18] [INFO ] Invariant cache hit.
[2024-06-01 14:08:18] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-01 14:08:18] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 530 ms to find 0 implicit places.
[2024-06-01 14:08:18] [INFO ] Redundant transitions in 5 ms returned []
Running 114 sub problems to find dead transitions.
[2024-06-01 14:08:18] [INFO ] Invariant cache hit.
[2024-06-01 14:08:18] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (OVERLAPS) 1/103 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 114 unsolved
Problem TDEAD44 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD103 is UNSAT
At refinement iteration 5 (OVERLAPS) 115/218 variables, 103/106 constraints. Problems are: Problem set: 3 solved, 111 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 43/149 constraints. Problems are: Problem set: 3 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 0/149 constraints. Problems are: Problem set: 3 solved, 111 unsolved
At refinement iteration 8 (OVERLAPS) 0/218 variables, 0/149 constraints. Problems are: Problem set: 3 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 149 constraints, problems are : Problem set: 3 solved, 111 unsolved in 5203 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 103/103 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 111 unsolved
At refinement iteration 3 (OVERLAPS) 1/100 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 111 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 111 unsolved
At refinement iteration 5 (OVERLAPS) 114/214 variables, 100/103 constraints. Problems are: Problem set: 3 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 42/145 constraints. Problems are: Problem set: 3 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 14/159 constraints. Problems are: Problem set: 3 solved, 111 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 0/159 constraints. Problems are: Problem set: 3 solved, 111 unsolved
At refinement iteration 9 (OVERLAPS) 4/218 variables, 3/162 constraints. Problems are: Problem set: 3 solved, 111 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/218 variables, 1/163 constraints. Problems are: Problem set: 3 solved, 111 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/218 variables, 97/260 constraints. Problems are: Problem set: 3 solved, 111 unsolved
[2024-06-01 14:08:29] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 1 ms to minimize.
[2024-06-01 14:08:29] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/218 variables, 2/262 constraints. Problems are: Problem set: 3 solved, 111 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/218 variables, 0/262 constraints. Problems are: Problem set: 3 solved, 111 unsolved
[2024-06-01 14:08:35] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 3 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/218 variables, 1/263 constraints. Problems are: Problem set: 3 solved, 111 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/218 variables, 0/263 constraints. Problems are: Problem set: 3 solved, 111 unsolved
At refinement iteration 16 (OVERLAPS) 0/218 variables, 0/263 constraints. Problems are: Problem set: 3 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/218 variables, and 263 constraints, problems are : Problem set: 3 solved, 111 unsolved in 19705 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 103/103 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 111/114 constraints, Known Traps: 3/3 constraints]
After SMT, in 25207ms problems are : Problem set: 3 solved, 111 unsolved
Search for dead transitions found 3 dead transitions in 25213ms
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 : 103/103 places, 112/115 transitions.
Graph (complete) has 286 edges and 103 vertex of which 100 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 8 ms. Remains 100 /103 variables (removed 3) and now considering 112/112 (removed 0) transitions.
// Phase 1: matrix 112 rows 100 cols
[2024-06-01 14:08:44] [INFO ] Computed 3 invariants in 5 ms
[2024-06-01 14:08:44] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-06-01 14:08:44] [INFO ] Invariant cache hit.
[2024-06-01 14:08:44] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 14:08:44] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 100/103 places, 112/115 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 26217 ms. Remains : 100/103 places, 112/115 transitions.
RANDOM walk for 40000 steps (8985 resets) in 142 ms. (279 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (4122 resets) in 92 ms. (430 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (4202 resets) in 70 ms. (563 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 816298 steps, run timeout after 3001 ms. (steps per millisecond=272 ) properties seen :0 out of 2
Probabilistic random walk after 816298 steps, saw 381584 distinct states, run finished after 3001 ms. (steps per millisecond=272 ) properties seen :0
[2024-06-01 14:08:47] [INFO ] Invariant cache hit.
[2024-06-01 14:08:47] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 56/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/62 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 76/138 variables, 62/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 38/176 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/176 variables, 27/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/176 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 36/212 variables, 21/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/212 variables, 15/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/212 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/212 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 145 constraints, problems are : Problem set: 0 solved, 2 unsolved in 142 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 100/100 constraints, ReadFeed: 42/42 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 56/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 14:08:47] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 4/62 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 76/138 variables, 62/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 38/176 variables, 17/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/176 variables, 27/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/176 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/176 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 36/212 variables, 21/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/212 variables, 15/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 14:08:47] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp2 is UNSAT
After SMT solving in domain Int declared 212/212 variables, and 149 constraints, problems are : Problem set: 2 solved, 0 unsolved in 219 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 100/100 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 376ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 4 simplifications.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 29 stabilizing places and 38 stable transitions
Graph (complete) has 338 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 121/121 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 103 transition count 117
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 103 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 103 transition count 116
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 102 transition count 115
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 102 transition count 115
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 101 transition count 114
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 101 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 101 transition count 113
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 100 transition count 112
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 100 transition count 112
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 99 transition count 111
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 99 transition count 111
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 98 transition count 108
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 98 transition count 108
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 97 transition count 107
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 97 transition count 107
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 96 transition count 106
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 96 transition count 106
Applied a total of 22 rules in 20 ms. Remains 96 /106 variables (removed 10) and now considering 106/121 (removed 15) transitions.
// Phase 1: matrix 106 rows 96 cols
[2024-06-01 14:08:48] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 14:08:48] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-06-01 14:08:48] [INFO ] Invariant cache hit.
[2024-06-01 14:08:48] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 14:08:48] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2024-06-01 14:08:48] [INFO ] Invariant cache hit.
[2024-06-01 14:08:48] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 1/96 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD94 is UNSAT
At refinement iteration 5 (OVERLAPS) 106/202 variables, 96/100 constraints. Problems are: Problem set: 3 solved, 102 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 42/142 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 0/142 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 0/202 variables, 0/142 constraints. Problems are: Problem set: 3 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 142 constraints, problems are : Problem set: 3 solved, 102 unsolved in 4858 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 1/93 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 2/95 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 106/201 variables, 95/99 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 42/141 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 16/157 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 0/157 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 11 (OVERLAPS) 1/202 variables, 1/158 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/202 variables, 86/244 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/202 variables, 0/244 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 14 (OVERLAPS) 0/202 variables, 0/244 constraints. Problems are: Problem set: 3 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 244 constraints, problems are : Problem set: 3 solved, 102 unsolved in 10012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 102/105 constraints, Known Traps: 0/0 constraints]
After SMT, in 15021ms problems are : Problem set: 3 solved, 102 unsolved
Search for dead transitions found 3 dead transitions in 15024ms
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 LTL mode, iteration 1 : 96/106 places, 103/121 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 93 transition count 103
Applied a total of 3 rules in 3 ms. Remains 93 /96 variables (removed 3) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 93 cols
[2024-06-01 14:09:03] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 14:09:03] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-06-01 14:09:03] [INFO ] Invariant cache hit.
[2024-06-01 14:09:03] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 14:09:04] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 521 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 93/106 places, 103/121 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 16048 ms. Remains : 93/106 places, 103/121 transitions.
Stuttering acceptance computed with spot in 490 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLCardinality-07
Product exploration explored 100000 steps with 50000 reset in 730 ms.
Product exploration explored 100000 steps with 50000 reset in 284 ms.
Computed a total of 18 stabilizing places and 23 stable transitions
Graph (complete) has 293 edges and 93 vertex of which 92 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 18 stabilizing places and 23 stable transitions
Detected a total of 18/93 stabilizing places and 23/103 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 24 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLCardinality-07 finished in 17704 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 121/121 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 103 transition count 117
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 103 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 103 transition count 116
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 102 transition count 115
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 102 transition count 115
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 101 transition count 114
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 101 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 101 transition count 113
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 100 transition count 112
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 100 transition count 112
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 99 transition count 111
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 99 transition count 111
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 98 transition count 108
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 98 transition count 108
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 97 transition count 107
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 97 transition count 107
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 96 transition count 106
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 96 transition count 106
Applied a total of 22 rules in 31 ms. Remains 96 /106 variables (removed 10) and now considering 106/121 (removed 15) transitions.
// Phase 1: matrix 106 rows 96 cols
[2024-06-01 14:09:05] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 14:09:05] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-06-01 14:09:05] [INFO ] Invariant cache hit.
[2024-06-01 14:09:05] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 14:09:06] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
[2024-06-01 14:09:06] [INFO ] Redundant transitions in 3 ms returned []
Running 105 sub problems to find dead transitions.
[2024-06-01 14:09:06] [INFO ] Invariant cache hit.
[2024-06-01 14:09:06] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 1/96 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD94 is UNSAT
At refinement iteration 5 (OVERLAPS) 106/202 variables, 96/100 constraints. Problems are: Problem set: 3 solved, 102 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 42/142 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 0/142 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 0/202 variables, 0/142 constraints. Problems are: Problem set: 3 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 142 constraints, problems are : Problem set: 3 solved, 102 unsolved in 3812 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 1/93 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 2/95 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 106/201 variables, 95/99 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 42/141 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 16/157 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 0/157 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 11 (OVERLAPS) 1/202 variables, 1/158 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/202 variables, 86/244 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/202 variables, 0/244 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 14 (OVERLAPS) 0/202 variables, 0/244 constraints. Problems are: Problem set: 3 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 244 constraints, problems are : Problem set: 3 solved, 102 unsolved in 9782 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 102/105 constraints, Known Traps: 0/0 constraints]
After SMT, in 13705ms problems are : Problem set: 3 solved, 102 unsolved
Search for dead transitions found 3 dead transitions in 13707ms
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 SI_LTL mode, iteration 1 : 96/106 places, 103/121 transitions.
Graph (complete) has 295 edges and 96 vertex of which 93 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 93 /96 variables (removed 3) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 93 cols
[2024-06-01 14:09:19] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 14:09:20] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-06-01 14:09:20] [INFO ] Invariant cache hit.
[2024-06-01 14:09:20] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 14:09:20] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 93/106 places, 103/121 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 14619 ms. Remains : 93/106 places, 103/121 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLCardinality-12
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLCardinality-12 finished in 14685 ms.
All properties solved by simple procedures.
Total runtime 100506 ms.
ITS solved all properties within timeout
BK_STOP 1717250960505
--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
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="LTLCardinality"
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 LTLCardinality"
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-171683810800139"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;