Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r312-tall-165472283000980.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is SieveSingleMsgMbox-PT-d2m96, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472283000980
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 7.6K Jun 7 17:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Jun 7 17:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Jun 7 17:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 74K Jun 7 17:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Jun 6 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 6 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 6 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 12K Jun 7 17:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Jun 7 17:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 7 17:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Jun 7 17:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 1.1M Jun 6 12:11 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1654966963647

Running Version 202205111006
[2022-06-11 17:02:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-11 17:02:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-11 17:02:45] [INFO ] Load time of PNML (sax parser for PT used): 201 ms
[2022-06-11 17:02:45] [INFO ] Transformed 2398 places.
[2022-06-11 17:02:45] [INFO ] Transformed 1954 transitions.
[2022-06-11 17:02:45] [INFO ] Parsed PT model containing 2398 places and 1954 transitions in 315 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 1984 places in 17 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 828 transitions.
Iterating post reduction 0 with 853 rules applied. Total rules applied 853 place count 389 transition count 1126
Discarding 98 places :
Symmetric choice reduction at 1 with 98 rule applications. Total rules 951 place count 291 transition count 668
Iterating global reduction 1 with 98 rules applied. Total rules applied 1049 place count 291 transition count 668
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 1059 place count 291 transition count 658
Discarding 73 places :
Symmetric choice reduction at 2 with 73 rule applications. Total rules 1132 place count 218 transition count 585
Iterating global reduction 2 with 73 rules applied. Total rules applied 1205 place count 218 transition count 585
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 1231 place count 218 transition count 559
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 1258 place count 191 transition count 528
Iterating global reduction 3 with 27 rules applied. Total rules applied 1285 place count 191 transition count 528
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Iterating post reduction 3 with 66 rules applied. Total rules applied 1351 place count 191 transition count 462
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1356 place count 186 transition count 454
Iterating global reduction 4 with 5 rules applied. Total rules applied 1361 place count 186 transition count 454
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1366 place count 181 transition count 449
Iterating global reduction 4 with 5 rules applied. Total rules applied 1371 place count 181 transition count 449
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1372 place count 180 transition count 448
Iterating global reduction 4 with 1 rules applied. Total rules applied 1373 place count 180 transition count 448
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1374 place count 179 transition count 447
Iterating global reduction 4 with 1 rules applied. Total rules applied 1375 place count 179 transition count 447
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1376 place count 178 transition count 446
Iterating global reduction 4 with 1 rules applied. Total rules applied 1377 place count 178 transition count 446
Applied a total of 1377 rules in 122 ms. Remains 178 /414 variables (removed 236) and now considering 446/1954 (removed 1508) transitions.
// Phase 1: matrix 446 rows 178 cols
[2022-06-11 17:02:45] [INFO ] Computed 5 place invariants in 24 ms
[2022-06-11 17:02:45] [INFO ] Implicit Places using invariants in 261 ms returned []
// Phase 1: matrix 446 rows 178 cols
[2022-06-11 17:02:45] [INFO ] Computed 5 place invariants in 8 ms
[2022-06-11 17:02:45] [INFO ] State equation strengthened by 309 read => feed constraints.
[2022-06-11 17:02:46] [INFO ] Implicit Places using invariants and state equation in 794 ms returned []
Implicit Place search using SMT with State Equation took 1086 ms to find 0 implicit places.
// Phase 1: matrix 446 rows 178 cols
[2022-06-11 17:02:46] [INFO ] Computed 5 place invariants in 9 ms
[2022-06-11 17:02:46] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 178/414 places, 446/1954 transitions.
Finished structural reductions, in 1 iterations. Remains : 178/414 places, 446/1954 transitions.
Support contains 24 out of 178 places after structural reductions.
[2022-06-11 17:02:46] [INFO ] Flatten gal took : 55 ms
[2022-06-11 17:02:46] [INFO ] Flatten gal took : 30 ms
[2022-06-11 17:02:46] [INFO ] Input system was already deterministic with 446 transitions.
Incomplete random walk after 10000 steps, including 2242 resets, run finished after 564 ms. (steps per millisecond=17 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 25) 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 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 100 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 55 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 38 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 119 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 54 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) 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 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 40 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Interrupted probabilistic random walk after 206128 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :{0=1, 2=1, 4=1, 9=1, 11=1, 13=1, 17=1, 18=1, 23=1}
Probabilistic random walk after 206128 steps, saw 94280 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :9
Running SMT prover for 16 properties.
// Phase 1: matrix 446 rows 178 cols
[2022-06-11 17:02:50] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 17:02:51] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-11 17:02:51] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 6 ms returned sat
[2022-06-11 17:02:51] [INFO ] After 925ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:15
[2022-06-11 17:02:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-11 17:02:51] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 4 ms returned sat
[2022-06-11 17:02:52] [INFO ] After 814ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :15
[2022-06-11 17:02:52] [INFO ] State equation strengthened by 309 read => feed constraints.
[2022-06-11 17:02:54] [INFO ] After 1542ms SMT Verify possible using 309 Read/Feed constraints in natural domain returned unsat :1 sat :15
[2022-06-11 17:02:54] [INFO ] Deduced a trap composed of 49 places in 69 ms of which 5 ms to minimize.
[2022-06-11 17:02:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2022-06-11 17:02:56] [INFO ] After 3525ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :15
Attempting to minimize the solution found.
Minimization took 1320 ms.
[2022-06-11 17:02:57] [INFO ] After 5863ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :15
Fused 16 Parikh solutions to 15 different solutions.
Parikh walk visited 0 properties in 791 ms.
Support contains 13 out of 178 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 178/178 places, 446/446 transitions.
Graph (complete) has 725 edges and 178 vertex of which 177 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 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 177 transition count 444
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 14 place count 166 transition count 315
Iterating global reduction 1 with 11 rules applied. Total rules applied 25 place count 166 transition count 315
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 166 transition count 314
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 36 place count 156 transition count 304
Iterating global reduction 2 with 10 rules applied. Total rules applied 46 place count 156 transition count 304
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 51 place count 156 transition count 299
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 57 place count 150 transition count 288
Iterating global reduction 3 with 6 rules applied. Total rules applied 63 place count 150 transition count 288
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 66 place count 150 transition count 285
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 67 place count 149 transition count 284
Iterating global reduction 4 with 1 rules applied. Total rules applied 68 place count 149 transition count 284
Applied a total of 68 rules in 60 ms. Remains 149 /178 variables (removed 29) and now considering 284/446 (removed 162) transitions.
Finished structural reductions, in 1 iterations. Remains : 149/178 places, 284/446 transitions.
Incomplete random walk after 10000 steps, including 2246 resets, run finished after 335 ms. (steps per millisecond=29 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 55 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 89 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 110 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 37 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 60 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 233218 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :{5=1}
Probabilistic random walk after 233218 steps, saw 103369 distinct states, run finished after 3001 ms. (steps per millisecond=77 ) properties seen :1
Running SMT prover for 14 properties.
// Phase 1: matrix 284 rows 149 cols
[2022-06-11 17:03:02] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 17:03:02] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 17:03:02] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-11 17:03:02] [INFO ] After 590ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2022-06-11 17:03:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 17:03:02] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 17:03:03] [INFO ] After 510ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2022-06-11 17:03:03] [INFO ] State equation strengthened by 174 read => feed constraints.
[2022-06-11 17:03:04] [INFO ] After 919ms SMT Verify possible using 174 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2022-06-11 17:03:05] [INFO ] After 2353ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 1663 ms.
[2022-06-11 17:03:07] [INFO ] After 4640ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Parikh walk visited 0 properties in 624 ms.
Support contains 12 out of 149 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 149/149 places, 284/284 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 148 transition count 270
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 148 transition count 270
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 147 transition count 269
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 147 transition count 269
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 147 transition count 268
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 146 transition count 266
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 146 transition count 266
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 146 transition count 265
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 145 transition count 264
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 145 transition count 264
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 144 transition count 263
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 144 transition count 263
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 143 transition count 262
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 143 transition count 262
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 22 place count 143 transition count 254
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 23 place count 142 transition count 253
Iterating global reduction 3 with 1 rules applied. Total rules applied 24 place count 142 transition count 253
Applied a total of 24 rules in 38 ms. Remains 142 /149 variables (removed 7) and now considering 253/284 (removed 31) transitions.
Finished structural reductions, in 1 iterations. Remains : 142/149 places, 253/284 transitions.
Incomplete random walk after 10000 steps, including 2249 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 458 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 484 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 461 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 476 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 1022 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 441 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 1003 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 468 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 449 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 489 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 493 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 462 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 506 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 468 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 245927 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :{}
Probabilistic random walk after 245927 steps, saw 108273 distinct states, run finished after 3002 ms. (steps per millisecond=81 ) properties seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 253 rows 142 cols
[2022-06-11 17:03:12] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 17:03:12] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 17:03:12] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-11 17:03:13] [INFO ] After 569ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2022-06-11 17:03:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 17:03:13] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 17:03:13] [INFO ] After 484ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2022-06-11 17:03:13] [INFO ] State equation strengthened by 149 read => feed constraints.
[2022-06-11 17:03:14] [INFO ] After 812ms SMT Verify possible using 149 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2022-06-11 17:03:14] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 2 ms to minimize.
[2022-06-11 17:03:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2022-06-11 17:03:15] [INFO ] Deduced a trap composed of 48 places in 34 ms of which 0 ms to minimize.
[2022-06-11 17:03:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2022-06-11 17:03:15] [INFO ] After 2172ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 1424 ms.
[2022-06-11 17:03:17] [INFO ] After 4190ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Parikh walk visited 0 properties in 898 ms.
Support contains 12 out of 142 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 142/142 places, 253/253 transitions.
Applied a total of 0 rules in 11 ms. Remains 142 /142 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 142/142 places, 253/253 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 142/142 places, 253/253 transitions.
Applied a total of 0 rules in 9 ms. Remains 142 /142 variables (removed 0) and now considering 253/253 (removed 0) transitions.
// Phase 1: matrix 253 rows 142 cols
[2022-06-11 17:03:18] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 17:03:18] [INFO ] Implicit Places using invariants in 86 ms returned []
// Phase 1: matrix 253 rows 142 cols
[2022-06-11 17:03:18] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 17:03:18] [INFO ] State equation strengthened by 149 read => feed constraints.
[2022-06-11 17:03:18] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
[2022-06-11 17:03:18] [INFO ] Redundant transitions in 21 ms returned []
// Phase 1: matrix 253 rows 142 cols
[2022-06-11 17:03:18] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-11 17:03:18] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 142/142 places, 253/253 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 142 transition count 247
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 137 transition count 247
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 11 place count 137 transition count 227
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 51 place count 117 transition count 227
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 71 place count 107 transition count 217
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 73 place count 106 transition count 227
Applied a total of 73 rules in 26 ms. Remains 106 /142 variables (removed 36) and now considering 227/253 (removed 26) transitions.
Running SMT prover for 14 properties.
// Phase 1: matrix 227 rows 106 cols
[2022-06-11 17:03:18] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 17:03:18] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 17:03:18] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 17:03:19] [INFO ] After 519ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2022-06-11 17:03:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 17:03:19] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 17:03:19] [INFO ] After 426ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2022-06-11 17:03:20] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2022-06-11 17:03:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2022-06-11 17:03:20] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
[2022-06-11 17:03:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2022-06-11 17:03:20] [INFO ] Deduced a trap composed of 47 places in 40 ms of which 1 ms to minimize.
[2022-06-11 17:03:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2022-06-11 17:03:20] [INFO ] After 1068ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 462 ms.
[2022-06-11 17:03:21] [INFO ] After 1611ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
[2022-06-11 17:03:21] [INFO ] Flatten gal took : 13 ms
[2022-06-11 17:03:21] [INFO ] Flatten gal took : 11 ms
[2022-06-11 17:03:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14684515596447486142.gal : 3 ms
[2022-06-11 17:03:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7399380846941353172.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms292046290619896972;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14684515596447486142.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7399380846941353172.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality7399380846941353172.prop.
SDD proceeding with computation,14 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,14 properties remain. new max is 8
SDD size :9 after 28
SDD proceeding with computation,14 properties remain. new max is 16
SDD size :28 after 35
SDD proceeding with computation,14 properties remain. new max is 32
SDD size :35 after 105
SDD proceeding with computation,14 properties remain. new max is 64
SDD size :105 after 174
SDD proceeding with computation,14 properties remain. new max is 128
SDD size :174 after 232
Reachability property AtomicPropp14 is true.
SDD proceeding with computation,13 properties remain. new max is 128
SDD size :232 after 958
SDD proceeding with computation,13 properties remain. new max is 256
SDD size :958 after 2014
SDD proceeding with computation,13 properties remain. new max is 512
SDD size :2014 after 3736
SDD proceeding with computation,13 properties remain. new max is 1024
SDD size :3736 after 39224
SDD proceeding with computation,13 properties remain. new max is 2048
SDD size :39224 after 376968
SDD proceeding with computation,13 properties remain. new max is 4096
SDD size :376968 after 8.4892e+06
SDD proceeding with computation,13 properties remain. new max is 8192
SDD size :8.4892e+06 after 4.57178e+08
SDD proceeding with computation,13 properties remain. new max is 16384
SDD size :4.57178e+08 after 2.63964e+10
Detected timeout of ITS tools.
[2022-06-11 17:03:36] [INFO ] Flatten gal took : 16 ms
[2022-06-11 17:03:36] [INFO ] Applying decomposition
[2022-06-11 17:03:36] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph9244872679986841579.txt' '-o' '/tmp/graph9244872679986841579.bin' '-w' '/tmp/graph9244872679986841579.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9244872679986841579.bin' '-l' '-1' '-v' '-w' '/tmp/graph9244872679986841579.weights' '-q' '0' '-e' '0.001'
[2022-06-11 17:03:36] [INFO ] Decomposing Gal with order
[2022-06-11 17:03:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 17:03:36] [INFO ] Removed a total of 103 redundant transitions.
[2022-06-11 17:03:36] [INFO ] Flatten gal took : 98 ms
[2022-06-11 17:03:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 59 labels/synchronizations in 10 ms.
[2022-06-11 17:03:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12638284414907635651.gal : 9 ms
[2022-06-11 17:03:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8562008650556049338.prop : 3 ms
Invoking ITS tools like this :cd /tmp/redAtoms292046290619896972;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12638284414907635651.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8562008650556049338.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality8562008650556049338.prop.
SDD proceeding with computation,13 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,13 properties remain. new max is 8
SDD size :3 after 16
SDD proceeding with computation,13 properties remain. new max is 16
SDD size :16 after 30
SDD proceeding with computation,13 properties remain. new max is 32
SDD size :30 after 62
SDD proceeding with computation,13 properties remain. new max is 64
SDD size :62 after 130
SDD proceeding with computation,13 properties remain. new max is 128
SDD size :130 after 174
SDD proceeding with computation,13 properties remain. new max is 256
SDD size :174 after 174
SDD proceeding with computation,13 properties remain. new max is 512
SDD size :174 after 180
Reachability property AtomicPropp21 is true.
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :396 after 1080
Reachability property AtomicPropp7 is true.
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :1080 after 1921
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :1921 after 2235
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12769938130335649511
[2022-06-11 17:03:51] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12769938130335649511
Running compilation step : cd /tmp/ltsmin12769938130335649511;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 478 ms.
Running link step : cd /tmp/ltsmin12769938130335649511;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin12769938130335649511;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicPropp1==true'
LTSmin run took 665 ms.
Found Violation
Running LTSmin : cd /tmp/ltsmin12769938130335649511;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicPropp3==true'
LTSmin run took 320 ms.
Found Violation
Running LTSmin : cd /tmp/ltsmin12769938130335649511;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicPropp5==true'
LTSmin run took 362 ms.
Found Violation
Running LTSmin : cd /tmp/ltsmin12769938130335649511;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicPropp6==true'
LTSmin run took 279 ms.
Found Violation
Running LTSmin : cd /tmp/ltsmin12769938130335649511;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicPropp12==true'
LTSmin run took 265 ms.
Found Violation
Running LTSmin : cd /tmp/ltsmin12769938130335649511;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicPropp15==true'
LTSmin run took 280 ms.
Found Violation
Running LTSmin : cd /tmp/ltsmin12769938130335649511;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicPropp16==true'
LTSmin run took 451 ms.
Found Violation
Running LTSmin : cd /tmp/ltsmin12769938130335649511;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicPropp19==true'
LTSmin run took 254 ms.
Found Violation
Running LTSmin : cd /tmp/ltsmin12769938130335649511;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicPropp20==true'
LTSmin run took 548 ms.
Found Violation
Running LTSmin : cd /tmp/ltsmin12769938130335649511;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicPropp22==true'
LTSmin run took 108 ms.
Found Violation
Running LTSmin : cd /tmp/ltsmin12769938130335649511;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicPropp24==true'
LTSmin run took 180 ms.
Found Violation
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 35 stabilizing places and 40 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 178 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 178/178 places, 446/446 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 158 transition count 230
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 158 transition count 230
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 158 transition count 229
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 60 place count 139 transition count 210
Iterating global reduction 1 with 19 rules applied. Total rules applied 79 place count 139 transition count 210
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 88 place count 139 transition count 201
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 101 place count 126 transition count 177
Iterating global reduction 2 with 13 rules applied. Total rules applied 114 place count 126 transition count 177
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 123 place count 126 transition count 168
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 127 place count 122 transition count 164
Iterating global reduction 3 with 4 rules applied. Total rules applied 131 place count 122 transition count 164
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 134 place count 119 transition count 161
Iterating global reduction 3 with 3 rules applied. Total rules applied 137 place count 119 transition count 161
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 140 place count 116 transition count 158
Iterating global reduction 3 with 3 rules applied. Total rules applied 143 place count 116 transition count 158
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 146 place count 116 transition count 155
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 149 place count 113 transition count 152
Iterating global reduction 4 with 3 rules applied. Total rules applied 152 place count 113 transition count 152
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 153 place count 112 transition count 149
Iterating global reduction 4 with 1 rules applied. Total rules applied 154 place count 112 transition count 149
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 155 place count 111 transition count 148
Iterating global reduction 4 with 1 rules applied. Total rules applied 156 place count 111 transition count 148
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 157 place count 110 transition count 147
Iterating global reduction 4 with 1 rules applied. Total rules applied 158 place count 110 transition count 147
Applied a total of 158 rules in 40 ms. Remains 110 /178 variables (removed 68) and now considering 147/446 (removed 299) transitions.
// Phase 1: matrix 147 rows 110 cols
[2022-06-11 17:03:56] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 17:03:56] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 147 rows 110 cols
[2022-06-11 17:03:56] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 17:03:56] [INFO ] State equation strengthened by 71 read => feed constraints.
[2022-06-11 17:03:56] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
[2022-06-11 17:03:56] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 147 rows 110 cols
[2022-06-11 17:03:56] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 17:03:56] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 110/178 places, 147/446 transitions.
Finished structural reductions, in 1 iterations. Remains : 110/178 places, 147/446 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s103 1)) (AND (GEQ s1 1) (GEQ s105 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-d2m96-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-00 finished in 628 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p1)&&p0) U X((X(((p1 U p3)&&!p4))&&p2))))'
Support contains 5 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 446/446 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 160 transition count 246
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 160 transition count 246
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 160 transition count 245
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 54 place count 143 transition count 228
Iterating global reduction 1 with 17 rules applied. Total rules applied 71 place count 143 transition count 228
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 80 place count 143 transition count 219
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 91 place count 132 transition count 198
Iterating global reduction 2 with 11 rules applied. Total rules applied 102 place count 132 transition count 198
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 111 place count 132 transition count 189
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 113 place count 130 transition count 187
Iterating global reduction 3 with 2 rules applied. Total rules applied 115 place count 130 transition count 187
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 117 place count 128 transition count 185
Iterating global reduction 3 with 2 rules applied. Total rules applied 119 place count 128 transition count 185
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 121 place count 126 transition count 183
Iterating global reduction 3 with 2 rules applied. Total rules applied 123 place count 126 transition count 183
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 125 place count 124 transition count 181
Iterating global reduction 3 with 2 rules applied. Total rules applied 127 place count 124 transition count 181
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 128 place count 123 transition count 178
Iterating global reduction 3 with 1 rules applied. Total rules applied 129 place count 123 transition count 178
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 130 place count 122 transition count 177
Iterating global reduction 3 with 1 rules applied. Total rules applied 131 place count 122 transition count 177
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 132 place count 121 transition count 176
Iterating global reduction 3 with 1 rules applied. Total rules applied 133 place count 121 transition count 176
Applied a total of 133 rules in 14 ms. Remains 121 /178 variables (removed 57) and now considering 176/446 (removed 270) transitions.
// Phase 1: matrix 176 rows 121 cols
[2022-06-11 17:03:56] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 17:03:56] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 176 rows 121 cols
[2022-06-11 17:03:56] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 17:03:56] [INFO ] State equation strengthened by 92 read => feed constraints.
[2022-06-11 17:03:56] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 121 cols
[2022-06-11 17:03:56] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 17:03:57] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 121/178 places, 176/446 transitions.
Finished structural reductions, in 1 iterations. Remains : 121/178 places, 176/446 transitions.
Stuttering acceptance computed with spot in 749 ms :[(OR (NOT p2) (NOT p3) p4), (OR (NOT p2) (NOT p3) p4), (OR (NOT p3) (NOT p2) p4), true, (OR (NOT p3) p4), (NOT p3), (NOT p1), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) p4)), (OR (AND p1 (NOT p3)) (AND p2 (NOT p3)) (AND p2 p4) (AND p1 p4)), (OR (NOT p3) p4), (AND (NOT p1) (NOT p3)), (OR (AND p1 (NOT p3)) (AND p2 (NOT p3))), (NOT p3)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=p2, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 6}, { cond=(AND p1 p2), acceptance={0} source=2 dest: 7}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=2 dest: 8}, { cond=(AND p0 p1 p2), acceptance={0} source=2 dest: 9}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(OR (AND (NOT p1) (NOT p3)) p4), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p4) (NOT p3)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=5 dest: 3}, { cond=(AND p1 (NOT p3)), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 3}, { cond=p1, acceptance={} source=6 dest: 6}], [{ cond=(OR (AND (NOT p1) p4) (AND (NOT p1) (NOT p3))), acceptance={} source=7 dest: 3}, { cond=(AND p1 p4), acceptance={} source=7 dest: 6}, { cond=(AND p1 (NOT p4) (NOT p3)), acceptance={} source=7 dest: 10}], [{ cond=(AND p1 (NOT p2) p4), acceptance={} source=8 dest: 3}, { cond=(OR (AND (NOT p1) p2 (NOT p3)) (AND p2 p4)), acceptance={} source=8 dest: 4}, { cond=(AND p1 (NOT p4) (NOT p3)), acceptance={} source=8 dest: 5}], [{ cond=(AND (NOT p0) p1 (NOT p2) p4), acceptance={0} source=9 dest: 1}, { cond=(AND p0 p1 (NOT p2) p4), acceptance={0} source=9 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p2) p4) (AND (NOT p1) (NOT p2) (NOT p3))), acceptance={0} source=9 dest: 3}, { cond=(OR (AND (NOT p1) p2 p4) (AND (NOT p1) p2 (NOT p3))), acceptance={0} source=9 dest: 4}, { cond=(AND p1 (NOT p2) p4), acceptance={0} source=9 dest: 6}, { cond=(AND p1 p2 p4), acceptance={0} source=9 dest: 7}, { cond=(AND (NOT p0) p1 p2 p4), acceptance={0} source=9 dest: 8}, { cond=(AND p0 p1 p2 p4), acceptance={0} source=9 dest: 9}, { cond=(AND p1 (NOT p4) (NOT p3)), acceptance={0} source=9 dest: 10}, { cond=(AND (NOT p0) p1 (NOT p4) (NOT p3)), acceptance={0} source=9 dest: 11}, { cond=(AND p0 p1 (NOT p4) (NOT p3)), acceptance={0} source=9 dest: 12}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=10 dest: 3}, { cond=(AND p1 (NOT p3)), acceptance={} source=10 dest: 10}], [{ cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=11 dest: 4}, { cond=(AND p1 (NOT p3)), acceptance={} source=11 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0} source=12 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={0} source=12 dest: 4}, { cond=(AND p1 (NOT p3)), acceptance={0} source=12 dest: 10}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={0} source=12 dest: 11}, { cond=(AND p0 p1 (NOT p3)), acceptance={0} source=12 dest: 12}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s115 1)), p1:(AND (GEQ s1 1) (GEQ s81 1)), p2:(AND (GEQ s1 1) (GEQ s116 1)), p3:(AND (GEQ s1 1) (GEQ s114 1)), p4:(AND (GEQ s1 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, 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-d2m96-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-01 finished in 1236 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 178 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 178/178 places, 446/446 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 157 transition count 216
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 157 transition count 216
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 157 transition count 215
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 63 place count 137 transition count 195
Iterating global reduction 1 with 20 rules applied. Total rules applied 83 place count 137 transition count 195
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 92 place count 137 transition count 186
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 106 place count 123 transition count 160
Iterating global reduction 2 with 14 rules applied. Total rules applied 120 place count 123 transition count 160
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 129 place count 123 transition count 151
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 134 place count 118 transition count 146
Iterating global reduction 3 with 5 rules applied. Total rules applied 139 place count 118 transition count 146
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 143 place count 114 transition count 142
Iterating global reduction 3 with 4 rules applied. Total rules applied 147 place count 114 transition count 142
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 150 place count 111 transition count 139
Iterating global reduction 3 with 3 rules applied. Total rules applied 153 place count 111 transition count 139
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 155 place count 111 transition count 137
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 158 place count 108 transition count 134
Iterating global reduction 4 with 3 rules applied. Total rules applied 161 place count 108 transition count 134
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 162 place count 107 transition count 131
Iterating global reduction 4 with 1 rules applied. Total rules applied 163 place count 107 transition count 131
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 164 place count 106 transition count 130
Iterating global reduction 4 with 1 rules applied. Total rules applied 165 place count 106 transition count 130
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 166 place count 105 transition count 129
Iterating global reduction 4 with 1 rules applied. Total rules applied 167 place count 105 transition count 129
Applied a total of 167 rules in 35 ms. Remains 105 /178 variables (removed 73) and now considering 129/446 (removed 317) transitions.
// Phase 1: matrix 129 rows 105 cols
[2022-06-11 17:03:57] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 17:03:57] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 129 rows 105 cols
[2022-06-11 17:03:57] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 17:03:57] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-06-11 17:03:58] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
[2022-06-11 17:03:58] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 129 rows 105 cols
[2022-06-11 17:03:58] [INFO ] Computed 5 place invariants in 7 ms
[2022-06-11 17:03:58] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/178 places, 129/446 transitions.
Finished structural reductions, in 1 iterations. Remains : 105/178 places, 129/446 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s100 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-04 finished in 439 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((!F(p0)&&!p1)) U X(p2)))'
Support contains 5 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 446/446 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 159 transition count 231
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 159 transition count 231
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 159 transition count 230
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 57 place count 141 transition count 212
Iterating global reduction 1 with 18 rules applied. Total rules applied 75 place count 141 transition count 212
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 83 place count 141 transition count 204
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 95 place count 129 transition count 182
Iterating global reduction 2 with 12 rules applied. Total rules applied 107 place count 129 transition count 182
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 116 place count 129 transition count 173
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 119 place count 126 transition count 170
Iterating global reduction 3 with 3 rules applied. Total rules applied 122 place count 126 transition count 170
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 124 place count 124 transition count 168
Iterating global reduction 3 with 2 rules applied. Total rules applied 126 place count 124 transition count 168
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 128 place count 122 transition count 166
Iterating global reduction 3 with 2 rules applied. Total rules applied 130 place count 122 transition count 166
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 133 place count 122 transition count 163
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 135 place count 120 transition count 161
Iterating global reduction 4 with 2 rules applied. Total rules applied 137 place count 120 transition count 161
Applied a total of 137 rules in 13 ms. Remains 120 /178 variables (removed 58) and now considering 161/446 (removed 285) transitions.
// Phase 1: matrix 161 rows 120 cols
[2022-06-11 17:03:58] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 17:03:58] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 161 rows 120 cols
[2022-06-11 17:03:58] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 17:03:58] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-06-11 17:03:58] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
// Phase 1: matrix 161 rows 120 cols
[2022-06-11 17:03:58] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 17:03:58] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 120/178 places, 161/446 transitions.
Finished structural reductions, in 1 iterations. Remains : 120/178 places, 161/446 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p2), (NOT p2), (NOT p2), true, (OR p1 p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(OR p0 p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(OR p0 p1), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s11 1) (GEQ s36 1)), p1:(AND (GEQ s1 1) (GEQ s114 1)), p2:(AND (GEQ s1 1) (GEQ s115 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 6 steps with 1 reset in 5 ms.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-05 finished in 637 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(G(F(X((G(p0)||(F(!p0)&&p1)))))))))'
Support contains 3 out of 178 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 178/178 places, 446/446 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 158 transition count 230
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 158 transition count 230
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 158 transition count 229
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 60 place count 139 transition count 210
Iterating global reduction 1 with 19 rules applied. Total rules applied 79 place count 139 transition count 210
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 87 place count 139 transition count 202
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 100 place count 126 transition count 178
Iterating global reduction 2 with 13 rules applied. Total rules applied 113 place count 126 transition count 178
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 122 place count 126 transition count 169
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 126 place count 122 transition count 165
Iterating global reduction 3 with 4 rules applied. Total rules applied 130 place count 122 transition count 165
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 133 place count 119 transition count 162
Iterating global reduction 3 with 3 rules applied. Total rules applied 136 place count 119 transition count 162
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 138 place count 117 transition count 160
Iterating global reduction 3 with 2 rules applied. Total rules applied 140 place count 117 transition count 160
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 142 place count 115 transition count 158
Iterating global reduction 3 with 2 rules applied. Total rules applied 144 place count 115 transition count 158
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 145 place count 114 transition count 155
Iterating global reduction 3 with 1 rules applied. Total rules applied 146 place count 114 transition count 155
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 147 place count 113 transition count 154
Iterating global reduction 3 with 1 rules applied. Total rules applied 148 place count 113 transition count 154
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 149 place count 112 transition count 153
Iterating global reduction 3 with 1 rules applied. Total rules applied 150 place count 112 transition count 153
Applied a total of 150 rules in 39 ms. Remains 112 /178 variables (removed 66) and now considering 153/446 (removed 293) transitions.
// Phase 1: matrix 153 rows 112 cols
[2022-06-11 17:03:58] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-11 17:03:58] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 153 rows 112 cols
[2022-06-11 17:03:59] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 17:03:59] [INFO ] State equation strengthened by 75 read => feed constraints.
[2022-06-11 17:03:59] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
[2022-06-11 17:03:59] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 153 rows 112 cols
[2022-06-11 17:03:59] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 17:03:59] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 112/178 places, 153/446 transitions.
Finished structural reductions, in 1 iterations. Remains : 112/178 places, 153/446 transitions.
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s107 1)), p1:(AND (GEQ s1 1) (GEQ s106 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 22469 reset in 330 ms.
Product exploration explored 100000 steps with 22392 reset in 213 ms.
Computed a total of 22 stabilizing places and 24 stable transitions
Computed a total of 22 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 205 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2273 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 446 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 459 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Finished probabilistic random walk after 3798 steps, run visited all 2 properties in 32 ms. (steps per millisecond=118 )
Probabilistic random walk after 3798 steps, saw 1859 distinct states, run finished after 32 ms. (steps per millisecond=118 ) properties seen :2
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 177 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 153/153 transitions.
Applied a total of 0 rules in 13 ms. Remains 112 /112 variables (removed 0) and now considering 153/153 (removed 0) transitions.
// Phase 1: matrix 153 rows 112 cols
[2022-06-11 17:04:00] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-11 17:04:00] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 153 rows 112 cols
[2022-06-11 17:04:00] [INFO ] Computed 5 place invariants in 4 ms
[2022-06-11 17:04:00] [INFO ] State equation strengthened by 75 read => feed constraints.
[2022-06-11 17:04:01] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
[2022-06-11 17:04:01] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 153 rows 112 cols
[2022-06-11 17:04:01] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-11 17:04:01] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 112/112 places, 153/153 transitions.
Computed a total of 22 stabilizing places and 24 stable transitions
Computed a total of 22 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 161 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2272 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 477 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 465 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Finished probabilistic random walk after 3798 steps, run visited all 2 properties in 23 ms. (steps per millisecond=165 )
Probabilistic random walk after 3798 steps, saw 1859 distinct states, run finished after 24 ms. (steps per millisecond=158 ) properties seen :2
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 216 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 22378 reset in 147 ms.
Product exploration explored 100000 steps with 22399 reset in 177 ms.
Built C files in :
/tmp/ltsmin8676786546387250723
[2022-06-11 17:04:02] [INFO ] Computing symmetric may disable matrix : 153 transitions.
[2022-06-11 17:04:02] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 17:04:02] [INFO ] Computing symmetric may enable matrix : 153 transitions.
[2022-06-11 17:04:02] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 17:04:02] [INFO ] Computing Do-Not-Accords matrix : 153 transitions.
[2022-06-11 17:04:02] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 17:04:02] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8676786546387250723
Running compilation step : cd /tmp/ltsmin8676786546387250723;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 302 ms.
Running link step : cd /tmp/ltsmin8676786546387250723;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin8676786546387250723;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8896993665248425615.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 153/153 transitions.
Applied a total of 0 rules in 5 ms. Remains 112 /112 variables (removed 0) and now considering 153/153 (removed 0) transitions.
// Phase 1: matrix 153 rows 112 cols
[2022-06-11 17:04:17] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 17:04:17] [INFO ] Implicit Places using invariants in 68 ms returned []
// Phase 1: matrix 153 rows 112 cols
[2022-06-11 17:04:17] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 17:04:17] [INFO ] State equation strengthened by 75 read => feed constraints.
[2022-06-11 17:04:17] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
[2022-06-11 17:04:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 153 rows 112 cols
[2022-06-11 17:04:17] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 17:04:18] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 112/112 places, 153/153 transitions.
Built C files in :
/tmp/ltsmin2156185080454467202
[2022-06-11 17:04:18] [INFO ] Computing symmetric may disable matrix : 153 transitions.
[2022-06-11 17:04:18] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 17:04:18] [INFO ] Computing symmetric may enable matrix : 153 transitions.
[2022-06-11 17:04:18] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 17:04:18] [INFO ] Computing Do-Not-Accords matrix : 153 transitions.
[2022-06-11 17:04:18] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 17:04:18] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2156185080454467202
Running compilation step : cd /tmp/ltsmin2156185080454467202;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 287 ms.
Running link step : cd /tmp/ltsmin2156185080454467202;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin2156185080454467202;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10580833219098275401.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-11 17:04:33] [INFO ] Flatten gal took : 9 ms
[2022-06-11 17:04:33] [INFO ] Flatten gal took : 8 ms
[2022-06-11 17:04:33] [INFO ] Time to serialize gal into /tmp/LTL1941335491433264772.gal : 2 ms
[2022-06-11 17:04:33] [INFO ] Time to serialize properties into /tmp/LTL4894781792931242408.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1941335491433264772.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4894781792931242408.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1941335...266
Read 1 LTL properties
Checking formula 0 : !((G(X(X(G(F(X((G("((s1<1)||(l2227<1))"))||(((F("((s1>=1)&&(l2227>=1))"))&&("(s1>=1)"))&&("(l2217>=1)"))))))))))
Formula 0 simplified : !GXXGFX(G"((s1<1)||(l2227<1))" | ("(l2217>=1)" & "(s1>=1)" & F"((s1>=1)&&(l2227>=1))"))
Detected timeout of ITS tools.
[2022-06-11 17:04:48] [INFO ] Flatten gal took : 9 ms
[2022-06-11 17:04:48] [INFO ] Applying decomposition
[2022-06-11 17:04:48] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7016893651971250635.txt' '-o' '/tmp/graph7016893651971250635.bin' '-w' '/tmp/graph7016893651971250635.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7016893651971250635.bin' '-l' '-1' '-v' '-w' '/tmp/graph7016893651971250635.weights' '-q' '0' '-e' '0.001'
[2022-06-11 17:04:48] [INFO ] Decomposing Gal with order
[2022-06-11 17:04:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 17:04:48] [INFO ] Removed a total of 105 redundant transitions.
[2022-06-11 17:04:48] [INFO ] Flatten gal took : 26 ms
[2022-06-11 17:04:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 76 labels/synchronizations in 9 ms.
[2022-06-11 17:04:48] [INFO ] Time to serialize gal into /tmp/LTL5444171372116239204.gal : 2 ms
[2022-06-11 17:04:48] [INFO ] Time to serialize properties into /tmp/LTL12668852994157575046.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5444171372116239204.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12668852994157575046.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5444171...246
Read 1 LTL properties
Checking formula 0 : !((G(X(X(G(F(X((G("((u0.s1<1)||(u0.l2227<1))"))||(((F("((u0.s1>=1)&&(u0.l2227>=1))"))&&("(u0.s1>=1)"))&&("(u0.l2217>=1)"))))))))))
Formula 0 simplified : !GXXGFX(G"((u0.s1<1)||(u0.l2227<1))" | ("(u0.l2217>=1)" & "(u0.s1>=1)" & F"((u0.s1>=1)&&(u0.l2227>=1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8735963226953300671
[2022-06-11 17:05:03] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8735963226953300671
Running compilation step : cd /tmp/ltsmin8735963226953300671;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 265 ms.
Running link step : cd /tmp/ltsmin8735963226953300671;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin8735963226953300671;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X(X([](<>(X(([]((LTLAPp0==true))||(<>(!(LTLAPp0==true))&&(LTLAPp1==true)))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-08 finished in 79590 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(p0))) U G((p1 U p0))))'
Support contains 4 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 446/446 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 158 transition count 217
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 158 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 158 transition count 216
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 60 place count 139 transition count 197
Iterating global reduction 1 with 19 rules applied. Total rules applied 79 place count 139 transition count 197
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 88 place count 139 transition count 188
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 101 place count 126 transition count 164
Iterating global reduction 2 with 13 rules applied. Total rules applied 114 place count 126 transition count 164
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 123 place count 126 transition count 155
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 127 place count 122 transition count 151
Iterating global reduction 3 with 4 rules applied. Total rules applied 131 place count 122 transition count 151
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 134 place count 119 transition count 148
Iterating global reduction 3 with 3 rules applied. Total rules applied 137 place count 119 transition count 148
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 139 place count 117 transition count 146
Iterating global reduction 3 with 2 rules applied. Total rules applied 141 place count 117 transition count 146
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 143 place count 117 transition count 144
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 145 place count 115 transition count 142
Iterating global reduction 4 with 2 rules applied. Total rules applied 147 place count 115 transition count 142
Applied a total of 147 rules in 22 ms. Remains 115 /178 variables (removed 63) and now considering 142/446 (removed 304) transitions.
// Phase 1: matrix 142 rows 115 cols
[2022-06-11 17:05:18] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 17:05:18] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 142 rows 115 cols
[2022-06-11 17:05:18] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 17:05:18] [INFO ] State equation strengthened by 62 read => feed constraints.
[2022-06-11 17:05:18] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
// Phase 1: matrix 142 rows 115 cols
[2022-06-11 17:05:18] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 17:05:18] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 115/178 places, 142/446 transitions.
Finished structural reductions, in 1 iterations. Remains : 115/178 places, 142/446 transitions.
Stuttering acceptance computed with spot in 423 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(OR p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 3}, { cond=(OR p0 p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(OR p0 p1), acceptance={} source=4 dest: 9}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 10}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={} source=9 dest: 10}, { cond=p0, acceptance={} source=9 dest: 11}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=10 dest: 7}, { cond=(AND (NOT p0) p1), acceptance={0} source=10 dest: 10}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=11 dest: 7}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s110 1)), p1:(AND (GEQ s11 1) (GEQ s34 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-09 finished in 807 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(F(p0))&&G(p1)))))'
Support contains 3 out of 178 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 178/178 places, 446/446 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 158 transition count 230
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 158 transition count 230
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 158 transition count 229
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 60 place count 139 transition count 210
Iterating global reduction 1 with 19 rules applied. Total rules applied 79 place count 139 transition count 210
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 89 place count 139 transition count 200
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 102 place count 126 transition count 176
Iterating global reduction 2 with 13 rules applied. Total rules applied 115 place count 126 transition count 176
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 124 place count 126 transition count 167
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 128 place count 122 transition count 163
Iterating global reduction 3 with 4 rules applied. Total rules applied 132 place count 122 transition count 163
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 135 place count 119 transition count 160
Iterating global reduction 3 with 3 rules applied. Total rules applied 138 place count 119 transition count 160
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 141 place count 116 transition count 157
Iterating global reduction 3 with 3 rules applied. Total rules applied 144 place count 116 transition count 157
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 147 place count 116 transition count 154
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 150 place count 113 transition count 151
Iterating global reduction 4 with 3 rules applied. Total rules applied 153 place count 113 transition count 151
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 154 place count 112 transition count 148
Iterating global reduction 4 with 1 rules applied. Total rules applied 155 place count 112 transition count 148
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 156 place count 111 transition count 147
Iterating global reduction 4 with 1 rules applied. Total rules applied 157 place count 111 transition count 147
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 158 place count 110 transition count 146
Iterating global reduction 4 with 1 rules applied. Total rules applied 159 place count 110 transition count 146
Applied a total of 159 rules in 31 ms. Remains 110 /178 variables (removed 68) and now considering 146/446 (removed 300) transitions.
// Phase 1: matrix 146 rows 110 cols
[2022-06-11 17:05:19] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 17:05:19] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 146 rows 110 cols
[2022-06-11 17:05:19] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 17:05:19] [INFO ] State equation strengthened by 71 read => feed constraints.
[2022-06-11 17:05:19] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
[2022-06-11 17:05:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 146 rows 110 cols
[2022-06-11 17:05:19] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 17:05:19] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 110/178 places, 146/446 transitions.
Finished structural reductions, in 1 iterations. Remains : 110/178 places, 146/446 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s105 1)), p0:(AND (GEQ s1 1) (GEQ s104 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-10 finished in 529 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(G(!(!F(p0) U ((p0 U p1)||p2)))))))'
Support contains 3 out of 178 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 178/178 places, 446/446 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 159 transition count 244
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 159 transition count 244
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 159 transition count 243
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 57 place count 141 transition count 225
Iterating global reduction 1 with 18 rules applied. Total rules applied 75 place count 141 transition count 225
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 84 place count 141 transition count 216
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 96 place count 129 transition count 194
Iterating global reduction 2 with 12 rules applied. Total rules applied 108 place count 129 transition count 194
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 117 place count 129 transition count 185
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 121 place count 125 transition count 181
Iterating global reduction 3 with 4 rules applied. Total rules applied 125 place count 125 transition count 181
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 128 place count 122 transition count 178
Iterating global reduction 3 with 3 rules applied. Total rules applied 131 place count 122 transition count 178
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 133 place count 120 transition count 176
Iterating global reduction 3 with 2 rules applied. Total rules applied 135 place count 120 transition count 176
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 137 place count 118 transition count 174
Iterating global reduction 3 with 2 rules applied. Total rules applied 139 place count 118 transition count 174
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 140 place count 117 transition count 171
Iterating global reduction 3 with 1 rules applied. Total rules applied 141 place count 117 transition count 171
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 142 place count 116 transition count 170
Iterating global reduction 3 with 1 rules applied. Total rules applied 143 place count 116 transition count 170
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 144 place count 115 transition count 169
Iterating global reduction 3 with 1 rules applied. Total rules applied 145 place count 115 transition count 169
Applied a total of 145 rules in 27 ms. Remains 115 /178 variables (removed 63) and now considering 169/446 (removed 277) transitions.
// Phase 1: matrix 169 rows 115 cols
[2022-06-11 17:05:19] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 17:05:19] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 169 rows 115 cols
[2022-06-11 17:05:19] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 17:05:19] [INFO ] State equation strengthened by 89 read => feed constraints.
[2022-06-11 17:05:20] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
[2022-06-11 17:05:20] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 169 rows 115 cols
[2022-06-11 17:05:20] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 17:05:20] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/178 places, 169/446 transitions.
Finished structural reductions, in 1 iterations. Remains : 115/178 places, 169/446 transitions.
Stuttering acceptance computed with spot in 25 ms :[(OR p2 p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(OR p1 p2), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s108 1)), p2:(AND (GEQ s1 1) (GEQ s110 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22454 reset in 166 ms.
Product exploration explored 100000 steps with 22262 reset in 169 ms.
Computed a total of 22 stabilizing places and 24 stable transitions
Computed a total of 22 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (OR p1 p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (OR p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 172 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 36 ms :[(OR p2 p1)]
Incomplete random walk after 10000 steps, including 2160 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 474 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 463 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Finished probabilistic random walk after 4296 steps, run visited all 2 properties in 23 ms. (steps per millisecond=186 )
Probabilistic random walk after 4296 steps, saw 2112 distinct states, run finished after 23 ms. (steps per millisecond=186 ) properties seen :2
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (OR p1 p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (OR p1 p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (OR p1 p2))]
Knowledge based reduction with 5 factoid took 186 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 39 ms :[(OR p2 p1)]
Stuttering acceptance computed with spot in 41 ms :[(OR p2 p1)]
Support contains 3 out of 115 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 169/169 transitions.
Applied a total of 0 rules in 12 ms. Remains 115 /115 variables (removed 0) and now considering 169/169 (removed 0) transitions.
// Phase 1: matrix 169 rows 115 cols
[2022-06-11 17:05:21] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 17:05:21] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 169 rows 115 cols
[2022-06-11 17:05:21] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 17:05:21] [INFO ] State equation strengthened by 89 read => feed constraints.
[2022-06-11 17:05:21] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
[2022-06-11 17:05:21] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 169 rows 115 cols
[2022-06-11 17:05:21] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 17:05:21] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 115/115 places, 169/169 transitions.
Computed a total of 22 stabilizing places and 24 stable transitions
Computed a total of 22 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (OR p1 p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (OR p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 174 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 30 ms :[(OR p2 p1)]
Incomplete random walk after 10000 steps, including 2195 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 467 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 463 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Finished probabilistic random walk after 4296 steps, run visited all 2 properties in 26 ms. (steps per millisecond=165 )
Probabilistic random walk after 4296 steps, saw 2112 distinct states, run finished after 26 ms. (steps per millisecond=165 ) properties seen :2
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (OR p1 p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (OR p1 p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (OR p1 p2))]
Knowledge based reduction with 5 factoid took 190 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 26 ms :[(OR p2 p1)]
Stuttering acceptance computed with spot in 44 ms :[(OR p2 p1)]
Stuttering acceptance computed with spot in 33 ms :[(OR p2 p1)]
Product exploration explored 100000 steps with 22662 reset in 167 ms.
Product exploration explored 100000 steps with 22578 reset in 168 ms.
Built C files in :
/tmp/ltsmin16149225671961189160
[2022-06-11 17:05:22] [INFO ] Computing symmetric may disable matrix : 169 transitions.
[2022-06-11 17:05:22] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 17:05:22] [INFO ] Computing symmetric may enable matrix : 169 transitions.
[2022-06-11 17:05:22] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 17:05:22] [INFO ] Computing Do-Not-Accords matrix : 169 transitions.
[2022-06-11 17:05:22] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 17:05:22] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16149225671961189160
Running compilation step : cd /tmp/ltsmin16149225671961189160;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 325 ms.
Running link step : cd /tmp/ltsmin16149225671961189160;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin16149225671961189160;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased383595612876933744.hoa' '--buchi-type=spotba'
LTSmin run took 129 ms.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-11 finished in 3522 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(!((F((F(!p0)||p1)) U p2) U p3)))'
Support contains 5 out of 178 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 178/178 places, 446/446 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 160 transition count 245
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 160 transition count 245
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 160 transition count 244
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 54 place count 143 transition count 227
Iterating global reduction 1 with 17 rules applied. Total rules applied 71 place count 143 transition count 227
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 79 place count 143 transition count 219
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 90 place count 132 transition count 198
Iterating global reduction 2 with 11 rules applied. Total rules applied 101 place count 132 transition count 198
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 106 place count 132 transition count 193
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 109 place count 129 transition count 190
Iterating global reduction 3 with 3 rules applied. Total rules applied 112 place count 129 transition count 190
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 114 place count 127 transition count 188
Iterating global reduction 3 with 2 rules applied. Total rules applied 116 place count 127 transition count 188
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 118 place count 125 transition count 186
Iterating global reduction 3 with 2 rules applied. Total rules applied 120 place count 125 transition count 186
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 122 place count 123 transition count 184
Iterating global reduction 3 with 2 rules applied. Total rules applied 124 place count 123 transition count 184
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 125 place count 122 transition count 181
Iterating global reduction 3 with 1 rules applied. Total rules applied 126 place count 122 transition count 181
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 127 place count 121 transition count 180
Iterating global reduction 3 with 1 rules applied. Total rules applied 128 place count 121 transition count 180
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 129 place count 120 transition count 179
Iterating global reduction 3 with 1 rules applied. Total rules applied 130 place count 120 transition count 179
Applied a total of 130 rules in 41 ms. Remains 120 /178 variables (removed 58) and now considering 179/446 (removed 267) transitions.
// Phase 1: matrix 179 rows 120 cols
[2022-06-11 17:05:23] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-11 17:05:23] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 179 rows 120 cols
[2022-06-11 17:05:23] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 17:05:23] [INFO ] State equation strengthened by 95 read => feed constraints.
[2022-06-11 17:05:23] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
[2022-06-11 17:05:23] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 179 rows 120 cols
[2022-06-11 17:05:23] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 17:05:23] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 120/178 places, 179/446 transitions.
Finished structural reductions, in 1 iterations. Remains : 120/178 places, 179/446 transitions.
Stuttering acceptance computed with spot in 177 ms :[p3, (OR (AND (NOT p0) p2 p3) (AND p1 p2 p3)), (AND p2 p3), (OR (AND (NOT p0) p3) (AND p1 p3))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) p2), acceptance={0, 1} source=0 dest: 0}, { cond=p3, acceptance={0, 1, 2} source=0 dest: 0}, { cond=(AND (NOT p3) p0 (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p3) (NOT p0) (NOT p2)) (AND (NOT p3) p1 (NOT p2))), acceptance={0} source=0 dest: 2}], [{ cond=(OR (AND (NOT p3) (NOT p0) p2) (AND (NOT p3) p1 p2)), acceptance={0, 1} source=1 dest: 0}, { cond=(OR (AND p3 (NOT p0) p2) (AND p3 p1 p2)), acceptance={0, 1, 2} source=1 dest: 0}, { cond=(AND (NOT p3) p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND p3 p0 (NOT p1) (NOT p2)), acceptance={2} source=1 dest: 1}, { cond=(OR (AND (NOT p3) (NOT p0) (NOT p2)) (AND (NOT p3) p1 (NOT p2))), acceptance={0} source=1 dest: 2}, { cond=(OR (AND p3 (NOT p0) (NOT p2)) (AND p3 p1 (NOT p2))), acceptance={0, 2} source=1 dest: 2}, { cond=(AND (NOT p3) p0 (NOT p1) p2), acceptance={1} source=1 dest: 3}, { cond=(AND p3 p0 (NOT p1) p2), acceptance={1, 2} source=1 dest: 3}], [{ cond=(AND (NOT p3) p2), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p3 p2), acceptance={0, 1, 2} source=2 dest: 0}, { cond=(AND (NOT p3) p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p3 p0 (NOT p1) (NOT p2)), acceptance={2} source=2 dest: 1}, { cond=(OR (AND (NOT p3) (NOT p0) (NOT p2)) (AND (NOT p3) p1 (NOT p2))), acceptance={0} source=2 dest: 2}, { cond=(OR (AND p3 (NOT p0) (NOT p2)) (AND p3 p1 (NOT p2))), acceptance={0, 2} source=2 dest: 2}], [{ cond=(OR (AND (NOT p3) (NOT p0) p2) (AND (NOT p3) p1 p2)), acceptance={0, 1} source=3 dest: 0}, { cond=(OR (AND p3 (NOT p0)) (AND p3 p1)), acceptance={0, 1, 2} source=3 dest: 0}, { cond=(AND (NOT p3) p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(OR (AND (NOT p3) (NOT p0) (NOT p2)) (AND (NOT p3) p1 (NOT p2))), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p3) p0 (NOT p1) p2), acceptance={1} source=3 dest: 3}, { cond=(AND p3 p0 (NOT p1)), acceptance={1, 2} source=3 dest: 3}]], initial=0, aps=[p3:(AND (GEQ s1 1) (GEQ s90 1)), p2:(AND (GEQ s1 1) (GEQ s115 1)), p0:(AND (GEQ s1 1) (GEQ s113 1)), p1:(AND (GEQ s1 1) (GEQ s114 1))], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 22452 reset in 206 ms.
Product exploration explored 100000 steps with 22598 reset in 325 ms.
Computed a total of 22 stabilizing places and 24 stable transitions
Computed a total of 22 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (X (NOT p3)), (X (NOT (AND (NOT p3) p0 (NOT p1) p2))), (X (NOT (OR (AND p3 (NOT p0) p2) (AND p3 p1 p2)))), (X (NOT (AND p3 p0 (NOT p1) p2))), (X (NOT (AND (NOT p3) p2))), (X (NOT (OR (AND p3 (NOT p0) (NOT p2)) (AND p3 p1 (NOT p2))))), (X (NOT (AND (NOT p3) p0 (NOT p1) (NOT p2)))), (X (NOT (AND p3 p0 (NOT p1) (NOT p2)))), (X (NOT (OR (AND (NOT p3) (NOT p0) p2) (AND (NOT p3) p1 p2)))), (X (OR (AND (NOT p3) (NOT p0) (NOT p2)) (AND (NOT p3) p1 (NOT p2)))), (X (NOT (AND p3 p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p3) p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) p0 (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p3) (NOT p0) p2) (AND (NOT p3) p1 p2))))), (X (X (OR (AND (NOT p3) (NOT p0) (NOT p2)) (AND (NOT p3) p1 (NOT p2))))), (X (X (NOT (OR (AND p3 (NOT p0) p2) (AND p3 p1 p2))))), (X (X (NOT (AND p3 p0 (NOT p1) p2)))), (X (X (NOT (AND p3 p0 (NOT p1))))), (X (X (NOT (OR (AND p3 (NOT p0) (NOT p2)) (AND p3 p1 (NOT p2)))))), (X (X (NOT (AND p3 p0 (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p3 (NOT p0)) (AND p3 p1))))), (X (X (NOT (AND p3 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 1140 ms. Reduced automaton from 4 states, 24 edges and 4 AP to 4 states, 24 edges and 4 AP.
Stuttering acceptance computed with spot in 153 ms :[p3, (OR (AND (NOT p0) p2 p3) (AND p1 p2 p3)), (AND p2 p3), (OR (AND (NOT p0) p3) (AND p1 p3))]
Incomplete random walk after 10000 steps, including 2246 resets, run finished after 253 ms. (steps per millisecond=39 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 459 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 462 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 488 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 471 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 489 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 474 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 482 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 501 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 496 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 443 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 468 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 439 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 458 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 13) seen :0
Interrupted probabilistic random walk after 291452 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :{2=1, 3=1}
Probabilistic random walk after 291452 steps, saw 128714 distinct states, run finished after 3001 ms. (steps per millisecond=97 ) properties seen :2
Running SMT prover for 11 properties.
// Phase 1: matrix 179 rows 120 cols
[2022-06-11 17:05:30] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 17:05:30] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 17:05:30] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 17:05:30] [INFO ] After 169ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2022-06-11 17:05:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 17:05:30] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 17:05:30] [INFO ] After 307ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :9
[2022-06-11 17:05:30] [INFO ] State equation strengthened by 95 read => feed constraints.
[2022-06-11 17:05:31] [INFO ] After 359ms SMT Verify possible using 95 Read/Feed constraints in natural domain returned unsat :2 sat :9
[2022-06-11 17:05:31] [INFO ] After 749ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :9
Attempting to minimize the solution found.
Minimization took 360 ms.
[2022-06-11 17:05:31] [INFO ] After 1495ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :9
Fused 11 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 1327 ms.
Support contains 5 out of 120 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 120/120 places, 179/179 transitions.
Graph (complete) has 378 edges and 120 vertex of which 119 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 119 transition count 177
Applied a total of 3 rules in 6 ms. Remains 119 /120 variables (removed 1) and now considering 177/179 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 119/120 places, 177/179 transitions.
Incomplete random walk after 10000 steps, including 2234 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 472 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 479 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 461 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 487 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 478 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 464 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 461 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 436 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 485 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 311863 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :{}
Probabilistic random walk after 311863 steps, saw 138259 distinct states, run finished after 3001 ms. (steps per millisecond=103 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 177 rows 119 cols
[2022-06-11 17:05:37] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 17:05:37] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 17:05:37] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 17:05:37] [INFO ] After 190ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-06-11 17:05:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 17:05:37] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 17:05:37] [INFO ] After 298ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2022-06-11 17:05:37] [INFO ] State equation strengthened by 93 read => feed constraints.
[2022-06-11 17:05:37] [INFO ] After 362ms SMT Verify possible using 93 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2022-06-11 17:05:38] [INFO ] After 788ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 385 ms.
[2022-06-11 17:05:38] [INFO ] After 1551ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 889 ms.
Support contains 5 out of 119 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 119/119 places, 177/177 transitions.
Applied a total of 0 rules in 3 ms. Remains 119 /119 variables (removed 0) and now considering 177/177 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 119/119 places, 177/177 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 119/119 places, 177/177 transitions.
Applied a total of 0 rules in 4 ms. Remains 119 /119 variables (removed 0) and now considering 177/177 (removed 0) transitions.
// Phase 1: matrix 177 rows 119 cols
[2022-06-11 17:05:39] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 17:05:39] [INFO ] Implicit Places using invariants in 68 ms returned []
// Phase 1: matrix 177 rows 119 cols
[2022-06-11 17:05:39] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 17:05:39] [INFO ] State equation strengthened by 93 read => feed constraints.
[2022-06-11 17:05:40] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
[2022-06-11 17:05:40] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 177 rows 119 cols
[2022-06-11 17:05:40] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 17:05:40] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 119/119 places, 177/177 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 119 transition count 171
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 114 transition count 171
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 11 place count 114 transition count 154
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 45 place count 97 transition count 154
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 65 place count 87 transition count 144
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 67 place count 86 transition count 155
Applied a total of 67 rules in 10 ms. Remains 86 /119 variables (removed 33) and now considering 155/177 (removed 22) transitions.
Running SMT prover for 9 properties.
// Phase 1: matrix 155 rows 86 cols
[2022-06-11 17:05:40] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 17:05:40] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 17:05:40] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-11 17:05:40] [INFO ] After 153ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-06-11 17:05:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 17:05:40] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 17:05:40] [INFO ] After 244ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2022-06-11 17:05:40] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2022-06-11 17:05:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2022-06-11 17:05:40] [INFO ] After 555ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 209 ms.
[2022-06-11 17:05:41] [INFO ] After 816ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
[2022-06-11 17:05:41] [INFO ] Flatten gal took : 7 ms
[2022-06-11 17:05:41] [INFO ] Flatten gal took : 8 ms
[2022-06-11 17:05:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6789982324621839841.gal : 1 ms
[2022-06-11 17:05:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5647858298414918538.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms11702962572575635169;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6789982324621839841.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5647858298414918538.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality5647858298414918538.prop.
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :9 after 28
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :28 after 46
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :46 after 162
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :162 after 194
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :194 after 292
Reachability property apf11 is true.
Reachability property apf7 is true.
Reachability property apf1 is true.
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :292 after 962
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :962 after 2564
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :2564 after 5618
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :5618 after 40376
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :40376 after 277970
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :277970 after 5.47967e+06
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :5.47967e+06 after 1.2047e+08
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :1.2047e+08 after 5.00275e+09
Detected timeout of ITS tools.
[2022-06-11 17:05:56] [INFO ] Flatten gal took : 12 ms
[2022-06-11 17:05:56] [INFO ] Applying decomposition
[2022-06-11 17:05:56] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13536132680853877973.txt' '-o' '/tmp/graph13536132680853877973.bin' '-w' '/tmp/graph13536132680853877973.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13536132680853877973.bin' '-l' '-1' '-v' '-w' '/tmp/graph13536132680853877973.weights' '-q' '0' '-e' '0.001'
[2022-06-11 17:05:56] [INFO ] Decomposing Gal with order
[2022-06-11 17:05:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 17:05:56] [INFO ] Removed a total of 89 redundant transitions.
[2022-06-11 17:05:56] [INFO ] Flatten gal took : 18 ms
[2022-06-11 17:05:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 57 labels/synchronizations in 2 ms.
[2022-06-11 17:05:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6370826188574307109.gal : 1 ms
[2022-06-11 17:05:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality875915557495955072.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms11702962572575635169;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6370826188574307109.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality875915557495955072.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...297
Loading property file /tmp/ReachabilityCardinality875915557495955072.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :6 after 12
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :12 after 33
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :33 after 46
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :46 after 68
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :180 after 248
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :576 after 1181
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :6755 after 7689
Reachability property apf12 is true.
Reachability property apf6 is true.
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :43576 after 88174
Reachability property apf4 is true.
Reachability property apf0 is true.
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :222942 after 301198
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5910581471925466346
[2022-06-11 17:06:11] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5910581471925466346
Running compilation step : cd /tmp/ltsmin5910581471925466346;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 251 ms.
Running link step : cd /tmp/ltsmin5910581471925466346;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin5910581471925466346;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf5==true'
LTSmin run took 920 ms.
Found Violation
Running LTSmin : cd /tmp/ltsmin5910581471925466346;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf10==true'
LTSmin run took 948 ms.
Found Violation
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (X (NOT p3)), (X (NOT (AND (NOT p3) p0 (NOT p1) p2))), (X (NOT (OR (AND p3 (NOT p0) p2) (AND p3 p1 p2)))), (X (NOT (AND p3 p0 (NOT p1) p2))), (X (NOT (AND (NOT p3) p2))), (X (NOT (OR (AND p3 (NOT p0) (NOT p2)) (AND p3 p1 (NOT p2))))), (X (NOT (AND (NOT p3) p0 (NOT p1) (NOT p2)))), (X (NOT (AND p3 p0 (NOT p1) (NOT p2)))), (X (NOT (OR (AND (NOT p3) (NOT p0) p2) (AND (NOT p3) p1 p2)))), (X (OR (AND (NOT p3) (NOT p0) (NOT p2)) (AND (NOT p3) p1 (NOT p2)))), (X (NOT (AND p3 p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p3) p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) p0 (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p3) (NOT p0) p2) (AND (NOT p3) p1 p2))))), (X (X (OR (AND (NOT p3) (NOT p0) (NOT p2)) (AND (NOT p3) p1 (NOT p2))))), (X (X (NOT (OR (AND p3 (NOT p0) p2) (AND p3 p1 p2))))), (X (X (NOT (AND p3 p0 (NOT p1) p2)))), (X (X (NOT (AND p3 p0 (NOT p1))))), (X (X (NOT (OR (AND p3 (NOT p0) (NOT p2)) (AND p3 p1 (NOT p2)))))), (X (X (NOT (AND p3 p0 (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p3 (NOT p0)) (AND p3 p1))))), (X (X (NOT (AND p3 p2)))), (G (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (G (NOT (AND p0 (NOT p1) p2 p3)))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3))))), (F (AND p0 (NOT p1) (NOT p2) (NOT p3)))]
Knowledge based reduction with 27 factoid took 1121 ms. Reduced automaton from 4 states, 24 edges and 4 AP to 2 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 69 ms :[p3, (AND p2 p3)]
Stuttering acceptance computed with spot in 73 ms :[p3, (AND p2 p3)]
Support contains 3 out of 120 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 179/179 transitions.
Applied a total of 0 rules in 6 ms. Remains 120 /120 variables (removed 0) and now considering 179/179 (removed 0) transitions.
// Phase 1: matrix 179 rows 120 cols
[2022-06-11 17:06:14] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-11 17:06:14] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 179 rows 120 cols
[2022-06-11 17:06:14] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 17:06:14] [INFO ] State equation strengthened by 95 read => feed constraints.
[2022-06-11 17:06:15] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
[2022-06-11 17:06:15] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 179 rows 120 cols
[2022-06-11 17:06:15] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 17:06:15] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 120/120 places, 179/179 transitions.
Computed a total of 22 stabilizing places and 24 stable transitions
Computed a total of 22 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p3)), (X (NOT p3)), (X (AND (NOT p2) (NOT p3))), (X (NOT (AND p2 p3))), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND (NOT p2) p3))), (X (X (NOT p3))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p2) p3))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 380 ms. Reduced automaton from 2 states, 7 edges and 2 AP to 2 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 60 ms :[p3, (AND p2 p3)]
Incomplete random walk after 10000 steps, including 2215 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 457 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 472 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 501 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 473 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 471 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 435291 steps, run timeout after 3001 ms. (steps per millisecond=145 ) properties seen :{}
Probabilistic random walk after 435291 steps, saw 189616 distinct states, run finished after 3001 ms. (steps per millisecond=145 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 179 rows 120 cols
[2022-06-11 17:06:19] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 17:06:19] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 17:06:19] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 17:06:19] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-06-11 17:06:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 17:06:19] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2022-06-11 17:06:19] [INFO ] After 164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-06-11 17:06:19] [INFO ] State equation strengthened by 95 read => feed constraints.
[2022-06-11 17:06:19] [INFO ] After 185ms SMT Verify possible using 95 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-06-11 17:06:19] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 4 ms to minimize.
[2022-06-11 17:06:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2022-06-11 17:06:20] [INFO ] After 451ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 173 ms.
[2022-06-11 17:06:20] [INFO ] After 854ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 426 ms.
Support contains 3 out of 120 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 120/120 places, 179/179 transitions.
Graph (complete) has 378 edges and 120 vertex of which 119 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 119 transition count 177
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 117 transition count 149
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 117 transition count 149
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 115 transition count 147
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 115 transition count 147
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 13 place count 115 transition count 145
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 15 place count 113 transition count 141
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 113 transition count 141
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 19 place count 113 transition count 139
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 21 place count 111 transition count 137
Iterating global reduction 3 with 2 rules applied. Total rules applied 23 place count 111 transition count 137
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 25 place count 109 transition count 135
Iterating global reduction 3 with 2 rules applied. Total rules applied 27 place count 109 transition count 135
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 28 place count 108 transition count 134
Iterating global reduction 3 with 1 rules applied. Total rules applied 29 place count 108 transition count 134
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 31 place count 108 transition count 132
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 32 place count 107 transition count 131
Iterating global reduction 4 with 1 rules applied. Total rules applied 33 place count 107 transition count 131
Applied a total of 33 rules in 15 ms. Remains 107 /120 variables (removed 13) and now considering 131/179 (removed 48) transitions.
Finished structural reductions, in 1 iterations. Remains : 107/120 places, 131/179 transitions.
Incomplete random walk after 10000 steps, including 2296 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 440 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 465 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 472 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 465 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 458 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 520385 steps, run timeout after 3001 ms. (steps per millisecond=173 ) properties seen :{0=1, 2=1}
Probabilistic random walk after 520385 steps, saw 235771 distinct states, run finished after 3002 ms. (steps per millisecond=173 ) properties seen :2
Running SMT prover for 3 properties.
// Phase 1: matrix 131 rows 107 cols
[2022-06-11 17:06:24] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 17:06:24] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 17:06:24] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 17:06:24] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-11 17:06:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 17:06:24] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 17:06:24] [INFO ] After 80ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-11 17:06:24] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-06-11 17:06:24] [INFO ] After 54ms SMT Verify possible using 58 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-06-11 17:06:24] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2022-06-11 17:06:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2022-06-11 17:06:24] [INFO ] After 166ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 91 ms.
[2022-06-11 17:06:24] [INFO ] After 376ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 43 ms.
Support contains 3 out of 107 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 107/107 places, 131/131 transitions.
Applied a total of 0 rules in 8 ms. Remains 107 /107 variables (removed 0) and now considering 131/131 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 107/107 places, 131/131 transitions.
Incomplete random walk after 10000 steps, including 2252 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 470 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 485 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 492 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 557187 steps, run timeout after 3001 ms. (steps per millisecond=185 ) properties seen :{}
Probabilistic random walk after 557187 steps, saw 251670 distinct states, run finished after 3001 ms. (steps per millisecond=185 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 131 rows 107 cols
[2022-06-11 17:06:28] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 17:06:28] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 17:06:28] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 17:06:28] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-11 17:06:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 17:06:28] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 17:06:28] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-11 17:06:28] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-06-11 17:06:28] [INFO ] After 60ms SMT Verify possible using 58 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-06-11 17:06:28] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2022-06-11 17:06:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2022-06-11 17:06:28] [INFO ] After 182ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 101 ms.
[2022-06-11 17:06:28] [INFO ] After 416ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 48 ms.
Support contains 3 out of 107 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 107/107 places, 131/131 transitions.
Applied a total of 0 rules in 2 ms. Remains 107 /107 variables (removed 0) and now considering 131/131 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 107/107 places, 131/131 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 107/107 places, 131/131 transitions.
Applied a total of 0 rules in 2 ms. Remains 107 /107 variables (removed 0) and now considering 131/131 (removed 0) transitions.
// Phase 1: matrix 131 rows 107 cols
[2022-06-11 17:06:28] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-11 17:06:28] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 131 rows 107 cols
[2022-06-11 17:06:28] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-11 17:06:28] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-06-11 17:06:28] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
[2022-06-11 17:06:28] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 131 rows 107 cols
[2022-06-11 17:06:28] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-11 17:06:28] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 107/107 places, 131/131 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 107 transition count 125
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 102 transition count 125
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 11 place count 102 transition count 108
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 45 place count 85 transition count 108
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 59 place count 78 transition count 101
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 77 transition count 111
Applied a total of 61 rules in 9 ms. Remains 77 /107 variables (removed 30) and now considering 111/131 (removed 20) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 111 rows 77 cols
[2022-06-11 17:06:28] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 17:06:28] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-06-11 17:06:28] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 17:06:29] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-11 17:06:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 17:06:29] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 17:06:29] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-11 17:06:29] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2022-06-11 17:06:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2022-06-11 17:06:29] [INFO ] After 188ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 48 ms.
[2022-06-11 17:06:29] [INFO ] After 274ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2022-06-11 17:06:29] [INFO ] Flatten gal took : 6 ms
[2022-06-11 17:06:29] [INFO ] Flatten gal took : 5 ms
[2022-06-11 17:06:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11207649081331504591.gal : 0 ms
[2022-06-11 17:06:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11417622776200531798.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms9442086000941967149;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11207649081331504591.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11417622776200531798.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality11417622776200531798.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :9 after 28
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :28 after 37
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :37 after 116
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :116 after 194
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :194 after 324
Reachability property apf4 is true.
Reachability property apf1 is true.
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :324 after 2416
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2416 after 7454
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :7454 after 51018
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :51018 after 559044
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :559044 after 1.10814e+07
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.10814e+07 after 3.32487e+08
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :3.32487e+08 after 1.15345e+10
Detected timeout of ITS tools.
[2022-06-11 17:06:44] [INFO ] Flatten gal took : 6 ms
[2022-06-11 17:06:44] [INFO ] Applying decomposition
[2022-06-11 17:06:44] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13184141497092344089.txt' '-o' '/tmp/graph13184141497092344089.bin' '-w' '/tmp/graph13184141497092344089.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13184141497092344089.bin' '-l' '-1' '-v' '-w' '/tmp/graph13184141497092344089.weights' '-q' '0' '-e' '0.001'
[2022-06-11 17:06:44] [INFO ] Decomposing Gal with order
[2022-06-11 17:06:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 17:06:44] [INFO ] Removed a total of 79 redundant transitions.
[2022-06-11 17:06:44] [INFO ] Flatten gal took : 15 ms
[2022-06-11 17:06:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 39 labels/synchronizations in 2 ms.
[2022-06-11 17:06:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8301439311373375693.gal : 2 ms
[2022-06-11 17:06:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15773387076955296969.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms9442086000941967149;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8301439311373375693.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15773387076955296969.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality15773387076955296969.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 70
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :70 after 158
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :158 after 1000
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1000 after 11835
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17484259765555905530
[2022-06-11 17:06:59] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17484259765555905530
Running compilation step : cd /tmp/ltsmin17484259765555905530;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 187 ms.
Running link step : cd /tmp/ltsmin17484259765555905530;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin17484259765555905530;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf3==true'
LTSmin run took 603 ms.
Found Violation
Knowledge obtained : [(AND (NOT p2) (NOT p3)), (X (NOT p3)), (X (AND (NOT p2) (NOT p3))), (X (NOT (AND p2 p3))), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND (NOT p2) p3))), (X (X (NOT p3))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p2) p3))))]
False Knowledge obtained : [(F (AND p2 (NOT p3))), (F (NOT (AND (NOT p2) (NOT p3))))]
Knowledge based reduction with 11 factoid took 411 ms. Reduced automaton from 2 states, 7 edges and 2 AP to 2 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 54 ms :[p3, (AND p2 p3)]
Stuttering acceptance computed with spot in 64 ms :[p3, (AND p2 p3)]
Stuttering acceptance computed with spot in 66 ms :[p3, (AND p2 p3)]
Product exploration explored 100000 steps with 22422 reset in 178 ms.
Product exploration explored 100000 steps with 22325 reset in 183 ms.
Built C files in :
/tmp/ltsmin13785538402639240352
[2022-06-11 17:07:01] [INFO ] Computing symmetric may disable matrix : 179 transitions.
[2022-06-11 17:07:01] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 17:07:01] [INFO ] Computing symmetric may enable matrix : 179 transitions.
[2022-06-11 17:07:01] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 17:07:01] [INFO ] Computing Do-Not-Accords matrix : 179 transitions.
[2022-06-11 17:07:01] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 17:07:01] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13785538402639240352
Running compilation step : cd /tmp/ltsmin13785538402639240352;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 338 ms.
Running link step : cd /tmp/ltsmin13785538402639240352;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin13785538402639240352;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6005849620666636780.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 179/179 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 118 transition count 151
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 118 transition count 151
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 116 transition count 149
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 116 transition count 149
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 116 transition count 147
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 114 transition count 143
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 114 transition count 143
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 16 place count 114 transition count 141
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 18 place count 112 transition count 139
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 112 transition count 139
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 22 place count 110 transition count 137
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 110 transition count 137
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 109 transition count 136
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 109 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 28 place count 109 transition count 134
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 29 place count 108 transition count 133
Iterating global reduction 3 with 1 rules applied. Total rules applied 30 place count 108 transition count 133
Applied a total of 30 rules in 17 ms. Remains 108 /120 variables (removed 12) and now considering 133/179 (removed 46) transitions.
// Phase 1: matrix 133 rows 108 cols
[2022-06-11 17:07:16] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-11 17:07:16] [INFO ] Implicit Places using invariants in 68 ms returned []
// Phase 1: matrix 133 rows 108 cols
[2022-06-11 17:07:16] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 17:07:16] [INFO ] State equation strengthened by 60 read => feed constraints.
[2022-06-11 17:07:16] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
[2022-06-11 17:07:16] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 133 rows 108 cols
[2022-06-11 17:07:16] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 17:07:16] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/120 places, 133/179 transitions.
Finished structural reductions, in 1 iterations. Remains : 108/120 places, 133/179 transitions.
Built C files in :
/tmp/ltsmin13999039938761981784
[2022-06-11 17:07:16] [INFO ] Computing symmetric may disable matrix : 133 transitions.
[2022-06-11 17:07:16] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 17:07:16] [INFO ] Computing symmetric may enable matrix : 133 transitions.
[2022-06-11 17:07:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 17:07:16] [INFO ] Computing Do-Not-Accords matrix : 133 transitions.
[2022-06-11 17:07:16] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 17:07:16] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13999039938761981784
Running compilation step : cd /tmp/ltsmin13999039938761981784;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 273 ms.
Running link step : cd /tmp/ltsmin13999039938761981784;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin13999039938761981784;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14959857870992161038.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-11 17:07:31] [INFO ] Flatten gal took : 8 ms
[2022-06-11 17:07:31] [INFO ] Flatten gal took : 7 ms
[2022-06-11 17:07:31] [INFO ] Time to serialize gal into /tmp/LTL10714389965712173163.gal : 1 ms
[2022-06-11 17:07:31] [INFO ] Time to serialize properties into /tmp/LTL10925842308714361094.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10714389965712173163.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10925842308714361094.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1071438...268
Read 1 LTL properties
Checking formula 0 : !((F(!(((F((F(!("((s1>=1)&&(l2226>=1))")))||("((s1>=1)&&(l2229>=1))")))U("((s1>=1)&&(l2237>=1))"))U("((s1>=1)&&(l1676>=1))")))))
Formula 0 simplified : !F!((F("((s1>=1)&&(l2229>=1))" | F!"((s1>=1)&&(l2226>=1))") U "((s1>=1)&&(l2237>=1))") U "((s1>=1)&&(l1676>=1))")
Detected timeout of ITS tools.
[2022-06-11 17:07:46] [INFO ] Flatten gal took : 9 ms
[2022-06-11 17:07:46] [INFO ] Applying decomposition
[2022-06-11 17:07:46] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13785381694582765196.txt' '-o' '/tmp/graph13785381694582765196.bin' '-w' '/tmp/graph13785381694582765196.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13785381694582765196.bin' '-l' '-1' '-v' '-w' '/tmp/graph13785381694582765196.weights' '-q' '0' '-e' '0.001'
[2022-06-11 17:07:46] [INFO ] Decomposing Gal with order
[2022-06-11 17:07:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 17:07:46] [INFO ] Removed a total of 158 redundant transitions.
[2022-06-11 17:07:46] [INFO ] Flatten gal took : 19 ms
[2022-06-11 17:07:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 188 labels/synchronizations in 7 ms.
[2022-06-11 17:07:46] [INFO ] Time to serialize gal into /tmp/LTL8966624978948341247.gal : 2 ms
[2022-06-11 17:07:46] [INFO ] Time to serialize properties into /tmp/LTL1373305146815862870.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8966624978948341247.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1373305146815862870.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8966624...245
Read 1 LTL properties
Checking formula 0 : !((F(!(((F((F(!("((i4.i1.u1.s1>=1)&&(i5.u21.l2226>=1))")))||("((i4.i1.u1.s1>=1)&&(i5.u21.l2229>=1))")))U("((i4.i1.u1.s1>=1)&&(i5.u21.l...216
Formula 0 simplified : !F!((F("((i4.i1.u1.s1>=1)&&(i5.u21.l2229>=1))" | F!"((i4.i1.u1.s1>=1)&&(i5.u21.l2226>=1))") U "((i4.i1.u1.s1>=1)&&(i5.u21.l2237>=1))...203
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12155693548257786100
[2022-06-11 17:08:02] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12155693548257786100
Running compilation step : cd /tmp/ltsmin12155693548257786100;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 266 ms.
Running link step : cd /tmp/ltsmin12155693548257786100;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin12155693548257786100;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(!((<>((<>(!(LTLAPp0==true))||(LTLAPp1==true))) U (LTLAPp2==true)) U (LTLAPp3==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-12 finished in 173784 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(((G(p1)&&p0)||X(p2)))&&G(p3))))'
Support contains 4 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 446/446 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 159 transition count 231
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 159 transition count 231
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 57 place count 140 transition count 212
Iterating global reduction 0 with 19 rules applied. Total rules applied 76 place count 140 transition count 212
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 84 place count 140 transition count 204
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 96 place count 128 transition count 181
Iterating global reduction 1 with 12 rules applied. Total rules applied 108 place count 128 transition count 181
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 117 place count 128 transition count 172
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 120 place count 125 transition count 169
Iterating global reduction 2 with 3 rules applied. Total rules applied 123 place count 125 transition count 169
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 126 place count 122 transition count 166
Iterating global reduction 2 with 3 rules applied. Total rules applied 129 place count 122 transition count 166
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 132 place count 119 transition count 163
Iterating global reduction 2 with 3 rules applied. Total rules applied 135 place count 119 transition count 163
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 138 place count 119 transition count 160
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 141 place count 116 transition count 157
Iterating global reduction 3 with 3 rules applied. Total rules applied 144 place count 116 transition count 157
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 145 place count 115 transition count 154
Iterating global reduction 3 with 1 rules applied. Total rules applied 146 place count 115 transition count 154
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 147 place count 114 transition count 153
Iterating global reduction 3 with 1 rules applied. Total rules applied 148 place count 114 transition count 153
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 149 place count 113 transition count 152
Iterating global reduction 3 with 1 rules applied. Total rules applied 150 place count 113 transition count 152
Applied a total of 150 rules in 19 ms. Remains 113 /178 variables (removed 65) and now considering 152/446 (removed 294) transitions.
// Phase 1: matrix 152 rows 113 cols
[2022-06-11 17:08:17] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 17:08:17] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 152 rows 113 cols
[2022-06-11 17:08:17] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-11 17:08:17] [INFO ] State equation strengthened by 74 read => feed constraints.
[2022-06-11 17:08:17] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
// Phase 1: matrix 152 rows 113 cols
[2022-06-11 17:08:17] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 17:08:17] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 113/178 places, 152/446 transitions.
Finished structural reductions, in 1 iterations. Remains : 113/178 places, 152/446 transitions.
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), true, (NOT p3), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p3), acceptance={} source=1 dest: 2}, { cond=p3, acceptance={} source=1 dest: 3}, { cond=(OR (AND (NOT p0) p3) (AND (NOT p1) p3)), acceptance={} source=1 dest: 4}, { cond=(AND p0 p1 p3), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={} source=3 dest: 2}, { cond=p3, acceptance={} source=3 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=4 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p3:(OR (LT s1 1) (LT s107 1)), p0:(AND (GEQ s1 1) (GEQ s107 1)), p1:(AND (GEQ s1 1) (GEQ s108 1)), p2:(AND (GEQ s1 1) (GEQ s83 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]]
Stuttering criterion allowed to conclude after 23 steps with 4 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-13 finished in 644 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X(p0)||F(p1))))))'
Support contains 3 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 446/446 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 158 transition count 230
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 158 transition count 230
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 158 transition count 229
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 60 place count 139 transition count 210
Iterating global reduction 1 with 19 rules applied. Total rules applied 79 place count 139 transition count 210
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 88 place count 139 transition count 201
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 101 place count 126 transition count 177
Iterating global reduction 2 with 13 rules applied. Total rules applied 114 place count 126 transition count 177
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 123 place count 126 transition count 168
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 127 place count 122 transition count 164
Iterating global reduction 3 with 4 rules applied. Total rules applied 131 place count 122 transition count 164
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 134 place count 119 transition count 161
Iterating global reduction 3 with 3 rules applied. Total rules applied 137 place count 119 transition count 161
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 139 place count 117 transition count 159
Iterating global reduction 3 with 2 rules applied. Total rules applied 141 place count 117 transition count 159
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 143 place count 115 transition count 157
Iterating global reduction 3 with 2 rules applied. Total rules applied 145 place count 115 transition count 157
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 146 place count 114 transition count 154
Iterating global reduction 3 with 1 rules applied. Total rules applied 147 place count 114 transition count 154
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 148 place count 113 transition count 153
Iterating global reduction 3 with 1 rules applied. Total rules applied 149 place count 113 transition count 153
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 150 place count 112 transition count 152
Iterating global reduction 3 with 1 rules applied. Total rules applied 151 place count 112 transition count 152
Applied a total of 151 rules in 13 ms. Remains 112 /178 variables (removed 66) and now considering 152/446 (removed 294) transitions.
// Phase 1: matrix 152 rows 112 cols
[2022-06-11 17:08:17] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 17:08:17] [INFO ] Implicit Places using invariants in 67 ms returned []
// Phase 1: matrix 152 rows 112 cols
[2022-06-11 17:08:17] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 17:08:17] [INFO ] State equation strengthened by 75 read => feed constraints.
[2022-06-11 17:08:18] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
// Phase 1: matrix 152 rows 112 cols
[2022-06-11 17:08:18] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 17:08:18] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 112/178 places, 152/446 transitions.
Finished structural reductions, in 1 iterations. Remains : 112/178 places, 152/446 transitions.
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=2, aps=[p1:(AND (GEQ s1 1) (GEQ s107 1)), p0:(AND (GEQ s1 1) (GEQ s106 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]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-15 finished in 552 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(G(F(X((G(p0)||(F(!p0)&&p1)))))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(!((F((F(!p0)||p1)) U p2) U p3)))'
[2022-06-11 17:08:18] [INFO ] Flatten gal took : 16 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5109082652272042339
[2022-06-11 17:08:18] [INFO ] Applying decomposition
[2022-06-11 17:08:18] [INFO ] Computing symmetric may disable matrix : 446 transitions.
[2022-06-11 17:08:18] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 17:08:18] [INFO ] Computing symmetric may enable matrix : 446 transitions.
[2022-06-11 17:08:18] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 17:08:18] [INFO ] Flatten gal took : 13 ms
[2022-06-11 17:08:18] [INFO ] Computing Do-Not-Accords matrix : 446 transitions.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7757362928384543785.txt' '-o' '/tmp/graph7757362928384543785.bin' '-w' '/tmp/graph7757362928384543785.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7757362928384543785.bin' '-l' '-1' '-v' '-w' '/tmp/graph7757362928384543785.weights' '-q' '0' '-e' '0.001'
[2022-06-11 17:08:18] [INFO ] Decomposing Gal with order
[2022-06-11 17:08:18] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 17:08:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 17:08:18] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5109082652272042339
Running compilation step : cd /tmp/ltsmin5109082652272042339;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-06-11 17:08:18] [INFO ] Removed a total of 239 redundant transitions.
[2022-06-11 17:08:18] [INFO ] Flatten gal took : 23 ms
[2022-06-11 17:08:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 205 labels/synchronizations in 7 ms.
[2022-06-11 17:08:18] [INFO ] Time to serialize gal into /tmp/LTLFireability17554382615134014493.gal : 4 ms
[2022-06-11 17:08:18] [INFO ] Time to serialize properties into /tmp/LTLFireability3040415645940729241.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17554382615134014493.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3040415645940729241.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 2 LTL properties
Checking formula 0 : !((G(X(X(G(F(X((G("((u0.s1<1)||(u0.l2227<1))"))||(((F("((u0.s1>=1)&&(u0.l2227>=1))"))&&("(u0.s1>=1)"))&&("(u0.l2217>=1)"))))))))))
Formula 0 simplified : !GXXGFX(G"((u0.s1<1)||(u0.l2227<1))" | ("(u0.l2217>=1)" & "(u0.s1>=1)" & F"((u0.s1>=1)&&(u0.l2227>=1))"))
Compilation finished in 995 ms.
Running link step : cd /tmp/ltsmin5109082652272042339;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin5109082652272042339;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X(X([](<>(X(([]((LTLAPp0==true))||(<>(!(LTLAPp0==true))&&(LTLAPp1==true)))))))))' '--buchi-type=spotba'
LTSmin run took 8676 ms.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin5109082652272042339;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(!((<>((<>(!(LTLAPp2==true))||(LTLAPp3==true))) U (LTLAPp4==true)) U (LTLAPp5==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-06-11 17:30:10] [INFO ] Flatten gal took : 59 ms
[2022-06-11 17:30:10] [INFO ] Time to serialize gal into /tmp/LTLFireability10090019359845414792.gal : 2 ms
[2022-06-11 17:30:10] [INFO ] Time to serialize properties into /tmp/LTLFireability1789028361383573452.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10090019359845414792.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1789028361383573452.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...289
Read 1 LTL properties
Checking formula 0 : !((F(!(((F((F(!("((s1>=1)&&(l2226>=1))")))||("((s1>=1)&&(l2229>=1))")))U("((s1>=1)&&(l2237>=1))"))U("((s1>=1)&&(l1676>=1))")))))
Formula 0 simplified : !F!((F("((s1>=1)&&(l2229>=1))" | F!"((s1>=1)&&(l2226>=1))") U "((s1>=1)&&(l2237>=1))") U "((s1>=1)&&(l1676>=1))")
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.022: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.026: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.032: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.037: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.041: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.041: Initializing POR dependencies: labels 452, guards 446
pins2lts-mc-linux64( 2/ 8), 0.276: LTL layer: formula: <>(!((<>((<>(!(LTLAPp2==true))||(LTLAPp3==true))) U (LTLAPp4==true)) U (LTLAPp5==true)))
pins2lts-mc-linux64( 2/ 8), 0.277: "<>(!((<>((<>(!(LTLAPp2==true))||(LTLAPp3==true))) U (LTLAPp4==true)) U (LTLAPp5==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.277: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.507: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.528: There are 453 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.528: State length is 179, there are 518 groups
pins2lts-mc-linux64( 0/ 8), 0.528: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.528: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.528: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.528: Visible groups: 0 / 518, labels: 4 / 453
pins2lts-mc-linux64( 0/ 8), 0.528: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.528: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.583: [Blue] ~51 levels ~960 states ~2760 transitions
pins2lts-mc-linux64( 1/ 8), 0.637: [Blue] ~88 levels ~1920 states ~5784 transitions
pins2lts-mc-linux64( 7/ 8), 0.697: [Blue] ~48 levels ~3840 states ~8136 transitions
pins2lts-mc-linux64( 7/ 8), 0.905: [Blue] ~135 levels ~7680 states ~19448 transitions
pins2lts-mc-linux64( 6/ 8), 1.300: [Blue] ~136 levels ~15360 states ~39408 transitions
pins2lts-mc-linux64( 6/ 8), 1.831: [Blue] ~136 levels ~30720 states ~70952 transitions
pins2lts-mc-linux64( 6/ 8), 2.851: [Blue] ~136 levels ~61440 states ~135680 transitions
pins2lts-mc-linux64( 6/ 8), 4.893: [Blue] ~180 levels ~122880 states ~264560 transitions
pins2lts-mc-linux64( 4/ 8), 8.771: [Blue] ~237 levels ~245760 states ~532824 transitions
pins2lts-mc-linux64( 6/ 8), 15.808: [Blue] ~312 levels ~491520 states ~1043768 transitions
pins2lts-mc-linux64( 4/ 8), 30.930: [Blue] ~413 levels ~983040 states ~2101576 transitions
pins2lts-mc-linux64( 3/ 8), 57.095: [Blue] ~4065 levels ~1966080 states ~4237096 transitions
pins2lts-mc-linux64( 5/ 8), 108.552: [Blue] ~4065 levels ~3932160 states ~8319552 transitions
pins2lts-mc-linux64( 3/ 8), 210.673: [Blue] ~4065 levels ~7864320 states ~16727392 transitions
pins2lts-mc-linux64( 3/ 8), 417.949: [Blue] ~4065 levels ~15728640 states ~33398320 transitions
pins2lts-mc-linux64( 3/ 8), 837.467: [Blue] ~4065 levels ~31457280 states ~66534792 transitions
pins2lts-mc-linux64( 2/ 8), 1600.159: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1600.266:
pins2lts-mc-linux64( 0/ 8), 1600.266: Explored 55895182 states 120271936 transitions, fanout: 2.152
pins2lts-mc-linux64( 0/ 8), 1600.266: Total exploration time 1599.720 sec (1599.630 sec minimum, 1599.664 sec on average)
pins2lts-mc-linux64( 0/ 8), 1600.266: States per second: 34941, Transitions per second: 75183
pins2lts-mc-linux64( 0/ 8), 1600.266:
pins2lts-mc-linux64( 0/ 8), 1600.266: State space has 56706975 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 1600.266: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1600.266: blue states: 55895182 (98.57%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1600.266: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1600.266: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1600.266:
pins2lts-mc-linux64( 0/ 8), 1600.266: Total memory used for local state coloring: 2.0MB
pins2lts-mc-linux64( 0/ 8), 1600.266:
pins2lts-mc-linux64( 0/ 8), 1600.266: Queue width: 8B, total height: 134114, memory: 1.02MB
pins2lts-mc-linux64( 0/ 8), 1600.266: Tree memory: 688.6MB, 12.7 B/state, compr.: 1.8%
pins2lts-mc-linux64( 0/ 8), 1600.266: Tree fill ratio (roots/leafs): 42.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1600.266: Stored 451 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1600.266: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1600.266: Est. total memory use: 689.7MB (~1025.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5109082652272042339;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(!((<>((<>(!(LTLAPp2==true))||(LTLAPp3==true))) U (LTLAPp4==true)) U (LTLAPp5==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5109082652272042339;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(!((<>((<>(!(LTLAPp2==true))||(LTLAPp3==true))) U (LTLAPp4==true)) U (LTLAPp5==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-06-11 17:52:02] [INFO ] Flatten gal took : 203 ms
[2022-06-11 17:52:03] [INFO ] Input system was already deterministic with 446 transitions.
[2022-06-11 17:52:03] [INFO ] Transformed 178 places.
[2022-06-11 17:52:03] [INFO ] Transformed 446 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/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//..//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
[2022-06-11 17:52:04] [INFO ] Time to serialize gal into /tmp/LTLFireability17022260530025833417.gal : 10 ms
[2022-06-11 17:52:04] [INFO ] Time to serialize properties into /tmp/LTLFireability1125384003333070722.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17022260530025833417.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1125384003333070722.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...334
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(!(((F((F(!("((s1>=1)&&(l2226>=1))")))||("((s1>=1)&&(l2229>=1))")))U("((s1>=1)&&(l2237>=1))"))U("((s1>=1)&&(l1676>=1))")))))
Formula 0 simplified : !F!((F("((s1>=1)&&(l2229>=1))" | F!"((s1>=1)&&(l2226>=1))") U "((s1>=1)&&(l2237>=1))") U "((s1>=1)&&(l1676>=1))")

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SieveSingleMsgMbox-PT-d2m96"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is SieveSingleMsgMbox-PT-d2m96, 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 r312-tall-165472283000980"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d2m96.tgz
mv SieveSingleMsgMbox-PT-d2m96 execution
cd execution
if [ "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 ;