Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r425-tajo-167905978300491.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
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 r425-tajo-167905978300491
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 8.3K Feb 26 10:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 26 10:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 26 10:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 26 10:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Feb 26 10:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 10:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Feb 26 10:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K Feb 26 10:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.1M Mar 5 18:23 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 1679320885910

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
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
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 14:01:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 14:01:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 14:01:27] [INFO ] Load time of PNML (sax parser for PT used): 131 ms
[2023-03-20 14:01:27] [INFO ] Transformed 2398 places.
[2023-03-20 14:01:27] [INFO ] Transformed 1954 transitions.
[2023-03-20 14:01:27] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 203 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 1984 places in 16 ms
Reduce places removed 1984 places and 0 transitions.
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 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 3 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 118 places :
Symmetric choice reduction at 1 with 118 rule applications. Total rules 971 place count 271 transition count 380
Iterating global reduction 1 with 118 rules applied. Total rules applied 1089 place count 271 transition count 380
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 1099 place count 271 transition count 370
Discarding 91 places :
Symmetric choice reduction at 2 with 91 rule applications. Total rules 1190 place count 180 transition count 279
Iterating global reduction 2 with 91 rules applied. Total rules applied 1281 place count 180 transition count 279
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 1320 place count 180 transition count 240
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 1358 place count 142 transition count 187
Iterating global reduction 3 with 38 rules applied. Total rules applied 1396 place count 142 transition count 187
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 1419 place count 142 transition count 164
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1428 place count 133 transition count 151
Iterating global reduction 4 with 9 rules applied. Total rules applied 1437 place count 133 transition count 151
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1446 place count 124 transition count 142
Iterating global reduction 4 with 9 rules applied. Total rules applied 1455 place count 124 transition count 142
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1459 place count 120 transition count 137
Iterating global reduction 4 with 4 rules applied. Total rules applied 1463 place count 120 transition count 137
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1464 place count 120 transition count 136
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1468 place count 116 transition count 132
Iterating global reduction 5 with 4 rules applied. Total rules applied 1472 place count 116 transition count 132
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1475 place count 113 transition count 129
Iterating global reduction 5 with 3 rules applied. Total rules applied 1478 place count 113 transition count 129
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1479 place count 112 transition count 128
Iterating global reduction 5 with 1 rules applied. Total rules applied 1480 place count 112 transition count 128
Applied a total of 1480 rules in 81 ms. Remains 112 /414 variables (removed 302) and now considering 128/1954 (removed 1826) transitions.
// Phase 1: matrix 128 rows 112 cols
[2023-03-20 14:01:28] [INFO ] Computed 5 place invariants in 13 ms
[2023-03-20 14:01:28] [INFO ] Implicit Places using invariants in 225 ms returned []
[2023-03-20 14:01:28] [INFO ] Invariant cache hit.
[2023-03-20 14:01:28] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-20 14:01:28] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 474 ms to find 0 implicit places.
[2023-03-20 14:01:28] [INFO ] Invariant cache hit.
[2023-03-20 14:01:28] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 112/414 places, 128/1954 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 628 ms. Remains : 112/414 places, 128/1954 transitions.
Support contains 3 out of 112 places after structural reductions.
[2023-03-20 14:01:28] [INFO ] Flatten gal took : 29 ms
[2023-03-20 14:01:28] [INFO ] Flatten gal took : 12 ms
[2023-03-20 14:01:28] [INFO ] Input system was already deterministic with 128 transitions.
Incomplete random walk after 10000 steps, including 2219 resets, run finished after 247 ms. (steps per millisecond=40 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 1039 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 1060 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 1036 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 558233 steps, run timeout after 3001 ms. (steps per millisecond=186 ) properties seen :{}
Probabilistic random walk after 558233 steps, saw 264188 distinct states, run finished after 3002 ms. (steps per millisecond=185 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-20 14:01:32] [INFO ] Invariant cache hit.
[2023-03-20 14:01:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 14:01:32] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 14:01:32] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:1
[2023-03-20 14:01:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 8 ms returned sat
[2023-03-20 14:01:32] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 14:01:32] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2023-03-20 14:01:32] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-20 14:01:32] [INFO ] After 10ms SMT Verify possible using 51 Read/Feed constraints in natural domain returned unsat :2 sat :1
[2023-03-20 14:01:32] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 5 ms to minimize.
[2023-03-20 14:01:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2023-03-20 14:01:32] [INFO ] After 91ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-20 14:01:32] [INFO ] After 194ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 128/128 transitions.
Graph (complete) has 319 edges and 112 vertex of which 111 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 111 transition count 126
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 109 transition count 124
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 109 transition count 124
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 9 place count 109 transition count 122
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 11 place count 107 transition count 119
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 107 transition count 119
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 106 transition count 118
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 106 transition count 118
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 105 transition count 117
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 105 transition count 117
Applied a total of 17 rules in 31 ms. Remains 105 /112 variables (removed 7) and now considering 117/128 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 105/112 places, 117/128 transitions.
Incomplete random walk after 10000 steps, including 2228 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1016 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2553526 steps, run timeout after 3001 ms. (steps per millisecond=850 ) properties seen :{}
Probabilistic random walk after 2553526 steps, saw 1187348 distinct states, run finished after 3001 ms. (steps per millisecond=850 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 117 rows 105 cols
[2023-03-20 14:01:35] [INFO ] Computed 4 place invariants in 6 ms
[2023-03-20 14:01:35] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 14:01:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 14:01:35] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 14:01:35] [INFO ] After 59ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 14:01:35] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-20 14:01:35] [INFO ] After 20ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 14:01:35] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 2 ms to minimize.
[2023-03-20 14:01:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2023-03-20 14:01:35] [INFO ] After 101ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-20 14:01:35] [INFO ] After 222ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 117/117 transitions.
Applied a total of 0 rules in 8 ms. Remains 105 /105 variables (removed 0) and now considering 117/117 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 105/105 places, 117/117 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 117/117 transitions.
Applied a total of 0 rules in 8 ms. Remains 105 /105 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2023-03-20 14:01:35] [INFO ] Invariant cache hit.
[2023-03-20 14:01:36] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-20 14:01:36] [INFO ] Invariant cache hit.
[2023-03-20 14:01:36] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-20 14:01:36] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
[2023-03-20 14:01:36] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 14:01:36] [INFO ] Invariant cache hit.
[2023-03-20 14:01:36] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 678 ms. Remains : 105/105 places, 117/117 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 105 transition count 109
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 99 transition count 109
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 14 place count 99 transition count 91
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 50 place count 81 transition count 91
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 60 place count 76 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 75 transition count 94
Applied a total of 62 rules in 20 ms. Remains 75 /105 variables (removed 30) and now considering 94/117 (removed 23) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 75 cols
[2023-03-20 14:01:36] [INFO ] Computed 6 place invariants in 4 ms
[2023-03-20 14:01:36] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 14:01:36] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-20 14:01:36] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 14:01:36] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 14:01:36] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 2 ms to minimize.
[2023-03-20 14:01:36] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2023-03-20 14:01:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 95 ms
[2023-03-20 14:01:36] [INFO ] After 168ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-20 14:01:36] [INFO ] After 221ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Successfully simplified 2 atomic propositions for a total of 3 simplifications.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 31 stabilizing places and 39 stable transitions
Graph (complete) has 357 edges and 112 vertex of which 111 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Support contains 1 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 128/128 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 110 transition count 126
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 110 transition count 126
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 110 transition count 124
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 108 transition count 121
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 108 transition count 121
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 107 transition count 120
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 107 transition count 120
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 106 transition count 119
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 106 transition count 119
Applied a total of 14 rules in 6 ms. Remains 106 /112 variables (removed 6) and now considering 119/128 (removed 9) transitions.
// Phase 1: matrix 119 rows 106 cols
[2023-03-20 14:01:36] [INFO ] Computed 5 place invariants in 9 ms
[2023-03-20 14:01:37] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-20 14:01:37] [INFO ] Invariant cache hit.
[2023-03-20 14:01:37] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-20 14:01:37] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
[2023-03-20 14:01:37] [INFO ] Invariant cache hit.
[2023-03-20 14:01:37] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 106/112 places, 119/128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 452 ms. Remains : 106/112 places, 119/128 transitions.
Stuttering acceptance computed with spot in 397 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(LEQ s58 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22453 reset in 342 ms.
Product exploration explored 100000 steps with 22462 reset in 201 ms.
Computed a total of 30 stabilizing places and 38 stable transitions
Graph (complete) has 337 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 30 stabilizing places and 38 stable transitions
Detected a total of 30/106 stabilizing places and 38/119 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 186 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 269 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2228 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1058 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1828278 steps, run timeout after 3009 ms. (steps per millisecond=607 ) properties seen :{}
Probabilistic random walk after 1828278 steps, saw 854339 distinct states, run finished after 3010 ms. (steps per millisecond=607 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 14:01:41] [INFO ] Invariant cache hit.
[2023-03-20 14:01:41] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 14:01:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 14:01:41] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 5 ms returned sat
[2023-03-20 14:01:42] [INFO ] After 59ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 14:01:42] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-20 14:01:42] [INFO ] After 17ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 14:01:42] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2023-03-20 14:01:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2023-03-20 14:01:42] [INFO ] After 105ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-20 14:01:42] [INFO ] After 228ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 119/119 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.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions 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 117
Applied a total of 3 rules in 9 ms. Remains 105 /106 variables (removed 1) and now considering 117/119 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 105/106 places, 117/119 transitions.
Incomplete random walk after 10000 steps, including 2234 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1026 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2689854 steps, run timeout after 3001 ms. (steps per millisecond=896 ) properties seen :{}
Probabilistic random walk after 2689854 steps, saw 1253169 distinct states, run finished after 3004 ms. (steps per millisecond=895 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 117 rows 105 cols
[2023-03-20 14:01:45] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-20 14:01:45] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 14:01:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 14:01:45] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 14:01:45] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 14:01:45] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-20 14:01:45] [INFO ] After 14ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 14:01:45] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
[2023-03-20 14:01:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2023-03-20 14:01:45] [INFO ] After 75ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-20 14:01:45] [INFO ] After 170ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 117/117 transitions.
Applied a total of 0 rules in 5 ms. Remains 105 /105 variables (removed 0) and now considering 117/117 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 105/105 places, 117/117 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 117/117 transitions.
Applied a total of 0 rules in 5 ms. Remains 105 /105 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2023-03-20 14:01:45] [INFO ] Invariant cache hit.
[2023-03-20 14:01:45] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-20 14:01:45] [INFO ] Invariant cache hit.
[2023-03-20 14:01:45] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-20 14:01:45] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
[2023-03-20 14:01:45] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 14:01:45] [INFO ] Invariant cache hit.
[2023-03-20 14:01:45] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 330 ms. Remains : 105/105 places, 117/117 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 105 transition count 109
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 99 transition count 109
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 14 place count 99 transition count 91
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 50 place count 81 transition count 91
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 60 place count 76 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 75 transition count 94
Applied a total of 62 rules in 23 ms. Remains 75 /105 variables (removed 30) and now considering 94/117 (removed 23) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 75 cols
[2023-03-20 14:01:45] [INFO ] Computed 6 place invariants in 4 ms
[2023-03-20 14:01:45] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 14:01:45] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-20 14:01:45] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 14:01:45] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 14:01:45] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2023-03-20 14:01:45] [INFO ] Deduced a trap composed of 44 places in 33 ms of which 1 ms to minimize.
[2023-03-20 14:01:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 92 ms
[2023-03-20 14:01:46] [INFO ] After 127ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-20 14:01:46] [INFO ] After 169ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 283 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 119/119 transitions.
Applied a total of 0 rules in 1 ms. Remains 106 /106 variables (removed 0) and now considering 119/119 (removed 0) transitions.
// Phase 1: matrix 119 rows 106 cols
[2023-03-20 14:01:46] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-20 14:01:46] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-20 14:01:46] [INFO ] Invariant cache hit.
[2023-03-20 14:01:46] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-20 14:01:46] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
[2023-03-20 14:01:46] [INFO ] Invariant cache hit.
[2023-03-20 14:01:47] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 377 ms. Remains : 106/106 places, 119/119 transitions.
Computed a total of 30 stabilizing places and 38 stable transitions
Graph (complete) has 337 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 30 stabilizing places and 38 stable transitions
Detected a total of 30/106 stabilizing places and 38/119 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 172 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2259 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1048 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2362943 steps, run timeout after 3001 ms. (steps per millisecond=787 ) properties seen :{}
Probabilistic random walk after 2362943 steps, saw 1102174 distinct states, run finished after 3002 ms. (steps per millisecond=787 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 14:01:50] [INFO ] Invariant cache hit.
[2023-03-20 14:01:50] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 14:01:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-20 14:01:50] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-20 14:01:50] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 14:01:50] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-20 14:01:50] [INFO ] After 12ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 14:01:50] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 0 ms to minimize.
[2023-03-20 14:01:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2023-03-20 14:01:50] [INFO ] After 80ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-20 14:01:50] [INFO ] After 170ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 119/119 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.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions 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 117
Applied a total of 3 rules in 7 ms. Remains 105 /106 variables (removed 1) and now considering 117/119 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 105/106 places, 117/119 transitions.
Incomplete random walk after 10000 steps, including 2275 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1002 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2610541 steps, run timeout after 3001 ms. (steps per millisecond=869 ) properties seen :{}
Probabilistic random walk after 2610541 steps, saw 1214623 distinct states, run finished after 3001 ms. (steps per millisecond=869 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 117 rows 105 cols
[2023-03-20 14:01:53] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-20 14:01:53] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 14:01:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 14:01:53] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-20 14:01:53] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 14:01:53] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-20 14:01:53] [INFO ] After 9ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 14:01:53] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 0 ms to minimize.
[2023-03-20 14:01:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2023-03-20 14:01:53] [INFO ] After 71ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-20 14:01:53] [INFO ] After 165ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 117/117 transitions.
Applied a total of 0 rules in 4 ms. Remains 105 /105 variables (removed 0) and now considering 117/117 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 105/105 places, 117/117 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 117/117 transitions.
Applied a total of 0 rules in 4 ms. Remains 105 /105 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2023-03-20 14:01:53] [INFO ] Invariant cache hit.
[2023-03-20 14:01:54] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-20 14:01:54] [INFO ] Invariant cache hit.
[2023-03-20 14:01:54] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-20 14:01:54] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2023-03-20 14:01:54] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-20 14:01:54] [INFO ] Invariant cache hit.
[2023-03-20 14:01:54] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 344 ms. Remains : 105/105 places, 117/117 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 105 transition count 109
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 99 transition count 109
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 14 place count 99 transition count 91
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 50 place count 81 transition count 91
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 60 place count 76 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 75 transition count 94
Applied a total of 62 rules in 17 ms. Remains 75 /105 variables (removed 30) and now considering 94/117 (removed 23) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 75 cols
[2023-03-20 14:01:54] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-20 14:01:54] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 14:01:54] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-20 14:01:54] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 14:01:54] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 14:01:54] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2023-03-20 14:01:54] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 0 ms to minimize.
[2023-03-20 14:01:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 101 ms
[2023-03-20 14:01:54] [INFO ] After 136ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-20 14:01:54] [INFO ] After 169ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 153 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 278 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 242 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 272 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22464 reset in 146 ms.
Product exploration explored 100000 steps with 22483 reset in 136 ms.
Applying partial POR strategy [true, true, false, false, false, false]
Stuttering acceptance computed with spot in 229 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 119/119 transitions.
Applied a total of 0 rules in 14 ms. Remains 106 /106 variables (removed 0) and now considering 119/119 (removed 0) transitions.
[2023-03-20 14:01:56] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 119 rows 106 cols
[2023-03-20 14:01:56] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-20 14:01:56] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 104 ms. Remains : 106/106 places, 119/119 transitions.
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 119/119 transitions.
Applied a total of 0 rules in 2 ms. Remains 106 /106 variables (removed 0) and now considering 119/119 (removed 0) transitions.
[2023-03-20 14:01:56] [INFO ] Invariant cache hit.
[2023-03-20 14:01:56] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-20 14:01:56] [INFO ] Invariant cache hit.
[2023-03-20 14:01:56] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-20 14:01:56] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
[2023-03-20 14:01:56] [INFO ] Invariant cache hit.
[2023-03-20 14:01:56] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 336 ms. Remains : 106/106 places, 119/119 transitions.
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLCardinality-11 finished in 19738 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Found a Lengthening insensitive property : SieveSingleMsgMbox-PT-d2m96-LTLCardinality-11
Stuttering acceptance computed with spot in 255 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 112 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 112/112 places, 128/128 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 110 transition count 126
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 110 transition count 126
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 110 transition count 124
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 108 transition count 121
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 108 transition count 121
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 107 transition count 120
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 107 transition count 120
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 106 transition count 119
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 106 transition count 119
Applied a total of 14 rules in 27 ms. Remains 106 /112 variables (removed 6) and now considering 119/128 (removed 9) transitions.
[2023-03-20 14:01:57] [INFO ] Invariant cache hit.
[2023-03-20 14:01:57] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-20 14:01:57] [INFO ] Invariant cache hit.
[2023-03-20 14:01:57] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-20 14:01:57] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
[2023-03-20 14:01:57] [INFO ] Invariant cache hit.
[2023-03-20 14:01:57] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 106/112 places, 119/128 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 355 ms. Remains : 106/112 places, 119/128 transitions.
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(LEQ s58 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22442 reset in 120 ms.
Product exploration explored 100000 steps with 22570 reset in 125 ms.
Computed a total of 30 stabilizing places and 38 stable transitions
Graph (complete) has 337 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 30 stabilizing places and 38 stable transitions
Detected a total of 30/106 stabilizing places and 38/119 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 162 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2262 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1034 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2134364 steps, run timeout after 3001 ms. (steps per millisecond=711 ) properties seen :{}
Probabilistic random walk after 2134364 steps, saw 995698 distinct states, run finished after 3001 ms. (steps per millisecond=711 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 14:02:01] [INFO ] Invariant cache hit.
[2023-03-20 14:02:01] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 14:02:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 14:02:01] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-20 14:02:01] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 14:02:01] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-20 14:02:01] [INFO ] After 13ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 14:02:01] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2023-03-20 14:02:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2023-03-20 14:02:01] [INFO ] After 82ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-20 14:02:01] [INFO ] After 184ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 119/119 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.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions 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 117
Applied a total of 3 rules in 6 ms. Remains 105 /106 variables (removed 1) and now considering 117/119 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 105/106 places, 117/119 transitions.
Incomplete random walk after 10000 steps, including 2218 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1016 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2149419 steps, run timeout after 3001 ms. (steps per millisecond=716 ) properties seen :{}
Probabilistic random walk after 2149419 steps, saw 1002602 distinct states, run finished after 3002 ms. (steps per millisecond=715 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 117 rows 105 cols
[2023-03-20 14:02:04] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-20 14:02:04] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 14:02:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 14:02:04] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-20 14:02:04] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 14:02:04] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-20 14:02:04] [INFO ] After 15ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 14:02:04] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2023-03-20 14:02:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2023-03-20 14:02:04] [INFO ] After 89ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-20 14:02:04] [INFO ] After 207ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 117/117 transitions.
Applied a total of 0 rules in 7 ms. Remains 105 /105 variables (removed 0) and now considering 117/117 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 105/105 places, 117/117 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 117/117 transitions.
Applied a total of 0 rules in 3 ms. Remains 105 /105 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2023-03-20 14:02:04] [INFO ] Invariant cache hit.
[2023-03-20 14:02:04] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-20 14:02:04] [INFO ] Invariant cache hit.
[2023-03-20 14:02:04] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-20 14:02:04] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
[2023-03-20 14:02:04] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-20 14:02:04] [INFO ] Invariant cache hit.
[2023-03-20 14:02:04] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 331 ms. Remains : 105/105 places, 117/117 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 105 transition count 109
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 99 transition count 109
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 14 place count 99 transition count 91
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 50 place count 81 transition count 91
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 60 place count 76 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 75 transition count 94
Applied a total of 62 rules in 12 ms. Remains 75 /105 variables (removed 30) and now considering 94/117 (removed 23) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 75 cols
[2023-03-20 14:02:04] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-20 14:02:04] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 14:02:04] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-20 14:02:04] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 14:02:04] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 14:02:05] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2023-03-20 14:02:05] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 0 ms to minimize.
[2023-03-20 14:02:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 112 ms
[2023-03-20 14:02:05] [INFO ] After 144ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-20 14:02:05] [INFO ] After 185ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 175 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 330 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 248 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 119/119 transitions.
Applied a total of 0 rules in 5 ms. Remains 106 /106 variables (removed 0) and now considering 119/119 (removed 0) transitions.
// Phase 1: matrix 119 rows 106 cols
[2023-03-20 14:02:05] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-20 14:02:06] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-20 14:02:06] [INFO ] Invariant cache hit.
[2023-03-20 14:02:06] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-20 14:02:06] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
[2023-03-20 14:02:06] [INFO ] Invariant cache hit.
[2023-03-20 14:02:06] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 611 ms. Remains : 106/106 places, 119/119 transitions.
Computed a total of 30 stabilizing places and 38 stable transitions
Graph (complete) has 337 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 30 stabilizing places and 38 stable transitions
Detected a total of 30/106 stabilizing places and 38/119 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 222 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 280 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2252 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1052 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2395733 steps, run timeout after 3001 ms. (steps per millisecond=798 ) properties seen :{}
Probabilistic random walk after 2395733 steps, saw 1117105 distinct states, run finished after 3001 ms. (steps per millisecond=798 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 14:02:10] [INFO ] Invariant cache hit.
[2023-03-20 14:02:10] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 14:02:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 14:02:10] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 14:02:10] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 14:02:10] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-20 14:02:10] [INFO ] After 11ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 14:02:10] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2023-03-20 14:02:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2023-03-20 14:02:10] [INFO ] After 78ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-20 14:02:10] [INFO ] After 190ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 119/119 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.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions 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 117
Applied a total of 3 rules in 6 ms. Remains 105 /106 variables (removed 1) and now considering 117/119 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 105/106 places, 117/119 transitions.
Incomplete random walk after 10000 steps, including 2252 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1045 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2539793 steps, run timeout after 3001 ms. (steps per millisecond=846 ) properties seen :{}
Probabilistic random walk after 2539793 steps, saw 1181370 distinct states, run finished after 3001 ms. (steps per millisecond=846 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 117 rows 105 cols
[2023-03-20 14:02:13] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-20 14:02:13] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 14:02:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 14:02:13] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-20 14:02:13] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 14:02:13] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-20 14:02:13] [INFO ] After 11ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 14:02:13] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 0 ms to minimize.
[2023-03-20 14:02:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2023-03-20 14:02:13] [INFO ] After 72ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-20 14:02:13] [INFO ] After 162ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 117/117 transitions.
Applied a total of 0 rules in 3 ms. Remains 105 /105 variables (removed 0) and now considering 117/117 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 105/105 places, 117/117 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 117/117 transitions.
Applied a total of 0 rules in 3 ms. Remains 105 /105 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2023-03-20 14:02:13] [INFO ] Invariant cache hit.
[2023-03-20 14:02:13] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-20 14:02:13] [INFO ] Invariant cache hit.
[2023-03-20 14:02:13] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-20 14:02:13] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
[2023-03-20 14:02:13] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 14:02:13] [INFO ] Invariant cache hit.
[2023-03-20 14:02:13] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 414 ms. Remains : 105/105 places, 117/117 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 105 transition count 109
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 99 transition count 109
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 14 place count 99 transition count 91
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 50 place count 81 transition count 91
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 60 place count 76 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 75 transition count 94
Applied a total of 62 rules in 7 ms. Remains 75 /105 variables (removed 30) and now considering 94/117 (removed 23) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 75 cols
[2023-03-20 14:02:13] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-20 14:02:13] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 14:02:14] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-20 14:02:14] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 14:02:14] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 14:02:14] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2023-03-20 14:02:14] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
[2023-03-20 14:02:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 103 ms
[2023-03-20 14:02:14] [INFO ] After 129ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-20 14:02:14] [INFO ] After 189ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 150 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22511 reset in 120 ms.
Product exploration explored 100000 steps with 22382 reset in 124 ms.
Applying partial POR strategy [true, true, false, false, false, false]
Stuttering acceptance computed with spot in 240 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 119/119 transitions.
Applied a total of 0 rules in 8 ms. Remains 106 /106 variables (removed 0) and now considering 119/119 (removed 0) transitions.
[2023-03-20 14:02:15] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 119 rows 106 cols
[2023-03-20 14:02:15] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-20 14:02:15] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 101 ms. Remains : 106/106 places, 119/119 transitions.
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 119/119 transitions.
Applied a total of 0 rules in 0 ms. Remains 106 /106 variables (removed 0) and now considering 119/119 (removed 0) transitions.
[2023-03-20 14:02:15] [INFO ] Invariant cache hit.
[2023-03-20 14:02:15] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-20 14:02:15] [INFO ] Invariant cache hit.
[2023-03-20 14:02:15] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-20 14:02:15] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
[2023-03-20 14:02:15] [INFO ] Invariant cache hit.
[2023-03-20 14:02:15] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 367 ms. Remains : 106/106 places, 119/119 transitions.
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLCardinality-11 finished in 19277 ms.
[2023-03-20 14:02:15] [INFO ] Flatten gal took : 10 ms
[2023-03-20 14:02:15] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-20 14:02:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 112 places, 128 transitions and 509 arcs took 1 ms.
Total runtime 48374 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1275/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : SieveSingleMsgMbox-PT-d2m96-LTLCardinality-11

BK_STOP 1679320936405

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name SieveSingleMsgMbox-PT-d2m96-LTLCardinality-11
ltl formula formula --ltl=/tmp/1275/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
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 112 places, 128 transitions and 509 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.030 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1275/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1275/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1275/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1275/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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-5348"
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 r425-tajo-167905978300491"
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 '' 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 ;