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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 12 19:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 12 19:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 12 19:30 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-d2m18-LTLCardinality-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLCardinality-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLCardinality-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLCardinality-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLCardinality-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLCardinality-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLCardinality-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLCardinality-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLCardinality-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLCardinality-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLCardinality-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLCardinality-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLCardinality-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLCardinality-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLCardinality-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717247888904

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-d2m18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:18:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 13:18:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:18:12] [INFO ] Load time of PNML (sax parser for PT used): 615 ms
[2024-06-01 13:18:12] [INFO ] Transformed 2398 places.
[2024-06-01 13:18:12] [INFO ] Transformed 1954 transitions.
[2024-06-01 13:18:12] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 893 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 41 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 1984 places in 37 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLCardinality-05 TRUE 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 117 places :
Symmetric choice reduction at 1 with 117 rule applications. Total rules 970 place count 272 transition count 377
Iterating global reduction 1 with 117 rules applied. Total rules applied 1087 place count 272 transition count 377
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 1098 place count 272 transition count 366
Discarding 90 places :
Symmetric choice reduction at 2 with 90 rule applications. Total rules 1188 place count 182 transition count 276
Iterating global reduction 2 with 90 rules applied. Total rules applied 1278 place count 182 transition count 276
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 1313 place count 182 transition count 241
Discarding 37 places :
Symmetric choice reduction at 3 with 37 rule applications. Total rules 1350 place count 145 transition count 190
Iterating global reduction 3 with 37 rules applied. Total rules applied 1387 place count 145 transition count 190
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 1409 place count 145 transition count 168
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1418 place count 136 transition count 155
Iterating global reduction 4 with 9 rules applied. Total rules applied 1427 place count 136 transition count 155
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1436 place count 127 transition count 146
Iterating global reduction 4 with 9 rules applied. Total rules applied 1445 place count 127 transition count 146
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1450 place count 122 transition count 140
Iterating global reduction 4 with 5 rules applied. Total rules applied 1455 place count 122 transition count 140
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1457 place count 122 transition count 138
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1462 place count 117 transition count 133
Iterating global reduction 5 with 5 rules applied. Total rules applied 1467 place count 117 transition count 133
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1470 place count 114 transition count 130
Iterating global reduction 5 with 3 rules applied. Total rules applied 1473 place count 114 transition count 130
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1474 place count 113 transition count 129
Iterating global reduction 5 with 1 rules applied. Total rules applied 1475 place count 113 transition count 129
Applied a total of 1475 rules in 242 ms. Remains 113 /414 variables (removed 301) and now considering 129/1954 (removed 1825) transitions.
// Phase 1: matrix 129 rows 113 cols
[2024-06-01 13:18:13] [INFO ] Computed 5 invariants in 18 ms
[2024-06-01 13:18:13] [INFO ] Implicit Places using invariants in 547 ms returned []
[2024-06-01 13:18:13] [INFO ] Invariant cache hit.
[2024-06-01 13:18:13] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-06-01 13:18:14] [INFO ] Implicit Places using invariants and state equation in 582 ms returned []
Implicit Place search using SMT with State Equation took 1193 ms to find 0 implicit places.
Running 128 sub problems to find dead transitions.
[2024-06-01 13:18:14] [INFO ] Invariant cache hit.
[2024-06-01 13:18:14] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (OVERLAPS) 1/113 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-06-01 13:18:17] [INFO ] Deduced a trap composed of 33 places in 157 ms of which 39 ms to minimize.
[2024-06-01 13:18:17] [INFO ] Deduced a trap composed of 33 places in 103 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 129/242 variables, 113/120 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 50/170 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (OVERLAPS) 0/242 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 170 constraints, problems are : Problem set: 0 solved, 128 unsolved in 9913 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 113/113 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (OVERLAPS) 1/113 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 129/242 variables, 113/120 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 50/170 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 128/298 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-06-01 13:18:28] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 3 ms to minimize.
[2024-06-01 13:18:29] [INFO ] Deduced a trap composed of 50 places in 68 ms of which 2 ms to minimize.
[2024-06-01 13:18:29] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 2 ms to minimize.
Problem TDEAD47 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD117 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 3/301 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 0/301 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 11 (OVERLAPS) 0/242 variables, 0/301 constraints. Problems are: Problem set: 3 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 301 constraints, problems are : Problem set: 3 solved, 125 unsolved in 15435 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 113/113 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 5/5 constraints]
After SMT, in 26061ms problems are : Problem set: 3 solved, 125 unsolved
Search for dead transitions found 3 dead transitions in 26086ms
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 : 113/414 places, 126/1954 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 110 transition count 126
Applied a total of 3 rules in 3 ms. Remains 110 /113 variables (removed 3) and now considering 126/126 (removed 0) transitions.
// Phase 1: matrix 126 rows 110 cols
[2024-06-01 13:18:40] [INFO ] Computed 4 invariants in 3 ms
[2024-06-01 13:18:40] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-06-01 13:18:40] [INFO ] Invariant cache hit.
[2024-06-01 13:18:40] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-06-01 13:18:40] [INFO ] Implicit Places using invariants and state equation in 492 ms returned []
Implicit Place search using SMT with State Equation took 613 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 110/414 places, 126/1954 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 28184 ms. Remains : 110/414 places, 126/1954 transitions.
Support contains 4 out of 110 places after structural reductions.
[2024-06-01 13:18:41] [INFO ] Flatten gal took : 73 ms
[2024-06-01 13:18:41] [INFO ] Flatten gal took : 33 ms
[2024-06-01 13:18:41] [INFO ] Input system was already deterministic with 126 transitions.
RANDOM walk for 40000 steps (8945 resets) in 2305 ms. (17 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (4113 resets) in 967 ms. (41 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (4177 resets) in 400 ms. (99 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (4221 resets) in 122 ms. (325 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 470915 steps, run timeout after 3001 ms. (steps per millisecond=156 ) properties seen :1 out of 3
Probabilistic random walk after 470915 steps, saw 222049 distinct states, run finished after 3017 ms. (steps per millisecond=156 ) properties seen :1
[2024-06-01 13:18:45] [INFO ] Invariant cache hit.
[2024-06-01 13:18:45] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp0 is UNSAT
At refinement iteration 1 (OVERLAPS) 59/61 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/84 variables, 2/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 110/194 variables, 84/88 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 33/121 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 0/121 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 42/236 variables, 26/147 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 16/163 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/163 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/236 variables, 0/163 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/236 variables, and 163 constraints, problems are : Problem set: 1 solved, 1 unsolved in 171 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 110/110 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 82/85 variables, 4/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 3/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 66/151 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 25/35 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 0/35 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 11/162 variables, 2/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/162 variables, 1/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/162 variables, 0/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/166 variables, 1/39 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/166 variables, 4/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/166 variables, 0/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 70/236 variables, 75/118 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/236 variables, 46/164 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 13:18:45] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/236 variables, 1/165 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/236 variables, 0/165 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/236 variables, 0/165 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 236/236 variables, and 165 constraints, problems are : Problem set: 1 solved, 1 unsolved in 240 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 110/110 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 423ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 833 steps, including 75 resets, run visited all 1 properties in 6 ms. (steps per millisecond=138 )
Parikh walk visited 1 properties in 15 ms.
Successfully simplified 1 atomic propositions for a total of 3 simplifications.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 25 stabilizing places and 31 stable transitions
Graph (complete) has 351 edges and 110 vertex of which 109 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 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' '!(G(F(p0)))'
Support contains 1 out of 110 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 110/110 places, 126/126 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 108 transition count 124
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 108 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 108 transition count 123
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 7 place count 106 transition count 120
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 106 transition count 120
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 104 transition count 118
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 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 14 place count 104 transition count 117
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 103 transition count 116
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 103 transition count 116
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 102 transition count 115
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 102 transition count 115
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 101 transition count 114
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 101 transition count 114
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 100 transition count 111
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 100 transition count 111
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 99 transition count 110
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 99 transition count 110
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 98 transition count 109
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 98 transition count 109
Applied a total of 26 rules in 66 ms. Remains 98 /110 variables (removed 12) and now considering 109/126 (removed 17) transitions.
// Phase 1: matrix 109 rows 98 cols
[2024-06-01 13:18:46] [INFO ] Computed 4 invariants in 6 ms
[2024-06-01 13:18:46] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-06-01 13:18:46] [INFO ] Invariant cache hit.
[2024-06-01 13:18:46] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 13:18:46] [INFO ] Implicit Places using invariants and state equation in 416 ms returned []
Implicit Place search using SMT with State Equation took 570 ms to find 0 implicit places.
[2024-06-01 13:18:46] [INFO ] Redundant transitions in 4 ms returned []
Running 108 sub problems to find dead transitions.
[2024-06-01 13:18:46] [INFO ] Invariant cache hit.
[2024-06-01 13:18:46] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (OVERLAPS) 1/98 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 108 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD96 is UNSAT
At refinement iteration 5 (OVERLAPS) 109/207 variables, 98/102 constraints. Problems are: Problem set: 3 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 42/144 constraints. Problems are: Problem set: 3 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 0/144 constraints. Problems are: Problem set: 3 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 0/207 variables, 0/144 constraints. Problems are: Problem set: 3 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 144 constraints, problems are : Problem set: 3 solved, 105 unsolved in 4461 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 98/98 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 1/95 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 2/97 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 109/206 variables, 97/101 constraints. Problems are: Problem set: 3 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 42/143 constraints. Problems are: Problem set: 3 solved, 105 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 17/160 constraints. Problems are: Problem set: 3 solved, 105 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 0/160 constraints. Problems are: Problem set: 3 solved, 105 unsolved
At refinement iteration 11 (OVERLAPS) 1/207 variables, 1/161 constraints. Problems are: Problem set: 3 solved, 105 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/207 variables, 88/249 constraints. Problems are: Problem set: 3 solved, 105 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/207 variables, 0/249 constraints. Problems are: Problem set: 3 solved, 105 unsolved
At refinement iteration 14 (OVERLAPS) 0/207 variables, 0/249 constraints. Problems are: Problem set: 3 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 249 constraints, problems are : Problem set: 3 solved, 105 unsolved in 8479 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 98/98 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 105/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 13222ms problems are : Problem set: 3 solved, 105 unsolved
Search for dead transitions found 3 dead transitions in 13227ms
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 : 98/110 places, 106/126 transitions.
Graph (complete) has 302 edges and 98 vertex of which 95 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 95 /98 variables (removed 3) and now considering 106/106 (removed 0) transitions.
// Phase 1: matrix 106 rows 95 cols
[2024-06-01 13:19:00] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 13:19:00] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-06-01 13:19:00] [INFO ] Invariant cache hit.
[2024-06-01 13:19:00] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 13:19:00] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 572 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 95/110 places, 106/126 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 14464 ms. Remains : 95/110 places, 106/126 transitions.
Stuttering acceptance computed with spot in 355 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLCardinality-07
Product exploration explored 100000 steps with 22585 reset in 500 ms.
Product exploration explored 100000 steps with 22426 reset in 404 ms.
Computed a total of 17 stabilizing places and 21 stable transitions
Graph (complete) has 300 edges and 95 vertex of which 94 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 17 stabilizing places and 21 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 157 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8993 resets) in 257 ms. (155 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (4193 resets) in 155 ms. (256 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2501839 steps, run timeout after 3001 ms. (steps per millisecond=833 ) properties seen :0 out of 1
Probabilistic random walk after 2501839 steps, saw 1164834 distinct states, run finished after 3001 ms. (steps per millisecond=833 ) properties seen :0
[2024-06-01 13:19:05] [INFO ] Invariant cache hit.
[2024-06-01 13:19:05] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 70/73 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 53/126 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 21/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 11/137 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/137 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/141 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/141 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/141 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 60/201 variables, 64/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/201 variables, 38/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/201 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (OVERLAPS) 0/201 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 140 constraints, problems are : Problem set: 0 solved, 1 unsolved in 129 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 95/95 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 70/73 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 53/126 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 21/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 11/137 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/137 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/137 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/141 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/141 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/141 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 60/201 variables, 64/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/201 variables, 38/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/201 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/201 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 141 constraints, problems are : Problem set: 0 solved, 1 unsolved in 121 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 95/95 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 259ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 35 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=35 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 95 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 95/95 places, 106/106 transitions.
Applied a total of 0 rules in 12 ms. Remains 95 /95 variables (removed 0) and now considering 106/106 (removed 0) transitions.
[2024-06-01 13:19:05] [INFO ] Invariant cache hit.
[2024-06-01 13:19:06] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-06-01 13:19:06] [INFO ] Invariant cache hit.
[2024-06-01 13:19:06] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 13:19:06] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
[2024-06-01 13:19:06] [INFO ] Redundant transitions in 4 ms returned []
Running 105 sub problems to find dead transitions.
[2024-06-01 13:19:06] [INFO ] Invariant cache hit.
[2024-06-01 13:19:06] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 1/95 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 106/201 variables, 95/99 constraints. Problems are: Problem set: 0 solved, 105 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 41/140 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 0/201 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 140 constraints, problems are : Problem set: 0 solved, 105 unsolved in 3956 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 95/95 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 1/95 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 106/201 variables, 95/99 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 41/140 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 105/245 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (OVERLAPS) 0/201 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 245 constraints, problems are : Problem set: 0 solved, 105 unsolved in 7588 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 95/95 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints]
After SMT, in 11758ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 11763ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12215 ms. Remains : 95/95 places, 106/106 transitions.
Computed a total of 17 stabilizing places and 21 stable transitions
Graph (complete) has 300 edges and 95 vertex of which 94 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 17 stabilizing places and 21 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8927 resets) in 94 ms. (421 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (4199 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2006465 steps, run timeout after 3001 ms. (steps per millisecond=668 ) properties seen :0 out of 1
Probabilistic random walk after 2006465 steps, saw 936064 distinct states, run finished after 3001 ms. (steps per millisecond=668 ) properties seen :0
[2024-06-01 13:19:21] [INFO ] Invariant cache hit.
[2024-06-01 13:19:21] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 70/73 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 53/126 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 21/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 11/137 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/137 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/141 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/141 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/141 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 60/201 variables, 64/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/201 variables, 38/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/201 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (OVERLAPS) 0/201 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 140 constraints, problems are : Problem set: 0 solved, 1 unsolved in 175 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 95/95 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 70/73 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 53/126 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 21/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 11/137 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/137 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/137 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/141 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/141 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/141 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 60/201 variables, 64/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/201 variables, 38/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/201 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/201 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 141 constraints, problems are : Problem set: 0 solved, 1 unsolved in 189 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 95/95 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 372ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 429 steps, including 36 resets, run visited all 1 properties in 3 ms. (steps per millisecond=143 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22459 reset in 191 ms.
Product exploration explored 100000 steps with 22360 reset in 206 ms.
Support contains 1 out of 95 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 95/95 places, 106/106 transitions.
Applied a total of 0 rules in 12 ms. Remains 95 /95 variables (removed 0) and now considering 106/106 (removed 0) transitions.
[2024-06-01 13:19:22] [INFO ] Invariant cache hit.
[2024-06-01 13:19:22] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-06-01 13:19:22] [INFO ] Invariant cache hit.
[2024-06-01 13:19:22] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 13:19:23] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 523 ms to find 0 implicit places.
[2024-06-01 13:19:23] [INFO ] Redundant transitions in 3 ms returned []
Running 105 sub problems to find dead transitions.
[2024-06-01 13:19:23] [INFO ] Invariant cache hit.
[2024-06-01 13:19:23] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 1/95 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 106/201 variables, 95/99 constraints. Problems are: Problem set: 0 solved, 105 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 41/140 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 0/201 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 140 constraints, problems are : Problem set: 0 solved, 105 unsolved in 4368 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 95/95 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 1/95 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 106/201 variables, 95/99 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 41/140 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 105/245 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (OVERLAPS) 0/201 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 245 constraints, problems are : Problem set: 0 solved, 105 unsolved in 7464 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 95/95 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints]
After SMT, in 11939ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 11944ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12488 ms. Remains : 95/95 places, 106/106 transitions.
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLCardinality-07 finished in 49051 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 2 out of 110 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 110/110 places, 126/126 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 109 transition count 125
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 109 transition count 125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 108 transition count 124
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 108 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 107 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 107 transition count 122
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 107 transition count 121
Applied a total of 7 rules in 18 ms. Remains 107 /110 variables (removed 3) and now considering 121/126 (removed 5) transitions.
// Phase 1: matrix 121 rows 107 cols
[2024-06-01 13:19:35] [INFO ] Computed 4 invariants in 6 ms
[2024-06-01 13:19:35] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-06-01 13:19:35] [INFO ] Invariant cache hit.
[2024-06-01 13:19:35] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-06-01 13:19:35] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 463 ms to find 0 implicit places.
[2024-06-01 13:19:35] [INFO ] Redundant transitions in 5 ms returned []
Running 120 sub problems to find dead transitions.
[2024-06-01 13:19:35] [INFO ] Invariant cache hit.
[2024-06-01 13:19:35] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (OVERLAPS) 1/107 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Problem TDEAD44 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD108 is UNSAT
At refinement iteration 5 (OVERLAPS) 121/228 variables, 107/111 constraints. Problems are: Problem set: 3 solved, 117 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 47/158 constraints. Problems are: Problem set: 3 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 0/158 constraints. Problems are: Problem set: 3 solved, 117 unsolved
At refinement iteration 8 (OVERLAPS) 0/228 variables, 0/158 constraints. Problems are: Problem set: 3 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 158 constraints, problems are : Problem set: 3 solved, 117 unsolved in 5625 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 107/107 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 117 unsolved
At refinement iteration 3 (OVERLAPS) 1/104 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 117 unsolved
At refinement iteration 5 (OVERLAPS) 2/106 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 121/227 variables, 106/110 constraints. Problems are: Problem set: 3 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 47/157 constraints. Problems are: Problem set: 3 solved, 117 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 17/174 constraints. Problems are: Problem set: 3 solved, 117 unsolved
[2024-06-01 13:19:43] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 1/175 constraints. Problems are: Problem set: 3 solved, 117 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/227 variables, 0/175 constraints. Problems are: Problem set: 3 solved, 117 unsolved
At refinement iteration 12 (OVERLAPS) 1/228 variables, 1/176 constraints. Problems are: Problem set: 3 solved, 117 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/228 variables, 100/276 constraints. Problems are: Problem set: 3 solved, 117 unsolved
[2024-06-01 13:19:48] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/228 variables, 1/277 constraints. Problems are: Problem set: 3 solved, 117 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/228 variables, 0/277 constraints. Problems are: Problem set: 3 solved, 117 unsolved
At refinement iteration 16 (OVERLAPS) 0/228 variables, 0/277 constraints. Problems are: Problem set: 3 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 277 constraints, problems are : Problem set: 3 solved, 117 unsolved in 16752 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 107/107 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 117/120 constraints, Known Traps: 2/2 constraints]
After SMT, in 22607ms problems are : Problem set: 3 solved, 117 unsolved
Search for dead transitions found 3 dead transitions in 22610ms
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 : 107/110 places, 118/126 transitions.
Graph (complete) has 332 edges and 107 vertex of which 104 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 104 /107 variables (removed 3) and now considering 118/118 (removed 0) transitions.
// Phase 1: matrix 118 rows 104 cols
[2024-06-01 13:19:58] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 13:19:58] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-06-01 13:19:58] [INFO ] Invariant cache hit.
[2024-06-01 13:19:58] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-06-01 13:19:58] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 104/110 places, 118/126 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 23555 ms. Remains : 104/110 places, 118/126 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m18-LTLCardinality-10
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m18-LTLCardinality-10 finished in 23623 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' '!(G(F(p0)))'
[2024-06-01 13:19:59] [INFO ] Flatten gal took : 14 ms
[2024-06-01 13:19:59] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 13:19:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 110 places, 126 transitions and 500 arcs took 7 ms.
Total runtime 107711 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA SieveSingleMsgMbox-PT-d2m18-LTLCardinality-07 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717247999331

--------------------
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
mcc2024
ltl formula name SieveSingleMsgMbox-PT-d2m18-LTLCardinality-07
ltl formula formula --ltl=/tmp/775/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 110 places, 126 transitions and 500 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/775/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/775/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/775/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/775/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 112 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 111, there are 129 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~40!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 118
pnml2lts-mc( 0/ 4): unique states count: 180
pnml2lts-mc( 0/ 4): unique transitions count: 451
pnml2lts-mc( 0/ 4): - self-loop count: 124
pnml2lts-mc( 0/ 4): - claim dead count: 10
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 209
pnml2lts-mc( 0/ 4): - cum. max stack depth: 82
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 209 states 544 transitions, fanout: 2.603
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.000 sec minimum, 0.005 sec on average)
pnml2lts-mc( 0/ 4): States per second: 20900, Transitions per second: 54400
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 19.2 B/state, compr.: 4.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 126 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

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-d2m18"
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-d2m18, 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-171683810800115"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d2m18.tgz
mv SieveSingleMsgMbox-PT-d2m18 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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;