Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r395-smll-171683823900058.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is SieveSingleMsgMbox-PT-d1m96, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r395-smll-171683823900058
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 868K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Apr 12 19:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 12 19:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 19:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 12 19:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 450K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716930802403

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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d1m96
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-28 21:13:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 21:13:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 21:13:25] [INFO ] Load time of PNML (sax parser for PT used): 294 ms
[2024-05-28 21:13:25] [INFO ] Transformed 1295 places.
[2024-05-28 21:13:25] [INFO ] Transformed 749 transitions.
[2024-05-28 21:13:25] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 481 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Deduced a syphon composed of 1036 places in 15 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 749/749 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 0 with 257 rules applied. Total rules applied 257 place count 242 transition count 509
Discarding 49 places :
Symmetric choice reduction at 1 with 49 rule applications. Total rules 306 place count 193 transition count 388
Iterating global reduction 1 with 49 rules applied. Total rules applied 355 place count 193 transition count 388
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 361 place count 193 transition count 382
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 391 place count 163 transition count 352
Iterating global reduction 2 with 30 rules applied. Total rules applied 421 place count 163 transition count 352
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 428 place count 163 transition count 345
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 447 place count 144 transition count 324
Iterating global reduction 3 with 19 rules applied. Total rules applied 466 place count 144 transition count 324
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 3 with 60 rules applied. Total rules applied 526 place count 144 transition count 264
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 528 place count 142 transition count 261
Iterating global reduction 4 with 2 rules applied. Total rules applied 530 place count 142 transition count 261
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 532 place count 140 transition count 259
Iterating global reduction 4 with 2 rules applied. Total rules applied 534 place count 140 transition count 259
Applied a total of 534 rules in 144 ms. Remains 140 /259 variables (removed 119) and now considering 259/749 (removed 490) transitions.
// Phase 1: matrix 259 rows 140 cols
[2024-05-28 21:13:26] [INFO ] Computed 5 invariants in 18 ms
[2024-05-28 21:13:26] [INFO ] Implicit Places using invariants in 364 ms returned []
[2024-05-28 21:13:26] [INFO ] Invariant cache hit.
[2024-05-28 21:13:27] [INFO ] State equation strengthened by 163 read => feed constraints.
[2024-05-28 21:13:27] [INFO ] Implicit Places using invariants and state equation in 807 ms returned []
Implicit Place search using SMT with State Equation took 1216 ms to find 0 implicit places.
[2024-05-28 21:13:27] [INFO ] Invariant cache hit.
[2024-05-28 21:13:27] [INFO ] Dead Transitions using invariants and state equation in 262 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 140/259 places, 259/749 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1645 ms. Remains : 140/259 places, 259/749 transitions.
Support contains 21 out of 140 places after structural reductions.
[2024-05-28 21:13:28] [INFO ] Flatten gal took : 170 ms
[2024-05-28 21:13:28] [INFO ] Flatten gal took : 53 ms
[2024-05-28 21:13:28] [INFO ] Input system was already deterministic with 259 transitions.
Support contains 20 out of 140 places (down from 21) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2199 resets, run finished after 680 ms. (steps per millisecond=14 ) properties (out of 19) seen :2
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 57 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 93 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 52 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 38 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 54 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 59 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
[2024-05-28 21:13:29] [INFO ] Invariant cache hit.
[2024-05-28 21:13:30] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 21:13:30] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 9 ms returned sat
[2024-05-28 21:13:31] [INFO ] After 1219ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:16
[2024-05-28 21:13:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 21:13:31] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 11 ms returned sat
[2024-05-28 21:13:32] [INFO ] After 917ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :16
[2024-05-28 21:13:32] [INFO ] State equation strengthened by 163 read => feed constraints.
[2024-05-28 21:13:33] [INFO ] After 1552ms SMT Verify possible using 163 Read/Feed constraints in natural domain returned unsat :1 sat :16
[2024-05-28 21:13:34] [INFO ] Deduced a trap composed of 22 places in 136 ms of which 70 ms to minimize.
[2024-05-28 21:13:34] [INFO ] Deduced a trap composed of 41 places in 170 ms of which 2 ms to minimize.
[2024-05-28 21:13:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 423 ms
[2024-05-28 21:13:36] [INFO ] After 3934ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :16
Attempting to minimize the solution found.
Minimization took 2019 ms.
[2024-05-28 21:13:38] [INFO ] After 7202ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :16
Fused 17 Parikh solutions to 15 different solutions.
Parikh walk visited 0 properties in 493 ms.
Support contains 18 out of 140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 259/259 transitions.
Graph (complete) has 476 edges and 140 vertex of which 139 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 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 139 transition count 257
Applied a total of 3 rules in 57 ms. Remains 139 /140 variables (removed 1) and now considering 257/259 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 139/140 places, 257/259 transitions.
Incomplete random walk after 10000 steps, including 2277 resets, run finished after 424 ms. (steps per millisecond=23 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 109 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 49 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 57 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 37 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 40 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 41 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 43 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 40 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 383927 steps, run timeout after 3001 ms. (steps per millisecond=127 ) properties seen :{1=1, 2=1, 3=1, 4=1, 9=1, 10=1, 11=1, 12=1, 13=1, 14=1, 15=1}
Probabilistic random walk after 383927 steps, saw 179581 distinct states, run finished after 3002 ms. (steps per millisecond=127 ) properties seen :11
Running SMT prover for 5 properties.
// Phase 1: matrix 257 rows 139 cols
[2024-05-28 21:13:42] [INFO ] Computed 4 invariants in 8 ms
[2024-05-28 21:13:42] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 21:13:42] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 21:13:43] [INFO ] After 678ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-28 21:13:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 21:13:43] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 4 ms returned sat
[2024-05-28 21:13:43] [INFO ] After 447ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-28 21:13:43] [INFO ] State equation strengthened by 161 read => feed constraints.
[2024-05-28 21:13:44] [INFO ] After 412ms SMT Verify possible using 161 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-28 21:13:44] [INFO ] After 1070ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 614 ms.
[2024-05-28 21:13:45] [INFO ] After 2291ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 139 ms.
Support contains 6 out of 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 257/257 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 129 transition count 183
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 129 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 129 transition count 182
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 31 place count 119 transition count 171
Iterating global reduction 1 with 10 rules applied. Total rules applied 41 place count 119 transition count 171
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 44 place count 119 transition count 168
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 49 place count 114 transition count 163
Iterating global reduction 2 with 5 rules applied. Total rules applied 54 place count 114 transition count 163
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 56 place count 114 transition count 161
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 59 place count 111 transition count 158
Iterating global reduction 3 with 3 rules applied. Total rules applied 62 place count 111 transition count 158
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 65 place count 108 transition count 154
Iterating global reduction 3 with 3 rules applied. Total rules applied 68 place count 108 transition count 154
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 71 place count 105 transition count 151
Iterating global reduction 3 with 3 rules applied. Total rules applied 74 place count 105 transition count 151
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 79 place count 105 transition count 146
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 81 place count 103 transition count 144
Iterating global reduction 4 with 2 rules applied. Total rules applied 83 place count 103 transition count 144
Applied a total of 83 rules in 68 ms. Remains 103 /139 variables (removed 36) and now considering 144/257 (removed 113) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 103/139 places, 144/257 transitions.
Incomplete random walk after 10000 steps, including 2299 resets, run finished after 278 ms. (steps per millisecond=35 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 499 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 464 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 494 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 483 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 505 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 545827 steps, run timeout after 3001 ms. (steps per millisecond=181 ) properties seen :{}
Probabilistic random walk after 545827 steps, saw 237104 distinct states, run finished after 3004 ms. (steps per millisecond=181 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 144 rows 103 cols
[2024-05-28 21:13:49] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 21:13:49] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 21:13:49] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 21:13:49] [INFO ] After 223ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-28 21:13:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 21:13:49] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 21:13:49] [INFO ] After 185ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-28 21:13:49] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-28 21:13:49] [INFO ] After 161ms SMT Verify possible using 73 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-28 21:13:50] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 2 ms to minimize.
[2024-05-28 21:13:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2024-05-28 21:13:50] [INFO ] After 416ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 222 ms.
[2024-05-28 21:13:50] [INFO ] After 897ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 135 ms.
Support contains 6 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 144/144 transitions.
Applied a total of 0 rules in 12 ms. Remains 103 /103 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 103/103 places, 144/144 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 144/144 transitions.
Applied a total of 0 rules in 12 ms. Remains 103 /103 variables (removed 0) and now considering 144/144 (removed 0) transitions.
[2024-05-28 21:13:50] [INFO ] Invariant cache hit.
[2024-05-28 21:13:50] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-28 21:13:50] [INFO ] Invariant cache hit.
[2024-05-28 21:13:50] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-28 21:13:51] [INFO ] Implicit Places using invariants and state equation in 488 ms returned []
Implicit Place search using SMT with State Equation took 654 ms to find 0 implicit places.
[2024-05-28 21:13:51] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-28 21:13:51] [INFO ] Invariant cache hit.
[2024-05-28 21:13:51] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 857 ms. Remains : 103/103 places, 144/144 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 103 transition count 138
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 98 transition count 138
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 11 place count 98 transition count 122
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 43 place count 82 transition count 122
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 57 place count 75 transition count 115
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 75 transition count 115
Applied a total of 59 rules in 36 ms. Remains 75 /103 variables (removed 28) and now considering 115/144 (removed 29) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 115 rows 75 cols
[2024-05-28 21:13:51] [INFO ] Computed 4 invariants in 3 ms
[2024-05-28 21:13:51] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2024-05-28 21:13:51] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 31 ms returned sat
[2024-05-28 21:13:52] [INFO ] After 803ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-28 21:13:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 21:13:52] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 21:13:52] [INFO ] After 188ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-28 21:13:52] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-28 21:13:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2024-05-28 21:13:52] [INFO ] After 384ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 141 ms.
[2024-05-28 21:13:52] [INFO ] After 608ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Computed a total of 31 stabilizing places and 49 stable transitions
Graph (complete) has 529 edges and 140 vertex of which 139 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.11 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 259/259 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 126 transition count 157
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 126 transition count 157
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 126 transition count 155
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 44 place count 112 transition count 139
Iterating global reduction 1 with 14 rules applied. Total rules applied 58 place count 112 transition count 139
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 64 place count 112 transition count 133
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 73 place count 103 transition count 124
Iterating global reduction 2 with 9 rules applied. Total rules applied 82 place count 103 transition count 124
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 85 place count 103 transition count 121
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 90 place count 98 transition count 116
Iterating global reduction 3 with 5 rules applied. Total rules applied 95 place count 98 transition count 116
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 100 place count 93 transition count 110
Iterating global reduction 3 with 5 rules applied. Total rules applied 105 place count 93 transition count 110
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 109 place count 89 transition count 106
Iterating global reduction 3 with 4 rules applied. Total rules applied 113 place count 89 transition count 106
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 115 place count 89 transition count 104
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 118 place count 86 transition count 100
Iterating global reduction 4 with 3 rules applied. Total rules applied 121 place count 86 transition count 100
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 122 place count 85 transition count 99
Iterating global reduction 4 with 1 rules applied. Total rules applied 123 place count 85 transition count 99
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 124 place count 84 transition count 98
Iterating global reduction 4 with 1 rules applied. Total rules applied 125 place count 84 transition count 98
Applied a total of 125 rules in 66 ms. Remains 84 /140 variables (removed 56) and now considering 98/259 (removed 161) transitions.
// Phase 1: matrix 98 rows 84 cols
[2024-05-28 21:13:53] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 21:13:53] [INFO ] Implicit Places using invariants in 333 ms returned []
[2024-05-28 21:13:53] [INFO ] Invariant cache hit.
[2024-05-28 21:13:53] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-28 21:13:54] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 656 ms to find 0 implicit places.
[2024-05-28 21:13:54] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-28 21:13:54] [INFO ] Invariant cache hit.
[2024-05-28 21:13:54] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/140 places, 98/259 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 835 ms. Remains : 84/140 places, 98/259 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 257 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s79 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 2 ms.
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-00 finished in 1205 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U p1)&&F(G(!p1))))'
Support contains 4 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 259/259 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 127 transition count 158
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 127 transition count 158
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 127 transition count 156
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 41 place count 114 transition count 141
Iterating global reduction 1 with 13 rules applied. Total rules applied 54 place count 114 transition count 141
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 60 place count 114 transition count 135
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 68 place count 106 transition count 127
Iterating global reduction 2 with 8 rules applied. Total rules applied 76 place count 106 transition count 127
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 79 place count 106 transition count 124
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 83 place count 102 transition count 120
Iterating global reduction 3 with 4 rules applied. Total rules applied 87 place count 102 transition count 120
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 91 place count 98 transition count 116
Iterating global reduction 3 with 4 rules applied. Total rules applied 95 place count 98 transition count 116
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 98 place count 95 transition count 113
Iterating global reduction 3 with 3 rules applied. Total rules applied 101 place count 95 transition count 113
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 103 place count 95 transition count 111
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 105 place count 93 transition count 108
Iterating global reduction 4 with 2 rules applied. Total rules applied 107 place count 93 transition count 108
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 108 place count 92 transition count 107
Iterating global reduction 4 with 1 rules applied. Total rules applied 109 place count 92 transition count 107
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 110 place count 91 transition count 106
Iterating global reduction 4 with 1 rules applied. Total rules applied 111 place count 91 transition count 106
Applied a total of 111 rules in 72 ms. Remains 91 /140 variables (removed 49) and now considering 106/259 (removed 153) transitions.
// Phase 1: matrix 106 rows 91 cols
[2024-05-28 21:13:54] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 21:13:54] [INFO ] Implicit Places using invariants in 208 ms returned []
[2024-05-28 21:13:54] [INFO ] Invariant cache hit.
[2024-05-28 21:13:54] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-28 21:13:54] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
[2024-05-28 21:13:55] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-28 21:13:55] [INFO ] Invariant cache hit.
[2024-05-28 21:13:55] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 91/140 places, 106/259 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 725 ms. Remains : 91/140 places, 106/259 transitions.
Stuttering acceptance computed with spot in 225 ms :[true, (NOT p0), (NOT p1), p1]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s13 1) (GEQ s27 1)), p0:(AND (GEQ s1 1) (GEQ s86 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 11 steps with 1 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-02 finished in 977 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))||(!p1&&X((!p1 U (!p2||G(!p1))))))))'
Support contains 4 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 259/259 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 127 transition count 166
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 127 transition count 166
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 127 transition count 164
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 41 place count 114 transition count 149
Iterating global reduction 1 with 13 rules applied. Total rules applied 54 place count 114 transition count 149
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 60 place count 114 transition count 143
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 69 place count 105 transition count 134
Iterating global reduction 2 with 9 rules applied. Total rules applied 78 place count 105 transition count 134
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 81 place count 105 transition count 131
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 86 place count 100 transition count 126
Iterating global reduction 3 with 5 rules applied. Total rules applied 91 place count 100 transition count 126
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 96 place count 95 transition count 120
Iterating global reduction 3 with 5 rules applied. Total rules applied 101 place count 95 transition count 120
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 105 place count 91 transition count 116
Iterating global reduction 3 with 4 rules applied. Total rules applied 109 place count 91 transition count 116
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 112 place count 91 transition count 113
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 115 place count 88 transition count 109
Iterating global reduction 4 with 3 rules applied. Total rules applied 118 place count 88 transition count 109
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 119 place count 87 transition count 108
Iterating global reduction 4 with 1 rules applied. Total rules applied 120 place count 87 transition count 108
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 121 place count 86 transition count 107
Iterating global reduction 4 with 1 rules applied. Total rules applied 122 place count 86 transition count 107
Applied a total of 122 rules in 26 ms. Remains 86 /140 variables (removed 54) and now considering 107/259 (removed 152) transitions.
// Phase 1: matrix 107 rows 86 cols
[2024-05-28 21:13:55] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 21:13:55] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-28 21:13:55] [INFO ] Invariant cache hit.
[2024-05-28 21:13:55] [INFO ] State equation strengthened by 52 read => feed constraints.
[2024-05-28 21:13:55] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
[2024-05-28 21:13:55] [INFO ] Invariant cache hit.
[2024-05-28 21:13:56] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 86/140 places, 107/259 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 632 ms. Remains : 86/140 places, 107/259 transitions.
Stuttering acceptance computed with spot in 215 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1 p2)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (LT s1 1) (LT s33 1)), p1:(AND (GEQ s1 1) (GEQ s79 1)), p2:(AND (GEQ s1 1) (GEQ s81 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 640 ms.
Product exploration explored 100000 steps with 33333 reset in 417 ms.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 281 edges and 86 vertex of which 85 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 34 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-04 finished in 1964 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(!p1))))'
Support contains 3 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 259/259 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 127 transition count 166
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 127 transition count 166
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 127 transition count 164
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 41 place count 114 transition count 149
Iterating global reduction 1 with 13 rules applied. Total rules applied 54 place count 114 transition count 149
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 59 place count 114 transition count 144
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 67 place count 106 transition count 136
Iterating global reduction 2 with 8 rules applied. Total rules applied 75 place count 106 transition count 136
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 77 place count 106 transition count 134
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 81 place count 102 transition count 130
Iterating global reduction 3 with 4 rules applied. Total rules applied 85 place count 102 transition count 130
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 89 place count 98 transition count 125
Iterating global reduction 3 with 4 rules applied. Total rules applied 93 place count 98 transition count 125
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 97 place count 94 transition count 121
Iterating global reduction 3 with 4 rules applied. Total rules applied 101 place count 94 transition count 121
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 104 place count 94 transition count 118
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 107 place count 91 transition count 114
Iterating global reduction 4 with 3 rules applied. Total rules applied 110 place count 91 transition count 114
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 111 place count 90 transition count 113
Iterating global reduction 4 with 1 rules applied. Total rules applied 112 place count 90 transition count 113
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 113 place count 89 transition count 112
Iterating global reduction 4 with 1 rules applied. Total rules applied 114 place count 89 transition count 112
Applied a total of 114 rules in 29 ms. Remains 89 /140 variables (removed 51) and now considering 112/259 (removed 147) transitions.
// Phase 1: matrix 112 rows 89 cols
[2024-05-28 21:13:57] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 21:13:58] [INFO ] Implicit Places using invariants in 617 ms returned []
[2024-05-28 21:13:58] [INFO ] Invariant cache hit.
[2024-05-28 21:13:58] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-28 21:13:58] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 928 ms to find 0 implicit places.
[2024-05-28 21:13:58] [INFO ] Invariant cache hit.
[2024-05-28 21:13:58] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 89/140 places, 112/259 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1089 ms. Remains : 89/140 places, 112/259 transitions.
Stuttering acceptance computed with spot in 159 ms :[true, (AND p1 (NOT p0)), p1, (AND p1 (NOT p0))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s1 1) (GEQ s84 1)), p0:(AND (GEQ s1 1) (GEQ s83 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 22511 reset in 303 ms.
Product exploration explored 100000 steps with 22547 reset in 257 ms.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 292 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 101 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[true, p1]
Incomplete random walk after 10000 steps, including 2249 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 484 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 45523 steps, run visited all 1 properties in 77 ms. (steps per millisecond=591 )
Probabilistic random walk after 45523 steps, saw 19650 distinct states, run finished after 78 ms. (steps per millisecond=583 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), true, (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Property proved to be false thanks to negative knowledge :(F p1)
Knowledge based reduction with 5 factoid took 132 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-05 finished in 2288 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(G(p1)))))'
Support contains 3 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 259/259 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 126 transition count 157
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 126 transition count 157
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 126 transition count 155
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 44 place count 112 transition count 139
Iterating global reduction 1 with 14 rules applied. Total rules applied 58 place count 112 transition count 139
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 64 place count 112 transition count 133
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 73 place count 103 transition count 124
Iterating global reduction 2 with 9 rules applied. Total rules applied 82 place count 103 transition count 124
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 85 place count 103 transition count 121
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 90 place count 98 transition count 116
Iterating global reduction 3 with 5 rules applied. Total rules applied 95 place count 98 transition count 116
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 100 place count 93 transition count 110
Iterating global reduction 3 with 5 rules applied. Total rules applied 105 place count 93 transition count 110
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 109 place count 89 transition count 106
Iterating global reduction 3 with 4 rules applied. Total rules applied 113 place count 89 transition count 106
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 115 place count 89 transition count 104
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 118 place count 86 transition count 100
Iterating global reduction 4 with 3 rules applied. Total rules applied 121 place count 86 transition count 100
Applied a total of 121 rules in 19 ms. Remains 86 /140 variables (removed 54) and now considering 100/259 (removed 159) transitions.
// Phase 1: matrix 100 rows 86 cols
[2024-05-28 21:13:59] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 21:13:59] [INFO ] Implicit Places using invariants in 249 ms returned []
[2024-05-28 21:13:59] [INFO ] Invariant cache hit.
[2024-05-28 21:14:00] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-28 21:14:00] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 633 ms to find 0 implicit places.
[2024-05-28 21:14:00] [INFO ] Invariant cache hit.
[2024-05-28 21:14:00] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 86/140 places, 100/259 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 750 ms. Remains : 86/140 places, 100/259 transitions.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(OR (LT s1 1) (LT s81 1)), p1:(OR (LT s1 1) (LT s41 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 22509 reset in 405 ms.
Product exploration explored 100000 steps with 22408 reset in 243 ms.
Computed a total of 15 stabilizing places and 19 stable transitions
Graph (complete) has 275 edges and 86 vertex of which 85 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 15 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 122 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2209 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 487 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2024-05-28 21:14:01] [INFO ] Invariant cache hit.
[2024-05-28 21:14:01] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 21:14:01] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 4 ms returned sat
[2024-05-28 21:14:01] [INFO ] After 162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 21:14:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 21:14:01] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-28 21:14:01] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 21:14:02] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-28 21:14:02] [INFO ] After 25ms SMT Verify possible using 45 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 21:14:02] [INFO ] After 54ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2024-05-28 21:14:02] [INFO ] After 207ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 100/100 transitions.
Graph (complete) has 243 edges and 86 vertex of which 85 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 85 transition count 98
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 84 transition count 97
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 84 transition count 97
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 83 transition count 96
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 83 transition count 96
Applied a total of 7 rules in 19 ms. Remains 83 /86 variables (removed 3) and now considering 96/100 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 83/86 places, 96/100 transitions.
Incomplete random walk after 10000 steps, including 2266 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 500 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2133760 steps, run timeout after 3001 ms. (steps per millisecond=711 ) properties seen :{}
Probabilistic random walk after 2133760 steps, saw 894615 distinct states, run finished after 3001 ms. (steps per millisecond=711 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 96 rows 83 cols
[2024-05-28 21:14:05] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 21:14:05] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 21:14:05] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 21:14:05] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 21:14:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 21:14:05] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-28 21:14:05] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 21:14:05] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-28 21:14:05] [INFO ] After 26ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 21:14:05] [INFO ] After 46ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2024-05-28 21:14:05] [INFO ] After 192ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 96/96 transitions.
Applied a total of 0 rules in 5 ms. Remains 83 /83 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 83/83 places, 96/96 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 96/96 transitions.
Applied a total of 0 rules in 4 ms. Remains 83 /83 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-28 21:14:05] [INFO ] Invariant cache hit.
[2024-05-28 21:14:05] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-28 21:14:05] [INFO ] Invariant cache hit.
[2024-05-28 21:14:05] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-28 21:14:05] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
[2024-05-28 21:14:05] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-28 21:14:05] [INFO ] Invariant cache hit.
[2024-05-28 21:14:05] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 506 ms. Remains : 83/83 places, 96/96 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 83 transition count 90
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 78 transition count 90
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 11 place count 78 transition count 77
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 37 place count 65 transition count 77
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 51 place count 58 transition count 70
Applied a total of 51 rules in 10 ms. Remains 58 /83 variables (removed 25) and now considering 70/96 (removed 26) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 70 rows 58 cols
[2024-05-28 21:14:05] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 21:14:06] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 21:14:06] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 21:14:06] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 21:14:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 21:14:06] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 21:14:06] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 21:14:06] [INFO ] After 57ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-05-28 21:14:06] [INFO ] After 100ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 142 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 100/100 transitions.
Applied a total of 0 rules in 6 ms. Remains 86 /86 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 86 cols
[2024-05-28 21:14:06] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 21:14:06] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-28 21:14:06] [INFO ] Invariant cache hit.
[2024-05-28 21:14:06] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-28 21:14:07] [INFO ] Implicit Places using invariants and state equation in 344 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
[2024-05-28 21:14:07] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-28 21:14:07] [INFO ] Invariant cache hit.
[2024-05-28 21:14:07] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 682 ms. Remains : 86/86 places, 100/100 transitions.
Computed a total of 15 stabilizing places and 19 stable transitions
Graph (complete) has 275 edges and 86 vertex of which 85 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 15 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 122 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2256 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 495 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-28 21:14:07] [INFO ] Invariant cache hit.
[2024-05-28 21:14:07] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 21:14:07] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 4 ms returned sat
[2024-05-28 21:14:07] [INFO ] After 151ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 21:14:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 21:14:07] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-28 21:14:07] [INFO ] After 69ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 21:14:07] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-28 21:14:07] [INFO ] After 20ms SMT Verify possible using 45 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 21:14:07] [INFO ] After 43ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-28 21:14:07] [INFO ] After 176ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 100/100 transitions.
Graph (complete) has 243 edges and 86 vertex of which 85 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 85 transition count 98
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 84 transition count 97
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 84 transition count 97
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 83 transition count 96
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 83 transition count 96
Applied a total of 7 rules in 12 ms. Remains 83 /86 variables (removed 3) and now considering 96/100 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 83/86 places, 96/100 transitions.
Incomplete random walk after 10000 steps, including 2195 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 481 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2034740 steps, run timeout after 3001 ms. (steps per millisecond=678 ) properties seen :{}
Probabilistic random walk after 2034740 steps, saw 850795 distinct states, run finished after 3003 ms. (steps per millisecond=677 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 96 rows 83 cols
[2024-05-28 21:14:10] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 21:14:11] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 21:14:11] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 21:14:11] [INFO ] After 187ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 21:14:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 21:14:11] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 21:14:11] [INFO ] After 86ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 21:14:11] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-28 21:14:11] [INFO ] After 38ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 21:14:11] [INFO ] After 66ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2024-05-28 21:14:11] [INFO ] After 233ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 96/96 transitions.
Applied a total of 0 rules in 5 ms. Remains 83 /83 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 83/83 places, 96/96 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 96/96 transitions.
Applied a total of 0 rules in 4 ms. Remains 83 /83 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-28 21:14:11] [INFO ] Invariant cache hit.
[2024-05-28 21:14:11] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-28 21:14:11] [INFO ] Invariant cache hit.
[2024-05-28 21:14:11] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-28 21:14:11] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
[2024-05-28 21:14:11] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 21:14:11] [INFO ] Invariant cache hit.
[2024-05-28 21:14:11] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 523 ms. Remains : 83/83 places, 96/96 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 83 transition count 90
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 78 transition count 90
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 11 place count 78 transition count 77
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 37 place count 65 transition count 77
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 51 place count 58 transition count 70
Applied a total of 51 rules in 7 ms. Remains 58 /83 variables (removed 25) and now considering 70/96 (removed 26) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 70 rows 58 cols
[2024-05-28 21:14:11] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 21:14:11] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 21:14:11] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 21:14:12] [INFO ] After 128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 21:14:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 21:14:12] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 21:14:12] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 21:14:12] [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 13 ms.
[2024-05-28 21:14:12] [INFO ] After 123ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 148 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 22419 reset in 139 ms.
Product exploration explored 100000 steps with 22448 reset in 155 ms.
Built C files in :
/tmp/ltsmin11425050041987680693
[2024-05-28 21:14:12] [INFO ] Computing symmetric may disable matrix : 100 transitions.
[2024-05-28 21:14:12] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:14:12] [INFO ] Computing symmetric may enable matrix : 100 transitions.
[2024-05-28 21:14:12] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:14:13] [INFO ] Computing Do-Not-Accords matrix : 100 transitions.
[2024-05-28 21:14:13] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:14:13] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11425050041987680693
Running compilation step : cd /tmp/ltsmin11425050041987680693;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 712 ms.
Running link step : cd /tmp/ltsmin11425050041987680693;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin11425050041987680693;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10839408369838956216.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 86 /86 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 86 cols
[2024-05-28 21:14:28] [INFO ] Computed 5 invariants in 4 ms
[2024-05-28 21:14:28] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-28 21:14:28] [INFO ] Invariant cache hit.
[2024-05-28 21:14:28] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-28 21:14:28] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
[2024-05-28 21:14:28] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 21:14:28] [INFO ] Invariant cache hit.
[2024-05-28 21:14:28] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 474 ms. Remains : 86/86 places, 100/100 transitions.
Built C files in :
/tmp/ltsmin15966024023425519295
[2024-05-28 21:14:28] [INFO ] Computing symmetric may disable matrix : 100 transitions.
[2024-05-28 21:14:28] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:14:28] [INFO ] Computing symmetric may enable matrix : 100 transitions.
[2024-05-28 21:14:28] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:14:28] [INFO ] Computing Do-Not-Accords matrix : 100 transitions.
[2024-05-28 21:14:28] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:14:28] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15966024023425519295
Running compilation step : cd /tmp/ltsmin15966024023425519295;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 440 ms.
Running link step : cd /tmp/ltsmin15966024023425519295;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin15966024023425519295;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15760278126000642858.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 21:14:43] [INFO ] Flatten gal took : 10 ms
[2024-05-28 21:14:43] [INFO ] Flatten gal took : 9 ms
[2024-05-28 21:14:43] [INFO ] Time to serialize gal into /tmp/LTL2530372177775413443.gal : 3 ms
[2024-05-28 21:14:43] [INFO ] Time to serialize properties into /tmp/LTL6859541727556752968.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2530372177775413443.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3745340102498597617.hoa' '-atoms' '/tmp/LTL6859541727556752968.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL6859541727556752968.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3745340102498597617.hoa
Detected timeout of ITS tools.
[2024-05-28 21:14:58] [INFO ] Flatten gal took : 8 ms
[2024-05-28 21:14:58] [INFO ] Flatten gal took : 7 ms
[2024-05-28 21:14:58] [INFO ] Time to serialize gal into /tmp/LTL9450312290429400734.gal : 3 ms
[2024-05-28 21:14:58] [INFO ] Time to serialize properties into /tmp/LTL8155713442832603703.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9450312290429400734.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8155713442832603703.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X((G("((s1<1)||(l1192<1))"))||(F(G("((s1<1)||(l149<1))"))))))
Formula 0 simplified : X(F!"((s1<1)||(l1192<1))" & GF!"((s1<1)||(l149<1))")
Detected timeout of ITS tools.
[2024-05-28 21:15:13] [INFO ] Flatten gal took : 8 ms
[2024-05-28 21:15:13] [INFO ] Applying decomposition
[2024-05-28 21:15:14] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph4976564341104491757.txt' '-o' '/tmp/graph4976564341104491757.bin' '-w' '/tmp/graph4976564341104491757.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4976564341104491757.bin' '-l' '-1' '-v' '-w' '/tmp/graph4976564341104491757.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:15:14] [INFO ] Decomposing Gal with order
[2024-05-28 21:15:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:15:14] [INFO ] Removed a total of 91 redundant transitions.
[2024-05-28 21:15:14] [INFO ] Flatten gal took : 69 ms
[2024-05-28 21:15:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 82 labels/synchronizations in 28 ms.
[2024-05-28 21:15:14] [INFO ] Time to serialize gal into /tmp/LTL7541980141082251597.gal : 6 ms
[2024-05-28 21:15:14] [INFO ] Time to serialize properties into /tmp/LTL17582057418957493231.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7541980141082251597.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17582057418957493231.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((G("((i6.u0.s1<1)||(i7.u18.l1192<1))"))||(F(G("((i6.u0.s1<1)||(i0.u7.l149<1))"))))))
Formula 0 simplified : X(F!"((i6.u0.s1<1)||(i7.u18.l1192<1))" & GF!"((i6.u0.s1<1)||(i0.u7.l149<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17682138265017548492
[2024-05-28 21:15:29] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17682138265017548492
Running compilation step : cd /tmp/ltsmin17682138265017548492;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 269 ms.
Running link step : cd /tmp/ltsmin17682138265017548492;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin17682138265017548492;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([]((LTLAPp0==true))||<>([]((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-07 finished in 104756 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((!p0 U G(!p1)))))'
Support contains 3 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 259/259 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 127 transition count 158
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 127 transition count 158
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 127 transition count 157
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 40 place count 114 transition count 143
Iterating global reduction 1 with 13 rules applied. Total rules applied 53 place count 114 transition count 143
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 59 place count 114 transition count 137
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 67 place count 106 transition count 129
Iterating global reduction 2 with 8 rules applied. Total rules applied 75 place count 106 transition count 129
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 78 place count 106 transition count 126
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 82 place count 102 transition count 122
Iterating global reduction 3 with 4 rules applied. Total rules applied 86 place count 102 transition count 122
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 90 place count 98 transition count 117
Iterating global reduction 3 with 4 rules applied. Total rules applied 94 place count 98 transition count 117
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 97 place count 95 transition count 114
Iterating global reduction 3 with 3 rules applied. Total rules applied 100 place count 95 transition count 114
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 102 place count 95 transition count 112
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 104 place count 93 transition count 110
Iterating global reduction 4 with 2 rules applied. Total rules applied 106 place count 93 transition count 110
Applied a total of 106 rules in 19 ms. Remains 93 /140 variables (removed 47) and now considering 110/259 (removed 149) transitions.
// Phase 1: matrix 110 rows 93 cols
[2024-05-28 21:15:44] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 21:15:44] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-28 21:15:44] [INFO ] Invariant cache hit.
[2024-05-28 21:15:44] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-28 21:15:44] [INFO ] Implicit Places using invariants and state equation in 352 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
[2024-05-28 21:15:44] [INFO ] Invariant cache hit.
[2024-05-28 21:15:45] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 93/140 places, 110/259 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 608 ms. Remains : 93/140 places, 110/259 transitions.
Stuttering acceptance computed with spot in 355 ms :[p1, p1, p1, true, p1]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s88 1)), p0:(AND (GEQ s1 1) (GEQ s44 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 22264 reset in 177 ms.
Product exploration explored 100000 steps with 22372 reset in 165 ms.
Computed a total of 19 stabilizing places and 24 stable transitions
Graph (complete) has 299 edges and 93 vertex of which 92 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Computed a total of 19 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 93 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[p1, p1, p1, true, p1]
Incomplete random walk after 10000 steps, including 2227 resets, run finished after 427 ms. (steps per millisecond=23 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 472 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 483 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 470 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 471 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 475 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 483962 steps, run timeout after 3001 ms. (steps per millisecond=161 ) properties seen :{0=1, 1=1, 4=1}
Probabilistic random walk after 483962 steps, saw 215862 distinct states, run finished after 3001 ms. (steps per millisecond=161 ) properties seen :3
Running SMT prover for 2 properties.
[2024-05-28 21:15:50] [INFO ] Invariant cache hit.
[2024-05-28 21:15:50] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 21:15:50] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-28 21:15:50] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2024-05-28 21:15:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 21:15:50] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-28 21:15:50] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-28 21:15:50] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-28 21:15:50] [INFO ] After 29ms SMT Verify possible using 49 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2024-05-28 21:15:50] [INFO ] After 67ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2024-05-28 21:15:50] [INFO ] After 207ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 16 ms.
Support contains 3 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 110/110 transitions.
Graph (complete) has 265 edges and 93 vertex of which 92 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 92 transition count 108
Applied a total of 3 rules in 4 ms. Remains 92 /93 variables (removed 1) and now considering 108/110 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 92/93 places, 108/110 transitions.
Incomplete random walk after 10000 steps, including 2204 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 475 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2160505 steps, run timeout after 3001 ms. (steps per millisecond=719 ) properties seen :{}
Probabilistic random walk after 2160505 steps, saw 951975 distinct states, run finished after 3001 ms. (steps per millisecond=719 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 108 rows 92 cols
[2024-05-28 21:15:53] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 21:15:53] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 21:15:53] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 21:15:53] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 21:15:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 21:15:53] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 21:15:53] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 21:15:53] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-28 21:15:53] [INFO ] After 43ms SMT Verify possible using 47 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 21:15:53] [INFO ] After 83ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2024-05-28 21:15:53] [INFO ] After 294ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 30 ms.
Support contains 3 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 108/108 transitions.
Applied a total of 0 rules in 4 ms. Remains 92 /92 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 92/92 places, 108/108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 108/108 transitions.
Applied a total of 0 rules in 3 ms. Remains 92 /92 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2024-05-28 21:15:53] [INFO ] Invariant cache hit.
[2024-05-28 21:15:54] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-28 21:15:54] [INFO ] Invariant cache hit.
[2024-05-28 21:15:54] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-28 21:15:54] [INFO ] Implicit Places using invariants and state equation in 531 ms returned []
Implicit Place search using SMT with State Equation took 658 ms to find 0 implicit places.
[2024-05-28 21:15:54] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 21:15:54] [INFO ] Invariant cache hit.
[2024-05-28 21:15:54] [INFO ] Dead Transitions using invariants and state equation in 199 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 872 ms. Remains : 92/92 places, 108/108 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 92 transition count 102
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 87 transition count 102
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 11 place count 87 transition count 87
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 41 place count 72 transition count 87
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 55 place count 65 transition count 80
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 65 transition count 80
Applied a total of 57 rules in 14 ms. Remains 65 /92 variables (removed 27) and now considering 80/108 (removed 28) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 80 rows 65 cols
[2024-05-28 21:15:54] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 21:15:54] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-28 21:15:54] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-28 21:15:55] [INFO ] After 289ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 21:15:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 21:15:55] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 21:15:55] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 21:15:55] [INFO ] After 60ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2024-05-28 21:15:55] [INFO ] After 108ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 6 factoid took 269 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[p1, p1, p1, true, p1]
Stuttering acceptance computed with spot in 251 ms :[p1, p1, p1, true, p1]
Support contains 3 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 110/110 transitions.
Applied a total of 0 rules in 1 ms. Remains 93 /93 variables (removed 0) and now considering 110/110 (removed 0) transitions.
// Phase 1: matrix 110 rows 93 cols
[2024-05-28 21:15:55] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 21:15:56] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-28 21:15:56] [INFO ] Invariant cache hit.
[2024-05-28 21:15:56] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-28 21:15:56] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 530 ms to find 0 implicit places.
[2024-05-28 21:15:56] [INFO ] Invariant cache hit.
[2024-05-28 21:15:56] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 692 ms. Remains : 93/93 places, 110/110 transitions.
Computed a total of 19 stabilizing places and 24 stable transitions
Graph (complete) has 299 edges and 93 vertex of which 92 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 19 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 202 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[p1, p1, p1, true, p1]
Incomplete random walk after 10000 steps, including 2208 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 472 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 431 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 494 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 2095507 steps, run timeout after 3001 ms. (steps per millisecond=698 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 2095507 steps, saw 896383 distinct states, run finished after 3001 ms. (steps per millisecond=698 ) properties seen :2
Running SMT prover for 1 properties.
[2024-05-28 21:16:00] [INFO ] Invariant cache hit.
[2024-05-28 21:16:00] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 21:16:00] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-28 21:16:00] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 21:16:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 21:16:00] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-28 21:16:00] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 21:16:00] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-28 21:16:00] [INFO ] After 24ms SMT Verify possible using 49 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 21:16:00] [INFO ] After 44ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2024-05-28 21:16:00] [INFO ] After 189ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 110/110 transitions.
Graph (complete) has 265 edges and 93 vertex of which 92 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 92 transition count 108
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 91 transition count 100
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 91 transition count 100
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 90 transition count 99
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 90 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 90 transition count 98
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 89 transition count 97
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 89 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 89 transition count 96
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 12 place count 88 transition count 95
Iterating global reduction 3 with 1 rules applied. Total rules applied 13 place count 88 transition count 95
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 14 place count 87 transition count 94
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 87 transition count 94
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 16 place count 86 transition count 93
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 86 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 18 place count 86 transition count 92
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 19 place count 85 transition count 91
Iterating global reduction 4 with 1 rules applied. Total rules applied 20 place count 85 transition count 91
Applied a total of 20 rules in 12 ms. Remains 85 /93 variables (removed 8) and now considering 91/110 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 85/93 places, 91/110 transitions.
Incomplete random walk after 10000 steps, including 2201 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 481 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2307261 steps, run timeout after 3001 ms. (steps per millisecond=768 ) properties seen :{}
Probabilistic random walk after 2307261 steps, saw 1070017 distinct states, run finished after 3001 ms. (steps per millisecond=768 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 91 rows 85 cols
[2024-05-28 21:16:03] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 21:16:03] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 21:16:03] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-28 21:16:03] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 21:16:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 21:16:03] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 21:16:03] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 21:16:03] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-28 21:16:03] [INFO ] After 18ms SMT Verify possible using 35 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 21:16:03] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2024-05-28 21:16:03] [INFO ] After 154ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 91/91 transitions.
Applied a total of 0 rules in 3 ms. Remains 85 /85 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 85/85 places, 91/91 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 91/91 transitions.
Applied a total of 0 rules in 2 ms. Remains 85 /85 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2024-05-28 21:16:03] [INFO ] Invariant cache hit.
[2024-05-28 21:16:04] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-28 21:16:04] [INFO ] Invariant cache hit.
[2024-05-28 21:16:04] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-28 21:16:04] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
[2024-05-28 21:16:04] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 21:16:04] [INFO ] Invariant cache hit.
[2024-05-28 21:16:04] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 459 ms. Remains : 85/85 places, 91/91 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 85 transition count 85
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 80 transition count 85
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 11 place count 80 transition count 69
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 43 place count 64 transition count 69
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 51 place count 60 transition count 65
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 53 place count 60 transition count 65
Applied a total of 53 rules in 10 ms. Remains 60 /85 variables (removed 25) and now considering 65/91 (removed 26) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 65 rows 60 cols
[2024-05-28 21:16:04] [INFO ] Computed 5 invariants in 6 ms
[2024-05-28 21:16:04] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 21:16:04] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-28 21:16:04] [INFO ] After 199ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 21:16:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 21:16:04] [INFO ] [Nat]Absence check using 3 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-28 21:16:04] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 21:16:04] [INFO ] After 67ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2024-05-28 21:16:04] [INFO ] After 182ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 4 factoid took 264 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 282 ms :[p1, p1, p1, true, p1]
Stuttering acceptance computed with spot in 261 ms :[p1, p1, p1, true, p1]
Stuttering acceptance computed with spot in 244 ms :[p1, p1, p1, true, p1]
Product exploration explored 100000 steps with 22352 reset in 244 ms.
Product exploration explored 100000 steps with 22314 reset in 263 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 222 ms :[p1, p1, p1, true, p1]
Support contains 3 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 110/110 transitions.
Applied a total of 0 rules in 10 ms. Remains 93 /93 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2024-05-28 21:16:06] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 110 rows 93 cols
[2024-05-28 21:16:06] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 21:16:07] [INFO ] Dead Transitions using invariants and state equation in 233 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 259 ms. Remains : 93/93 places, 110/110 transitions.
Built C files in :
/tmp/ltsmin13872323928969875339
[2024-05-28 21:16:07] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13872323928969875339
Running compilation step : cd /tmp/ltsmin13872323928969875339;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 474 ms.
Running link step : cd /tmp/ltsmin13872323928969875339;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin13872323928969875339;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased590951592890617217.hoa' '--buchi-type=spotba'
LTSmin run took 522 ms.
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-09 finished in 23634 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(p1)&&p0) U G(p2))))'
Support contains 4 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 259/259 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 127 transition count 166
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 127 transition count 166
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 127 transition count 164
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 41 place count 114 transition count 149
Iterating global reduction 1 with 13 rules applied. Total rules applied 54 place count 114 transition count 149
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 59 place count 114 transition count 144
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 67 place count 106 transition count 136
Iterating global reduction 2 with 8 rules applied. Total rules applied 75 place count 106 transition count 136
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 78 place count 106 transition count 133
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 83 place count 101 transition count 128
Iterating global reduction 3 with 5 rules applied. Total rules applied 88 place count 101 transition count 128
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 92 place count 97 transition count 124
Iterating global reduction 3 with 4 rules applied. Total rules applied 96 place count 97 transition count 124
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 99 place count 94 transition count 121
Iterating global reduction 3 with 3 rules applied. Total rules applied 102 place count 94 transition count 121
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 105 place count 94 transition count 118
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 107 place count 92 transition count 115
Iterating global reduction 4 with 2 rules applied. Total rules applied 109 place count 92 transition count 115
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 110 place count 91 transition count 114
Iterating global reduction 4 with 1 rules applied. Total rules applied 111 place count 91 transition count 114
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 112 place count 90 transition count 113
Iterating global reduction 4 with 1 rules applied. Total rules applied 113 place count 90 transition count 113
Applied a total of 113 rules in 22 ms. Remains 90 /140 variables (removed 50) and now considering 113/259 (removed 146) transitions.
// Phase 1: matrix 113 rows 90 cols
[2024-05-28 21:16:08] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 21:16:08] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-28 21:16:08] [INFO ] Invariant cache hit.
[2024-05-28 21:16:08] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-28 21:16:08] [INFO ] Implicit Places using invariants and state equation in 578 ms returned []
Implicit Place search using SMT with State Equation took 694 ms to find 0 implicit places.
[2024-05-28 21:16:08] [INFO ] Invariant cache hit.
[2024-05-28 21:16:08] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 90/140 places, 113/259 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 859 ms. Remains : 90/140 places, 113/259 transitions.
Stuttering acceptance computed with spot in 209 ms :[(NOT p2), (NOT p2), true, (OR (AND (NOT p1) p2) (AND p0 (NOT p1))), (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p2 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND p2 p0), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(OR (AND p2 (NOT p1)) (AND p0 (NOT p1))), acceptance={} source=3 dest: 2}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=5 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s84 1)), p0:(AND (GEQ s1 1) (GEQ s84 1)), p1:(AND (GEQ s1 1) (GEQ s85 1) (GEQ s1 1) (GEQ s62 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-10 finished in 1096 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F((p0||G(!p1)))||(p2 U p3)))))'
Support contains 5 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 259/259 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 129 transition count 176
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 129 transition count 176
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 129 transition count 175
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 34 place count 118 transition count 163
Iterating global reduction 1 with 11 rules applied. Total rules applied 45 place count 118 transition count 163
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 50 place count 118 transition count 158
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 57 place count 111 transition count 151
Iterating global reduction 2 with 7 rules applied. Total rules applied 64 place count 111 transition count 151
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 66 place count 111 transition count 149
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 69 place count 108 transition count 146
Iterating global reduction 3 with 3 rules applied. Total rules applied 72 place count 108 transition count 146
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 75 place count 105 transition count 142
Iterating global reduction 3 with 3 rules applied. Total rules applied 78 place count 105 transition count 142
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 80 place count 103 transition count 140
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 103 transition count 140
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 83 place count 102 transition count 139
Iterating global reduction 3 with 1 rules applied. Total rules applied 84 place count 102 transition count 139
Applied a total of 84 rules in 20 ms. Remains 102 /140 variables (removed 38) and now considering 139/259 (removed 120) transitions.
// Phase 1: matrix 139 rows 102 cols
[2024-05-28 21:16:09] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 21:16:09] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-28 21:16:09] [INFO ] Invariant cache hit.
[2024-05-28 21:16:09] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 21:16:10] [INFO ] Implicit Places using invariants and state equation in 695 ms returned []
Implicit Place search using SMT with State Equation took 818 ms to find 0 implicit places.
[2024-05-28 21:16:10] [INFO ] Invariant cache hit.
[2024-05-28 21:16:10] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 102/140 places, 139/259 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1040 ms. Remains : 102/140 places, 139/259 transitions.
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p3))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s97 1)), p3:(AND (GEQ s1 1) (GEQ s96 1)), p2:(AND (GEQ s1 1) (GEQ s47 1)), p1:(AND (GEQ s1 1) (GEQ s95 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 22371 reset in 180 ms.
Product exploration explored 100000 steps with 22313 reset in 285 ms.
Computed a total of 19 stabilizing places and 26 stable transitions
Graph (complete) has 343 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 19 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p1 (NOT p3) p2))), (X (AND (NOT p0) (NOT p3) (NOT p2))), true, (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p3) (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 157 ms. Reduced automaton from 4 states, 9 edges and 4 AP (stutter sensitive) to 12 states, 34 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 824 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p3)), false, false, false, false, false, false, false, false]
Incomplete random walk after 10000 steps, including 2288 resets, run finished after 298 ms. (steps per millisecond=33 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 480 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 491 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 461 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 468 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 484 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 496 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 471 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 466 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 473 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 477 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 485 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 507 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 470 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 13) seen :0
Interrupted probabilistic random walk after 352466 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :{0=1, 8=1, 10=1, 12=1}
Probabilistic random walk after 352466 steps, saw 157835 distinct states, run finished after 3001 ms. (steps per millisecond=117 ) properties seen :4
Running SMT prover for 9 properties.
[2024-05-28 21:16:16] [INFO ] Invariant cache hit.
[2024-05-28 21:16:16] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 21:16:16] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-28 21:16:16] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:8
[2024-05-28 21:16:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 21:16:16] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-28 21:16:16] [INFO ] After 117ms SMT Verify possible using state equation in natural domain returned unsat :8 sat :1
[2024-05-28 21:16:16] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 21:16:16] [INFO ] After 29ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :8 sat :1
[2024-05-28 21:16:16] [INFO ] After 62ms SMT Verify possible using trap constraints in natural domain returned unsat :8 sat :1
Attempting to minimize the solution found.
Minimization took 114 ms.
[2024-05-28 21:16:17] [INFO ] After 398ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :1
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 139/139 transitions.
Graph (complete) has 305 edges and 102 vertex of which 101 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 101 transition count 137
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 99 transition count 127
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 99 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 99 transition count 126
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 97 transition count 123
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 97 transition count 123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 97 transition count 122
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 15 place count 95 transition count 120
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 95 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 18 place count 95 transition count 119
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 20 place count 93 transition count 117
Iterating global reduction 4 with 2 rules applied. Total rules applied 22 place count 93 transition count 117
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 24 place count 91 transition count 115
Iterating global reduction 4 with 2 rules applied. Total rules applied 26 place count 91 transition count 115
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 28 place count 89 transition count 113
Iterating global reduction 4 with 2 rules applied. Total rules applied 30 place count 89 transition count 113
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 33 place count 89 transition count 110
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 35 place count 87 transition count 107
Iterating global reduction 5 with 2 rules applied. Total rules applied 37 place count 87 transition count 107
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 38 place count 86 transition count 106
Iterating global reduction 5 with 1 rules applied. Total rules applied 39 place count 86 transition count 106
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 40 place count 85 transition count 105
Iterating global reduction 5 with 1 rules applied. Total rules applied 41 place count 85 transition count 105
Applied a total of 41 rules in 35 ms. Remains 85 /102 variables (removed 17) and now considering 105/139 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 85/102 places, 105/139 transitions.
Incomplete random walk after 10000 steps, including 2249 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 487 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2129772 steps, run timeout after 3001 ms. (steps per millisecond=709 ) properties seen :{}
Probabilistic random walk after 2129772 steps, saw 922128 distinct states, run finished after 3001 ms. (steps per millisecond=709 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 105 rows 85 cols
[2024-05-28 21:16:20] [INFO ] Computed 4 invariants in 8 ms
[2024-05-28 21:16:20] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 21:16:20] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 21:16:20] [INFO ] After 158ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 21:16:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 21:16:20] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-28 21:16:20] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 21:16:20] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-28 21:16:20] [INFO ] After 42ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 21:16:20] [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 28 ms.
[2024-05-28 21:16:20] [INFO ] After 281ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 29 ms.
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 105/105 transitions.
Applied a total of 0 rules in 4 ms. Remains 85 /85 variables (removed 0) and now considering 105/105 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 85/85 places, 105/105 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 105/105 transitions.
Applied a total of 0 rules in 4 ms. Remains 85 /85 variables (removed 0) and now considering 105/105 (removed 0) transitions.
[2024-05-28 21:16:20] [INFO ] Invariant cache hit.
[2024-05-28 21:16:21] [INFO ] Implicit Places using invariants in 752 ms returned []
[2024-05-28 21:16:21] [INFO ] Invariant cache hit.
[2024-05-28 21:16:21] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-28 21:16:21] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 995 ms to find 0 implicit places.
[2024-05-28 21:16:21] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-28 21:16:21] [INFO ] Invariant cache hit.
[2024-05-28 21:16:21] [INFO ] Dead Transitions using invariants and state equation in 213 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1238 ms. Remains : 85/85 places, 105/105 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 85 transition count 99
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 80 transition count 99
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 11 place count 80 transition count 86
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 37 place count 67 transition count 86
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 51 place count 60 transition count 79
Applied a total of 51 rules in 11 ms. Remains 60 /85 variables (removed 25) and now considering 79/105 (removed 26) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 79 rows 60 cols
[2024-05-28 21:16:21] [INFO ] Computed 4 invariants in 0 ms
[2024-05-28 21:16:21] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 21:16:21] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 21:16:22] [INFO ] After 213ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 21:16:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 21:16:22] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 7 ms returned sat
[2024-05-28 21:16:22] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 21:16:22] [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 22 ms.
[2024-05-28 21:16:22] [INFO ] After 227ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 8 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p1 (NOT p3) p2))), (X (AND (NOT p0) (NOT p3) (NOT p2))), true, (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (G (NOT (AND p0 p1 p2 p3))), (G (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (G (NOT (AND p0 p1 (NOT p2) (NOT p3)))), (G (NOT (AND p0 (NOT p1) p2 p3))), (G (NOT (AND p0 p1 p2 (NOT p3)))), (G (NOT (AND p0 p1 (NOT p2) p3))), (G (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (G (NOT (AND p0 (NOT p1) (NOT p2) p3)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (F (AND (NOT p0) (NOT p1) p2 (NOT p3))), (F (AND p0 (NOT p1) (NOT p2) (NOT p3))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 17 factoid took 481 ms. Reduced automaton from 12 states, 34 edges and 4 AP (stutter insensitive) to 7 states, 18 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 439 ms :[p1, (AND (NOT p0) (NOT p2) (NOT p3) p1), p1, false, false, false, false]
Stuttering acceptance computed with spot in 527 ms :[p1, (AND (NOT p0) (NOT p2) (NOT p3) p1), p1, false, false, false, false]
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 139/139 transitions.
Applied a total of 0 rules in 6 ms. Remains 102 /102 variables (removed 0) and now considering 139/139 (removed 0) transitions.
// Phase 1: matrix 139 rows 102 cols
[2024-05-28 21:16:23] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 21:16:24] [INFO ] Implicit Places using invariants in 320 ms returned []
[2024-05-28 21:16:24] [INFO ] Invariant cache hit.
[2024-05-28 21:16:24] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 21:16:24] [INFO ] Implicit Places using invariants and state equation in 796 ms returned []
Implicit Place search using SMT with State Equation took 1142 ms to find 0 implicit places.
[2024-05-28 21:16:24] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 21:16:24] [INFO ] Invariant cache hit.
[2024-05-28 21:16:25] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1352 ms. Remains : 102/102 places, 139/139 transitions.
Computed a total of 19 stabilizing places and 26 stable transitions
Graph (complete) has 343 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 19 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (AND (NOT p0) (NOT p2) (NOT p3))), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p2) p3))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1) p2 p3))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT p1)), true, (X (X (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) p3)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) p2 p3)))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 211 ms. Reduced automaton from 7 states, 18 edges and 4 AP (stutter insensitive) to 7 states, 18 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 321 ms :[p1, (AND (NOT p0) (NOT p2) (NOT p3) p1), p1, false, false, false, false]
Incomplete random walk after 10000 steps, including 2234 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 480 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 486 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 448 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 483 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 476 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 500 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 460 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 444509 steps, run timeout after 3001 ms. (steps per millisecond=148 ) properties seen :{0=1, 4=1, 5=1}
Probabilistic random walk after 444509 steps, saw 198604 distinct states, run finished after 3001 ms. (steps per millisecond=148 ) properties seen :3
Running SMT prover for 4 properties.
[2024-05-28 21:16:29] [INFO ] Invariant cache hit.
[2024-05-28 21:16:29] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 21:16:29] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-28 21:16:29] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-28 21:16:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 21:16:29] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-28 21:16:29] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :1
[2024-05-28 21:16:29] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 21:16:29] [INFO ] After 31ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :3 sat :1
[2024-05-28 21:16:29] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-05-28 21:16:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2024-05-28 21:16:29] [INFO ] After 104ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2024-05-28 21:16:29] [INFO ] After 280ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :1
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 139/139 transitions.
Graph (complete) has 305 edges and 102 vertex of which 101 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 101 transition count 137
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 6 place count 98 transition count 118
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 98 transition count 118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 98 transition count 117
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 13 place count 95 transition count 113
Iterating global reduction 2 with 3 rules applied. Total rules applied 16 place count 95 transition count 113
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 95 transition count 112
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 19 place count 93 transition count 110
Iterating global reduction 3 with 2 rules applied. Total rules applied 21 place count 93 transition count 110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 22 place count 93 transition count 109
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 24 place count 91 transition count 107
Iterating global reduction 4 with 2 rules applied. Total rules applied 26 place count 91 transition count 107
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 28 place count 89 transition count 105
Iterating global reduction 4 with 2 rules applied. Total rules applied 30 place count 89 transition count 105
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 32 place count 87 transition count 103
Iterating global reduction 4 with 2 rules applied. Total rules applied 34 place count 87 transition count 103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 36 place count 87 transition count 101
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 38 place count 85 transition count 98
Iterating global reduction 5 with 2 rules applied. Total rules applied 40 place count 85 transition count 98
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 41 place count 84 transition count 97
Iterating global reduction 5 with 1 rules applied. Total rules applied 42 place count 84 transition count 97
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 43 place count 83 transition count 96
Iterating global reduction 5 with 1 rules applied. Total rules applied 44 place count 83 transition count 96
Applied a total of 44 rules in 17 ms. Remains 83 /102 variables (removed 19) and now considering 96/139 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 83/102 places, 96/139 transitions.
Incomplete random walk after 10000 steps, including 2224 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 440 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 122993 steps, run visited all 1 properties in 189 ms. (steps per millisecond=650 )
Probabilistic random walk after 122993 steps, saw 54256 distinct states, run finished after 190 ms. (steps per millisecond=647 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (AND (NOT p0) (NOT p2) (NOT p3))), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p2) p3))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1) p2 p3))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT p1)), true, (X (X (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) p3)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) p2 p3)))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT p1))), (G (NOT (AND p0 (NOT p1) p2 p3))), (G (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (G (NOT (AND p0 (NOT p1) (NOT p2) p3)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1) (NOT p2) (NOT p3)))]
Knowledge based reduction with 19 factoid took 300 ms. Reduced automaton from 7 states, 18 edges and 4 AP (stutter insensitive) to 7 states, 18 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 411 ms :[p1, (AND (NOT p0) (NOT p2) (NOT p3) p1), p1, false, false, false, false]
Stuttering acceptance computed with spot in 397 ms :[p1, (AND (NOT p0) (NOT p2) (NOT p3) p1), p1, false, false, false, false]
Stuttering acceptance computed with spot in 386 ms :[p1, (AND (NOT p0) (NOT p2) (NOT p3) p1), p1, false, false, false, false]
Product exploration explored 100000 steps with 22423 reset in 297 ms.
Product exploration explored 100000 steps with 22406 reset in 325 ms.
Built C files in :
/tmp/ltsmin13459528841874465427
[2024-05-28 21:16:32] [INFO ] Computing symmetric may disable matrix : 139 transitions.
[2024-05-28 21:16:32] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:16:32] [INFO ] Computing symmetric may enable matrix : 139 transitions.
[2024-05-28 21:16:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:16:32] [INFO ] Computing Do-Not-Accords matrix : 139 transitions.
[2024-05-28 21:16:32] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:16:32] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13459528841874465427
Running compilation step : cd /tmp/ltsmin13459528841874465427;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 647 ms.
Running link step : cd /tmp/ltsmin13459528841874465427;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin13459528841874465427;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1391121429361773660.hoa' '--buchi-type=spotba'
LTSmin run took 13469 ms.
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-11 finished in 37112 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(!p0))'
Support contains 2 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 259/259 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 126 transition count 157
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 126 transition count 157
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 126 transition count 155
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 44 place count 112 transition count 139
Iterating global reduction 1 with 14 rules applied. Total rules applied 58 place count 112 transition count 139
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 64 place count 112 transition count 133
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 73 place count 103 transition count 124
Iterating global reduction 2 with 9 rules applied. Total rules applied 82 place count 103 transition count 124
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 85 place count 103 transition count 121
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 90 place count 98 transition count 116
Iterating global reduction 3 with 5 rules applied. Total rules applied 95 place count 98 transition count 116
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 100 place count 93 transition count 110
Iterating global reduction 3 with 5 rules applied. Total rules applied 105 place count 93 transition count 110
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 109 place count 89 transition count 106
Iterating global reduction 3 with 4 rules applied. Total rules applied 113 place count 89 transition count 106
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 115 place count 89 transition count 104
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 118 place count 86 transition count 100
Iterating global reduction 4 with 3 rules applied. Total rules applied 121 place count 86 transition count 100
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 122 place count 85 transition count 99
Iterating global reduction 4 with 1 rules applied. Total rules applied 123 place count 85 transition count 99
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 124 place count 84 transition count 98
Iterating global reduction 4 with 1 rules applied. Total rules applied 125 place count 84 transition count 98
Applied a total of 125 rules in 10 ms. Remains 84 /140 variables (removed 56) and now considering 98/259 (removed 161) transitions.
// Phase 1: matrix 98 rows 84 cols
[2024-05-28 21:16:46] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 21:16:46] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-28 21:16:46] [INFO ] Invariant cache hit.
[2024-05-28 21:16:46] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-28 21:16:46] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
[2024-05-28 21:16:46] [INFO ] Invariant cache hit.
[2024-05-28 21:16:46] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 84/140 places, 98/259 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 393 ms. Remains : 84/140 places, 98/259 transitions.
Stuttering acceptance computed with spot in 118 ms :[p0, p0, true]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s79 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 344 ms.
Product exploration explored 100000 steps with 50000 reset in 352 ms.
Computed a total of 13 stabilizing places and 17 stable transitions
Graph (complete) has 269 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 17 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-13 finished in 1250 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((G(p0)&&X(p1)))))))'
Support contains 3 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 259/259 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 127 transition count 166
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 127 transition count 166
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 127 transition count 164
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 41 place count 114 transition count 149
Iterating global reduction 1 with 13 rules applied. Total rules applied 54 place count 114 transition count 149
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 59 place count 114 transition count 144
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 67 place count 106 transition count 136
Iterating global reduction 2 with 8 rules applied. Total rules applied 75 place count 106 transition count 136
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 77 place count 106 transition count 134
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 81 place count 102 transition count 130
Iterating global reduction 3 with 4 rules applied. Total rules applied 85 place count 102 transition count 130
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 89 place count 98 transition count 125
Iterating global reduction 3 with 4 rules applied. Total rules applied 93 place count 98 transition count 125
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 96 place count 95 transition count 122
Iterating global reduction 3 with 3 rules applied. Total rules applied 99 place count 95 transition count 122
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 101 place count 93 transition count 119
Iterating global reduction 3 with 2 rules applied. Total rules applied 103 place count 93 transition count 119
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 104 place count 92 transition count 118
Iterating global reduction 3 with 1 rules applied. Total rules applied 105 place count 92 transition count 118
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 106 place count 91 transition count 117
Iterating global reduction 3 with 1 rules applied. Total rules applied 107 place count 91 transition count 117
Applied a total of 107 rules in 14 ms. Remains 91 /140 variables (removed 49) and now considering 117/259 (removed 142) transitions.
// Phase 1: matrix 117 rows 91 cols
[2024-05-28 21:16:47] [INFO ] Computed 5 invariants in 18 ms
[2024-05-28 21:16:47] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-05-28 21:16:47] [INFO ] Invariant cache hit.
[2024-05-28 21:16:47] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-28 21:16:48] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 530 ms to find 0 implicit places.
[2024-05-28 21:16:48] [INFO ] Invariant cache hit.
[2024-05-28 21:16:48] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 91/140 places, 117/259 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 636 ms. Remains : 91/140 places, 117/259 transitions.
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 4}, { cond=p0, acceptance={0} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s86 1)), p1:(OR (LT s1 1) (LT s85 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 24384 reset in 204 ms.
Product exploration explored 100000 steps with 24389 reset in 258 ms.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 300 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2242 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 485 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 464 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 489 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1886406 steps, run timeout after 3001 ms. (steps per millisecond=628 ) properties seen :{0=1, 2=1}
Probabilistic random walk after 1886406 steps, saw 854292 distinct states, run finished after 3005 ms. (steps per millisecond=627 ) properties seen :2
Running SMT prover for 1 properties.
[2024-05-28 21:16:52] [INFO ] Invariant cache hit.
[2024-05-28 21:16:52] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 21:16:52] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-28 21:16:52] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), true, (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 184 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 258 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 269 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 117/117 transitions.
Applied a total of 0 rules in 1 ms. Remains 91 /91 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2024-05-28 21:16:53] [INFO ] Invariant cache hit.
[2024-05-28 21:16:53] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-28 21:16:53] [INFO ] Invariant cache hit.
[2024-05-28 21:16:53] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-28 21:16:53] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
[2024-05-28 21:16:53] [INFO ] Invariant cache hit.
[2024-05-28 21:16:54] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 563 ms. Remains : 91/91 places, 117/117 transitions.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 300 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 112 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 303 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2229 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 469 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 495 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 2) seen :0
Finished probabilistic random walk after 9773 steps, run visited all 2 properties in 60 ms. (steps per millisecond=162 )
Probabilistic random walk after 9773 steps, saw 4562 distinct states, run finished after 61 ms. (steps per millisecond=160 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 168 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 281 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 350 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 327 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 24257 reset in 201 ms.
Product exploration explored 100000 steps with 24339 reset in 275 ms.
Built C files in :
/tmp/ltsmin3656066055749838637
[2024-05-28 21:16:56] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3656066055749838637
Running compilation step : cd /tmp/ltsmin3656066055749838637;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 327 ms.
Running link step : cd /tmp/ltsmin3656066055749838637;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin3656066055749838637;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11813891766231872642.hoa' '--buchi-type=spotba'
LTSmin run took 208 ms.
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-14 finished in 9767 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(G(p1)))))'
Found a Lengthening insensitive property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-07
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 140 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 140/140 places, 259/259 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 126 transition count 157
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 126 transition count 157
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 126 transition count 155
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 44 place count 112 transition count 139
Iterating global reduction 1 with 14 rules applied. Total rules applied 58 place count 112 transition count 139
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 64 place count 112 transition count 133
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 73 place count 103 transition count 124
Iterating global reduction 2 with 9 rules applied. Total rules applied 82 place count 103 transition count 124
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 85 place count 103 transition count 121
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 90 place count 98 transition count 116
Iterating global reduction 3 with 5 rules applied. Total rules applied 95 place count 98 transition count 116
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 100 place count 93 transition count 110
Iterating global reduction 3 with 5 rules applied. Total rules applied 105 place count 93 transition count 110
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 109 place count 89 transition count 106
Iterating global reduction 3 with 4 rules applied. Total rules applied 113 place count 89 transition count 106
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 115 place count 89 transition count 104
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 118 place count 86 transition count 100
Iterating global reduction 4 with 3 rules applied. Total rules applied 121 place count 86 transition count 100
Applied a total of 121 rules in 17 ms. Remains 86 /140 variables (removed 54) and now considering 100/259 (removed 159) transitions.
// Phase 1: matrix 100 rows 86 cols
[2024-05-28 21:16:57] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 21:16:57] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-28 21:16:57] [INFO ] Invariant cache hit.
[2024-05-28 21:16:57] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-28 21:16:57] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
[2024-05-28 21:16:57] [INFO ] Invariant cache hit.
[2024-05-28 21:16:57] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 86/140 places, 100/259 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 364 ms. Remains : 86/140 places, 100/259 transitions.
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(OR (LT s1 1) (LT s81 1)), p1:(OR (LT s1 1) (LT s41 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 22483 reset in 127 ms.
Product exploration explored 100000 steps with 22512 reset in 140 ms.
Computed a total of 15 stabilizing places and 19 stable transitions
Graph (complete) has 275 edges and 86 vertex of which 85 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 15 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 108 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2246 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 477 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-28 21:16:58] [INFO ] Invariant cache hit.
[2024-05-28 21:16:58] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 21:16:58] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-28 21:16:58] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 21:16:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 21:16:58] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-28 21:16:58] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 21:16:58] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-28 21:16:58] [INFO ] After 28ms SMT Verify possible using 45 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 21:16:58] [INFO ] After 58ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2024-05-28 21:16:58] [INFO ] After 248ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 100/100 transitions.
Graph (complete) has 243 edges and 86 vertex of which 85 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 85 transition count 98
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 84 transition count 97
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 84 transition count 97
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 83 transition count 96
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 83 transition count 96
Applied a total of 7 rules in 6 ms. Remains 83 /86 variables (removed 3) and now considering 96/100 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 83/86 places, 96/100 transitions.
Incomplete random walk after 10000 steps, including 2254 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 501 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2168361 steps, run timeout after 3001 ms. (steps per millisecond=722 ) properties seen :{}
Probabilistic random walk after 2168361 steps, saw 909439 distinct states, run finished after 3001 ms. (steps per millisecond=722 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 96 rows 83 cols
[2024-05-28 21:17:02] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 21:17:02] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 21:17:02] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 21:17:02] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 21:17:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 21:17:02] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 21:17:02] [INFO ] After 75ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 21:17:02] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-28 21:17:02] [INFO ] After 34ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 21:17:02] [INFO ] After 59ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2024-05-28 21:17:02] [INFO ] After 240ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 96/96 transitions.
Applied a total of 0 rules in 10 ms. Remains 83 /83 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 83/83 places, 96/96 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 83 /83 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-28 21:17:02] [INFO ] Invariant cache hit.
[2024-05-28 21:17:02] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-28 21:17:02] [INFO ] Invariant cache hit.
[2024-05-28 21:17:02] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-28 21:17:02] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
[2024-05-28 21:17:02] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 21:17:02] [INFO ] Invariant cache hit.
[2024-05-28 21:17:02] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 538 ms. Remains : 83/83 places, 96/96 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 83 transition count 90
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 78 transition count 90
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 11 place count 78 transition count 77
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 37 place count 65 transition count 77
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 51 place count 58 transition count 70
Applied a total of 51 rules in 11 ms. Remains 58 /83 variables (removed 25) and now considering 70/96 (removed 26) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 70 rows 58 cols
[2024-05-28 21:17:02] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 21:17:03] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 21:17:03] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 34 ms returned sat
[2024-05-28 21:17:03] [INFO ] After 304ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 21:17:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 21:17:03] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 21:17:03] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 21:17:03] [INFO ] After 76ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2024-05-28 21:17:03] [INFO ] After 145ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 154 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 86 /86 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 86 cols
[2024-05-28 21:17:03] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 21:17:03] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-05-28 21:17:04] [INFO ] Invariant cache hit.
[2024-05-28 21:17:04] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-28 21:17:04] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 584 ms to find 0 implicit places.
[2024-05-28 21:17:04] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 21:17:04] [INFO ] Invariant cache hit.
[2024-05-28 21:17:04] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 749 ms. Remains : 86/86 places, 100/100 transitions.
Computed a total of 15 stabilizing places and 19 stable transitions
Graph (complete) has 275 edges and 86 vertex of which 85 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 15 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 129 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2267 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 497 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-28 21:17:04] [INFO ] Invariant cache hit.
[2024-05-28 21:17:04] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 21:17:04] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-28 21:17:04] [INFO ] After 153ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 21:17:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 21:17:05] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-28 21:17:05] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 21:17:05] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-28 21:17:05] [INFO ] After 35ms SMT Verify possible using 45 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 21:17:05] [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 23 ms.
[2024-05-28 21:17:05] [INFO ] After 272ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 100/100 transitions.
Graph (complete) has 243 edges and 86 vertex of which 85 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 85 transition count 98
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 84 transition count 97
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 84 transition count 97
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 83 transition count 96
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 83 transition count 96
Applied a total of 7 rules in 8 ms. Remains 83 /86 variables (removed 3) and now considering 96/100 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 83/86 places, 96/100 transitions.
Incomplete random walk after 10000 steps, including 2246 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 462 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2160787 steps, run timeout after 3001 ms. (steps per millisecond=720 ) properties seen :{}
Probabilistic random walk after 2160787 steps, saw 906266 distinct states, run finished after 3001 ms. (steps per millisecond=720 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 96 rows 83 cols
[2024-05-28 21:17:08] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 21:17:08] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 21:17:08] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 21:17:08] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 21:17:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-28 21:17:08] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 21:17:08] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 21:17:08] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-28 21:17:08] [INFO ] After 23ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 21:17:08] [INFO ] After 41ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-28 21:17:08] [INFO ] After 161ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 83 /83 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 83/83 places, 96/96 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 96/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 83 /83 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-28 21:17:08] [INFO ] Invariant cache hit.
[2024-05-28 21:17:08] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-28 21:17:08] [INFO ] Invariant cache hit.
[2024-05-28 21:17:08] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-28 21:17:08] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
[2024-05-28 21:17:08] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 21:17:08] [INFO ] Invariant cache hit.
[2024-05-28 21:17:09] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 511 ms. Remains : 83/83 places, 96/96 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 83 transition count 90
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 78 transition count 90
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 11 place count 78 transition count 77
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 37 place count 65 transition count 77
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 51 place count 58 transition count 70
Applied a total of 51 rules in 8 ms. Remains 58 /83 variables (removed 25) and now considering 70/96 (removed 26) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 70 rows 58 cols
[2024-05-28 21:17:09] [INFO ] Computed 4 invariants in 0 ms
[2024-05-28 21:17:09] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 21:17:09] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 21:17:09] [INFO ] After 216ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 21:17:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 21:17:09] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-28 21:17:09] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 21:17:09] [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 14 ms.
[2024-05-28 21:17:09] [INFO ] After 162ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 149 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 22413 reset in 213 ms.
Product exploration explored 100000 steps with 22329 reset in 233 ms.
Built C files in :
/tmp/ltsmin3536697215842252414
[2024-05-28 21:17:10] [INFO ] Computing symmetric may disable matrix : 100 transitions.
[2024-05-28 21:17:10] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:17:10] [INFO ] Computing symmetric may enable matrix : 100 transitions.
[2024-05-28 21:17:10] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:17:10] [INFO ] Computing Do-Not-Accords matrix : 100 transitions.
[2024-05-28 21:17:10] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:17:10] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3536697215842252414
Running compilation step : cd /tmp/ltsmin3536697215842252414;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 490 ms.
Running link step : cd /tmp/ltsmin3536697215842252414;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin3536697215842252414;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16609850748676443218.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 100/100 transitions.
Applied a total of 0 rules in 5 ms. Remains 86 /86 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 86 cols
[2024-05-28 21:17:25] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 21:17:25] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-28 21:17:25] [INFO ] Invariant cache hit.
[2024-05-28 21:17:25] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-28 21:17:25] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
[2024-05-28 21:17:25] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 21:17:25] [INFO ] Invariant cache hit.
[2024-05-28 21:17:26] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 552 ms. Remains : 86/86 places, 100/100 transitions.
Built C files in :
/tmp/ltsmin14834348192471097003
[2024-05-28 21:17:26] [INFO ] Computing symmetric may disable matrix : 100 transitions.
[2024-05-28 21:17:26] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:17:26] [INFO ] Computing symmetric may enable matrix : 100 transitions.
[2024-05-28 21:17:26] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:17:26] [INFO ] Computing Do-Not-Accords matrix : 100 transitions.
[2024-05-28 21:17:26] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:17:26] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14834348192471097003
Running compilation step : cd /tmp/ltsmin14834348192471097003;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 367 ms.
Running link step : cd /tmp/ltsmin14834348192471097003;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin14834348192471097003;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11517168344559834496.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 21:17:41] [INFO ] Flatten gal took : 16 ms
[2024-05-28 21:17:41] [INFO ] Flatten gal took : 20 ms
[2024-05-28 21:17:41] [INFO ] Time to serialize gal into /tmp/LTL5719224525292217540.gal : 2 ms
[2024-05-28 21:17:41] [INFO ] Time to serialize properties into /tmp/LTL8997388649384647949.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5719224525292217540.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15752326924367613939.hoa' '-atoms' '/tmp/LTL8997388649384647949.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL8997388649384647949.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15752326924367613939.hoa
Detected timeout of ITS tools.
[2024-05-28 21:17:56] [INFO ] Flatten gal took : 7 ms
[2024-05-28 21:17:56] [INFO ] Flatten gal took : 8 ms
[2024-05-28 21:17:56] [INFO ] Time to serialize gal into /tmp/LTL3406231612859393060.gal : 3 ms
[2024-05-28 21:17:56] [INFO ] Time to serialize properties into /tmp/LTL4873816140170552982.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3406231612859393060.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4873816140170552982.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X((G("((s1<1)||(l1192<1))"))||(F(G("((s1<1)||(l149<1))"))))))
Formula 0 simplified : X(F!"((s1<1)||(l1192<1))" & GF!"((s1<1)||(l149<1))")
Detected timeout of ITS tools.
[2024-05-28 21:18:11] [INFO ] Flatten gal took : 8 ms
[2024-05-28 21:18:11] [INFO ] Applying decomposition
[2024-05-28 21:18:11] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph12541827360159984201.txt' '-o' '/tmp/graph12541827360159984201.bin' '-w' '/tmp/graph12541827360159984201.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12541827360159984201.bin' '-l' '-1' '-v' '-w' '/tmp/graph12541827360159984201.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:18:11] [INFO ] Decomposing Gal with order
[2024-05-28 21:18:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:18:11] [INFO ] Removed a total of 87 redundant transitions.
[2024-05-28 21:18:11] [INFO ] Flatten gal took : 17 ms
[2024-05-28 21:18:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 78 labels/synchronizations in 5 ms.
[2024-05-28 21:18:11] [INFO ] Time to serialize gal into /tmp/LTL12804097650375150175.gal : 3 ms
[2024-05-28 21:18:11] [INFO ] Time to serialize properties into /tmp/LTL8025140484093901020.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12804097650375150175.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8025140484093901020.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((G("((i0.u0.s1<1)||(i7.u17.l1192<1))"))||(F(G("((i0.u0.s1<1)||(i4.u7.l149<1))"))))))
Formula 0 simplified : X(F!"((i0.u0.s1<1)||(i7.u17.l1192<1))" & GF!"((i0.u0.s1<1)||(i4.u7.l149<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16539974879479661056
[2024-05-28 21:18:26] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16539974879479661056
Running compilation step : cd /tmp/ltsmin16539974879479661056;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 266 ms.
Running link step : cd /tmp/ltsmin16539974879479661056;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin16539974879479661056;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([]((LTLAPp0==true))||<>([]((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-07 finished in 104310 ms.
[2024-05-28 21:18:41] [INFO ] Flatten gal took : 16 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5903981153162707024
[2024-05-28 21:18:41] [INFO ] Applying decomposition
[2024-05-28 21:18:41] [INFO ] Computing symmetric may disable matrix : 259 transitions.
[2024-05-28 21:18:41] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:18:41] [INFO ] Flatten gal took : 16 ms
[2024-05-28 21:18:41] [INFO ] Computing symmetric may enable matrix : 259 transitions.
[2024-05-28 21:18:41] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:18:41] [INFO ] Computing Do-Not-Accords matrix : 259 transitions.
[2024-05-28 21:18:41] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:18:41] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5903981153162707024
Running compilation step : cd /tmp/ltsmin5903981153162707024;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph5798599071693381291.txt' '-o' '/tmp/graph5798599071693381291.bin' '-w' '/tmp/graph5798599071693381291.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5798599071693381291.bin' '-l' '-1' '-v' '-w' '/tmp/graph5798599071693381291.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:18:41] [INFO ] Decomposing Gal with order
[2024-05-28 21:18:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:18:41] [INFO ] Removed a total of 250 redundant transitions.
[2024-05-28 21:18:41] [INFO ] Flatten gal took : 97 ms
[2024-05-28 21:18:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 200 labels/synchronizations in 32 ms.
[2024-05-28 21:18:41] [INFO ] Time to serialize gal into /tmp/LTLFireability17883342973255396989.gal : 4 ms
[2024-05-28 21:18:41] [INFO ] Time to serialize properties into /tmp/LTLFireability15493612957366512142.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17883342973255396989.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15493612957366512142.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((X((G("((i2.i0.u0.s1<1)||(u20.l1192<1))"))||(F(G("((i2.i0.u0.s1<1)||(i1.i2.u7.l149<1))"))))))
Formula 0 simplified : X(F!"((i2.i0.u0.s1<1)||(u20.l1192<1))" & GF!"((i2.i0.u0.s1<1)||(i1.i2.u7.l149<1))")
Compilation finished in 801 ms.
Running link step : cd /tmp/ltsmin5903981153162707024;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin5903981153162707024;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([]((LTLAPp0==true))||<>([]((LTLAPp1==true)))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.011: LTL layer: formula: X(([]((LTLAPp0==true))||<>([]((LTLAPp1==true)))))
pins2lts-mc-linux64( 5/ 8), 0.011: "X(([]((LTLAPp0==true))||<>([]((LTLAPp1==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.012: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.018: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.018: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.020: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.020: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.020: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.020: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.020: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.020: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.034: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.037: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.038: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.044: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.045: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.045: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.079: There are 262 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.079: State length is 141, there are 267 groups
pins2lts-mc-linux64( 0/ 8), 0.079: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.079: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.079: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.079: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.167: [Blue] ~48 levels ~960 states ~2424 transitions
pins2lts-mc-linux64( 4/ 8), 0.190: [Blue] ~48 levels ~1920 states ~4832 transitions
pins2lts-mc-linux64( 4/ 8), 0.301: [Blue] ~92 levels ~3840 states ~10024 transitions
pins2lts-mc-linux64( 4/ 8), 0.493: [Blue] ~92 levels ~7680 states ~18512 transitions
pins2lts-mc-linux64( 3/ 8), 1.086: [Blue] ~181 levels ~15360 states ~36472 transitions
pins2lts-mc-linux64( 3/ 8), 1.645: [Blue] ~232 levels ~30720 states ~70272 transitions
pins2lts-mc-linux64( 6/ 8), 2.830: [Blue] ~453 levels ~61440 states ~134368 transitions
pins2lts-mc-linux64( 3/ 8), 5.042: [Blue] ~437 levels ~122880 states ~265792 transitions
pins2lts-mc-linux64( 6/ 8), 8.907: [Blue] ~697 levels ~245760 states ~520488 transitions
pins2lts-mc-linux64( 6/ 8), 14.601: [Blue] ~941 levels ~491520 states ~1041368 transitions
pins2lts-mc-linux64( 2/ 8), 23.992: [Blue] ~3522 levels ~983040 states ~2100048 transitions
pins2lts-mc-linux64( 6/ 8), 36.674: [Blue] ~1307 levels ~1966080 states ~4134912 transitions
pins2lts-mc-linux64( 6/ 8), 48.805: [Blue] ~1551 levels ~3932160 states ~8279512 transitions
pins2lts-mc-linux64( 7/ 8), 76.348: [Blue] ~2172 levels ~7864320 states ~16663832 transitions
pins2lts-mc-linux64( 1/ 8), 131.272: [Blue] ~5261 levels ~15728640 states ~32262848 transitions
pins2lts-mc-linux64( 1/ 8), 243.353: [Blue] ~5261 levels ~31457280 states ~64653840 transitions
pins2lts-mc-linux64( 1/ 8), 464.372: [Blue] ~5261 levels ~62914560 states ~129462472 transitions
pins2lts-mc-linux64( 7/ 8), 533.713: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 534.444:
pins2lts-mc-linux64( 0/ 8), 534.444: Explored 70275805 states 151561536 transitions, fanout: 2.157
pins2lts-mc-linux64( 0/ 8), 534.444: Total exploration time 534.350 sec (533.620 sec minimum, 533.896 sec on average)
pins2lts-mc-linux64( 0/ 8), 534.444: States per second: 131516, Transitions per second: 283637
pins2lts-mc-linux64( 0/ 8), 534.444:
pins2lts-mc-linux64( 0/ 8), 534.444: State space has 72588283 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 534.444: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 534.444: blue states: 70275805 (96.81%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 534.444: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 534.444: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 534.444:
pins2lts-mc-linux64( 0/ 8), 534.444: Total memory used for local state coloring: 6.8MB
pins2lts-mc-linux64( 0/ 8), 534.444:
pins2lts-mc-linux64( 0/ 8), 534.444: Queue width: 8B, total height: 447794, memory: 3.42MB
pins2lts-mc-linux64( 0/ 8), 534.444: Tree memory: 809.8MB, 11.7 B/state, compr.: 2.1%
pins2lts-mc-linux64( 0/ 8), 534.444: Tree fill ratio (roots/leafs): 54.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 534.444: Stored 259 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 534.444: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 534.444: Est. total memory use: 813.2MB (~1027.4MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5903981153162707024;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([]((LTLAPp0==true))||<>([]((LTLAPp1==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5903981153162707024;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([]((LTLAPp0==true))||<>([]((LTLAPp1==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-28 21:40:27] [INFO ] Flatten gal took : 13 ms
[2024-05-28 21:40:27] [INFO ] Time to serialize gal into /tmp/LTLFireability29458556908191254.gal : 4 ms
[2024-05-28 21:40:27] [INFO ] Time to serialize properties into /tmp/LTLFireability4452414055474836044.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability29458556908191254.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4452414055474836044.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...295
Read 1 LTL properties
Checking formula 0 : !((X((G("((s1<1)||(l1192<1))"))||(F(G("((s1<1)||(l149<1))"))))))
Formula 0 simplified : X(F!"((s1<1)||(l1192<1))" & GF!"((s1<1)||(l149<1))")
Detected timeout of ITS tools.
[2024-05-28 22:02:14] [INFO ] Flatten gal took : 158 ms
[2024-05-28 22:02:15] [INFO ] Input system was already deterministic with 259 transitions.
[2024-05-28 22:02:15] [INFO ] Transformed 140 places.
[2024-05-28 22:02:15] [INFO ] Transformed 259 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-28 22:02:15] [INFO ] Time to serialize gal into /tmp/LTLFireability13907646452117313683.gal : 24 ms
[2024-05-28 22:02:16] [INFO ] Time to serialize properties into /tmp/LTLFireability13410959262868063679.ltl : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13907646452117313683.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13410959262868063679.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((G("((s1<1)||(l1192<1))"))||(F(G("((s1<1)||(l149<1))"))))))
Formula 0 simplified : X(F!"((s1<1)||(l1192<1))" & GF!"((s1<1)||(l149<1))")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 12436080 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15634956 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-d1m96"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is SieveSingleMsgMbox-PT-d1m96, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r395-smll-171683823900058"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d1m96.tgz
mv SieveSingleMsgMbox-PT-d1m96 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;