About the Execution of ITS-Tools for Peterson-PT-7
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16211.495 | 3600000.00 | 13287202.00 | 65554.70 | FFFTFFFFF?FFFFTF | normal |
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.r168-tall-165277016200092.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 Peterson-PT-7, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277016200092
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.1M
-rw-r--r-- 1 mcc users 283K Apr 30 10:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.2M Apr 30 10:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 190K Apr 30 09:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 861K Apr 30 09:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 168K May 9 08:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 481K May 9 08:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 122K May 9 08:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 417K May 9 08:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 27K May 9 08:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 59K May 9 08:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 1.3M May 10 09:34 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 Peterson-PT-7-LTLFireability-00
FORMULA_NAME Peterson-PT-7-LTLFireability-01
FORMULA_NAME Peterson-PT-7-LTLFireability-02
FORMULA_NAME Peterson-PT-7-LTLFireability-03
FORMULA_NAME Peterson-PT-7-LTLFireability-04
FORMULA_NAME Peterson-PT-7-LTLFireability-05
FORMULA_NAME Peterson-PT-7-LTLFireability-06
FORMULA_NAME Peterson-PT-7-LTLFireability-07
FORMULA_NAME Peterson-PT-7-LTLFireability-08
FORMULA_NAME Peterson-PT-7-LTLFireability-09
FORMULA_NAME Peterson-PT-7-LTLFireability-10
FORMULA_NAME Peterson-PT-7-LTLFireability-11
FORMULA_NAME Peterson-PT-7-LTLFireability-12
FORMULA_NAME Peterson-PT-7-LTLFireability-13
FORMULA_NAME Peterson-PT-7-LTLFireability-14
FORMULA_NAME Peterson-PT-7-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652787422208
Running Version 202205111006
[2022-05-17 11:37:03] [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-05-17 11:37:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 11:37:03] [INFO ] Load time of PNML (sax parser for PT used): 187 ms
[2022-05-17 11:37:03] [INFO ] Transformed 1992 places.
[2022-05-17 11:37:03] [INFO ] Transformed 3096 transitions.
[2022-05-17 11:37:03] [INFO ] Found NUPN structural information;
[2022-05-17 11:37:03] [INFO ] Completing missing partition info from NUPN : creating a component with [IsEndLoop_3_0_5, IsEndLoop_2_0_5, IsEndLoop_0_3_6, IsEndLoop_0_2_7, EndTurn_4_2, EndTurn_4_1, EndTurn_7_0, EndTurn_6_0, EndTurn_5_0, IsEndLoop_7_6_7, IsEndLoop_6_6_7, IsEndLoop_5_6_7, BeginLoop_1_4_2, BeginLoop_0_4_2, BeginLoop_3_0_4, BeginLoop_3_6_3, BeginLoop_0_6_5, BeginLoop_3_6_5, BeginLoop_4_2_7, BeginLoop_7_1_7, BeginLoop_5_1_7, BeginLoop_6_1_7, BeginLoop_4_1_7, BeginLoop_7_0_7, BeginLoop_6_0_7, BeginLoop_5_0_7, TestAlone_2_4_0, TestAlone_2_5_0, TestAlone_3_6_1, TestAlone_3_0_2, TestAlone_1_5_5, TestAlone_0_5_5, TestAlone_3_5_6, TestAlone_2_5_6, TestIdentity_4_2_1, TestIdentity_4_3_1, TestIdentity_7_2_1, TestIdentity_5_2_1, TestIdentity_6_2_1, TestIdentity_7_6_0, TestIdentity_6_6_0, TestIdentity_5_6_0, TestIdentity_0_2_3, TestIdentity_1_2_3, TestIdentity_1_1_6, TestIdentity_0_2_6, TestIdentity_2_4_4, TestIdentity_1_4_4, TestIdentity_4_5_7, TestIdentity_6_4_7, TestIdentity_5_4_7, TestIdentity_7_4_7, TestIdentity_4_4_7, TestIdentity_6_3_7, TestIdentity_5_3_7, TestIdentity_7_3_7, CS_0, CS_2, AskForSection_2_5, AskForSection_0_5]
[2022-05-17 11:37:03] [INFO ] Parsed PT model containing 1992 places and 3096 transitions in 317 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 29 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Peterson-PT-7-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-7-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1601 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 69 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2022-05-17 11:37:04] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-05-17 11:37:04] [INFO ] Computed 31 place invariants in 38 ms
[2022-05-17 11:37:05] [INFO ] Implicit Places using invariants in 624 ms returned []
[2022-05-17 11:37:05] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-05-17 11:37:05] [INFO ] Computed 31 place invariants in 18 ms
[2022-05-17 11:37:06] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 11:37:06] [INFO ] Implicit Places using invariants and state equation in 1261 ms returned []
Implicit Place search using SMT with State Equation took 1915 ms to find 0 implicit places.
[2022-05-17 11:37:06] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-05-17 11:37:06] [INFO ] Computed 31 place invariants in 11 ms
[2022-05-17 11:37:08] [INFO ] Dead Transitions using invariants and state equation in 1786 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1992/1992 places, 3096/3096 transitions.
Support contains 1601 out of 1992 places after structural reductions.
[2022-05-17 11:37:08] [INFO ] Flatten gal took : 230 ms
[2022-05-17 11:37:09] [INFO ] Flatten gal took : 215 ms
[2022-05-17 11:37:09] [INFO ] Input system was already deterministic with 3096 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 394 ms. (steps per millisecond=25 ) properties (out of 36) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 12) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2022-05-17 11:37:10] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-05-17 11:37:10] [INFO ] Computed 31 place invariants in 10 ms
[2022-05-17 11:37:11] [INFO ] [Real]Absence check using 23 positive place invariants in 24 ms returned sat
[2022-05-17 11:37:11] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2022-05-17 11:37:14] [INFO ] After 3277ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-05-17 11:37:15] [INFO ] [Nat]Absence check using 23 positive place invariants in 25 ms returned sat
[2022-05-17 11:37:15] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 11:37:17] [INFO ] After 1595ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2022-05-17 11:37:17] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 11:37:18] [INFO ] After 1188ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2022-05-17 11:37:19] [INFO ] Deduced a trap composed of 16 places in 994 ms of which 6 ms to minimize.
[2022-05-17 11:37:20] [INFO ] Deduced a trap composed of 17 places in 972 ms of which 5 ms to minimize.
[2022-05-17 11:37:21] [INFO ] Deduced a trap composed of 32 places in 1089 ms of which 2 ms to minimize.
[2022-05-17 11:37:23] [INFO ] Deduced a trap composed of 17 places in 1088 ms of which 5 ms to minimize.
[2022-05-17 11:37:24] [INFO ] Deduced a trap composed of 17 places in 1087 ms of which 1 ms to minimize.
[2022-05-17 11:37:25] [INFO ] Deduced a trap composed of 17 places in 1067 ms of which 2 ms to minimize.
[2022-05-17 11:37:26] [INFO ] Deduced a trap composed of 28 places in 979 ms of which 2 ms to minimize.
[2022-05-17 11:37:27] [INFO ] Deduced a trap composed of 50 places in 1007 ms of which 2 ms to minimize.
[2022-05-17 11:37:28] [INFO ] Deduced a trap composed of 61 places in 1011 ms of which 1 ms to minimize.
[2022-05-17 11:37:30] [INFO ] Deduced a trap composed of 50 places in 1016 ms of which 1 ms to minimize.
[2022-05-17 11:37:31] [INFO ] Deduced a trap composed of 49 places in 1025 ms of which 2 ms to minimize.
[2022-05-17 11:37:32] [INFO ] Deduced a trap composed of 50 places in 968 ms of which 1 ms to minimize.
[2022-05-17 11:37:33] [INFO ] Deduced a trap composed of 85 places in 1006 ms of which 1 ms to minimize.
[2022-05-17 11:37:34] [INFO ] Deduced a trap composed of 92 places in 962 ms of which 2 ms to minimize.
[2022-05-17 11:37:35] [INFO ] Deduced a trap composed of 50 places in 1001 ms of which 1 ms to minimize.
[2022-05-17 11:37:36] [INFO ] Deduced a trap composed of 84 places in 899 ms of which 1 ms to minimize.
[2022-05-17 11:37:37] [INFO ] Deduced a trap composed of 153 places in 863 ms of which 1 ms to minimize.
[2022-05-17 11:37:38] [INFO ] Deduced a trap composed of 85 places in 880 ms of which 1 ms to minimize.
[2022-05-17 11:37:39] [INFO ] Deduced a trap composed of 153 places in 928 ms of which 2 ms to minimize.
[2022-05-17 11:37:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 11:37:39] [INFO ] After 25420ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 26 ms.
Support contains 63 out of 1992 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 875 transitions
Trivial Post-agglo rules discarded 875 transitions
Performed 875 trivial Post agglomeration. Transition count delta: 875
Iterating post reduction 0 with 875 rules applied. Total rules applied 875 place count 1992 transition count 2221
Reduce places removed 875 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 878 rules applied. Total rules applied 1753 place count 1117 transition count 2218
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1756 place count 1114 transition count 2218
Performed 452 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 452 Pre rules applied. Total rules applied 1756 place count 1114 transition count 1766
Deduced a syphon composed of 452 places in 3 ms
Reduce places removed 452 places and 0 transitions.
Iterating global reduction 3 with 904 rules applied. Total rules applied 2660 place count 662 transition count 1766
Applied a total of 2660 rules in 394 ms. Remains 662 /1992 variables (removed 1330) and now considering 1766/3096 (removed 1330) transitions.
Finished structural reductions, in 1 iterations. Remains : 662/1992 places, 1766/3096 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 346 ms. (steps per millisecond=28 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 357912 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :{}
Probabilistic random walk after 357912 steps, saw 57801 distinct states, run finished after 3004 ms. (steps per millisecond=119 ) properties seen :0
Running SMT prover for 9 properties.
[2022-05-17 11:37:43] [INFO ] Flow matrix only has 1430 transitions (discarded 336 similar events)
// Phase 1: matrix 1430 rows 662 cols
[2022-05-17 11:37:43] [INFO ] Computed 31 place invariants in 5 ms
[2022-05-17 11:37:44] [INFO ] [Real]Absence check using 23 positive place invariants in 9 ms returned sat
[2022-05-17 11:37:44] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2022-05-17 11:37:44] [INFO ] After 765ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-05-17 11:37:44] [INFO ] [Nat]Absence check using 23 positive place invariants in 8 ms returned sat
[2022-05-17 11:37:44] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2022-05-17 11:37:45] [INFO ] After 649ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2022-05-17 11:37:45] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 11:37:46] [INFO ] After 523ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2022-05-17 11:37:46] [INFO ] Deduced a trap composed of 15 places in 249 ms of which 1 ms to minimize.
[2022-05-17 11:37:46] [INFO ] Deduced a trap composed of 12 places in 241 ms of which 0 ms to minimize.
[2022-05-17 11:37:47] [INFO ] Deduced a trap composed of 34 places in 241 ms of which 0 ms to minimize.
[2022-05-17 11:37:47] [INFO ] Deduced a trap composed of 22 places in 226 ms of which 1 ms to minimize.
[2022-05-17 11:37:47] [INFO ] Deduced a trap composed of 33 places in 245 ms of which 1 ms to minimize.
[2022-05-17 11:37:47] [INFO ] Deduced a trap composed of 12 places in 241 ms of which 0 ms to minimize.
[2022-05-17 11:37:48] [INFO ] Deduced a trap composed of 28 places in 231 ms of which 1 ms to minimize.
[2022-05-17 11:37:48] [INFO ] Deduced a trap composed of 16 places in 246 ms of which 1 ms to minimize.
[2022-05-17 11:37:48] [INFO ] Deduced a trap composed of 11 places in 229 ms of which 0 ms to minimize.
[2022-05-17 11:37:49] [INFO ] Deduced a trap composed of 24 places in 241 ms of which 1 ms to minimize.
[2022-05-17 11:37:49] [INFO ] Deduced a trap composed of 26 places in 242 ms of which 1 ms to minimize.
[2022-05-17 11:37:49] [INFO ] Deduced a trap composed of 24 places in 244 ms of which 0 ms to minimize.
[2022-05-17 11:37:49] [INFO ] Deduced a trap composed of 24 places in 241 ms of which 0 ms to minimize.
[2022-05-17 11:37:50] [INFO ] Deduced a trap composed of 23 places in 244 ms of which 2 ms to minimize.
[2022-05-17 11:37:50] [INFO ] Deduced a trap composed of 13 places in 226 ms of which 1 ms to minimize.
[2022-05-17 11:37:50] [INFO ] Deduced a trap composed of 35 places in 213 ms of which 1 ms to minimize.
[2022-05-17 11:37:51] [INFO ] Deduced a trap composed of 45 places in 210 ms of which 1 ms to minimize.
[2022-05-17 11:37:51] [INFO ] Deduced a trap composed of 87 places in 230 ms of which 0 ms to minimize.
[2022-05-17 11:37:51] [INFO ] Deduced a trap composed of 36 places in 220 ms of which 1 ms to minimize.
[2022-05-17 11:37:51] [INFO ] Deduced a trap composed of 69 places in 217 ms of which 1 ms to minimize.
[2022-05-17 11:37:52] [INFO ] Deduced a trap composed of 62 places in 218 ms of which 0 ms to minimize.
[2022-05-17 11:37:52] [INFO ] Deduced a trap composed of 65 places in 248 ms of which 0 ms to minimize.
[2022-05-17 11:37:52] [INFO ] Deduced a trap composed of 45 places in 215 ms of which 1 ms to minimize.
[2022-05-17 11:37:52] [INFO ] Deduced a trap composed of 43 places in 217 ms of which 1 ms to minimize.
[2022-05-17 11:37:53] [INFO ] Deduced a trap composed of 34 places in 220 ms of which 0 ms to minimize.
[2022-05-17 11:37:53] [INFO ] Deduced a trap composed of 46 places in 219 ms of which 0 ms to minimize.
[2022-05-17 11:37:53] [INFO ] Deduced a trap composed of 68 places in 212 ms of which 0 ms to minimize.
[2022-05-17 11:37:54] [INFO ] Deduced a trap composed of 68 places in 217 ms of which 1 ms to minimize.
[2022-05-17 11:37:54] [INFO ] Deduced a trap composed of 74 places in 209 ms of which 0 ms to minimize.
[2022-05-17 11:37:54] [INFO ] Deduced a trap composed of 32 places in 212 ms of which 0 ms to minimize.
[2022-05-17 11:37:54] [INFO ] Deduced a trap composed of 42 places in 193 ms of which 0 ms to minimize.
[2022-05-17 11:37:55] [INFO ] Deduced a trap composed of 74 places in 195 ms of which 2 ms to minimize.
[2022-05-17 11:37:55] [INFO ] Deduced a trap composed of 42 places in 197 ms of which 0 ms to minimize.
[2022-05-17 11:37:55] [INFO ] Deduced a trap composed of 44 places in 196 ms of which 0 ms to minimize.
[2022-05-17 11:37:55] [INFO ] Deduced a trap composed of 12 places in 230 ms of which 0 ms to minimize.
[2022-05-17 11:37:56] [INFO ] Deduced a trap composed of 31 places in 222 ms of which 1 ms to minimize.
[2022-05-17 11:37:56] [INFO ] Deduced a trap composed of 70 places in 234 ms of which 1 ms to minimize.
[2022-05-17 11:37:56] [INFO ] Deduced a trap composed of 85 places in 240 ms of which 1 ms to minimize.
[2022-05-17 11:37:57] [INFO ] Deduced a trap composed of 65 places in 237 ms of which 1 ms to minimize.
[2022-05-17 11:37:57] [INFO ] Deduced a trap composed of 34 places in 227 ms of which 0 ms to minimize.
[2022-05-17 11:37:57] [INFO ] Deduced a trap composed of 44 places in 209 ms of which 1 ms to minimize.
[2022-05-17 11:37:57] [INFO ] Deduced a trap composed of 63 places in 226 ms of which 0 ms to minimize.
[2022-05-17 11:37:58] [INFO ] Deduced a trap composed of 65 places in 229 ms of which 1 ms to minimize.
[2022-05-17 11:37:58] [INFO ] Deduced a trap composed of 14 places in 221 ms of which 1 ms to minimize.
[2022-05-17 11:37:58] [INFO ] Deduced a trap composed of 28 places in 217 ms of which 1 ms to minimize.
[2022-05-17 11:37:59] [INFO ] Deduced a trap composed of 22 places in 211 ms of which 1 ms to minimize.
[2022-05-17 11:37:59] [INFO ] Deduced a trap composed of 12 places in 208 ms of which 3 ms to minimize.
[2022-05-17 11:37:59] [INFO ] Deduced a trap composed of 56 places in 193 ms of which 2 ms to minimize.
[2022-05-17 11:37:59] [INFO ] Deduced a trap composed of 51 places in 179 ms of which 2 ms to minimize.
[2022-05-17 11:38:00] [INFO ] Deduced a trap composed of 52 places in 177 ms of which 2 ms to minimize.
[2022-05-17 11:38:00] [INFO ] Deduced a trap composed of 52 places in 181 ms of which 1 ms to minimize.
[2022-05-17 11:38:00] [INFO ] Deduced a trap composed of 52 places in 176 ms of which 0 ms to minimize.
[2022-05-17 11:38:00] [INFO ] Deduced a trap composed of 52 places in 173 ms of which 1 ms to minimize.
[2022-05-17 11:38:00] [INFO ] Deduced a trap composed of 52 places in 172 ms of which 0 ms to minimize.
[2022-05-17 11:38:01] [INFO ] Deduced a trap composed of 32 places in 220 ms of which 0 ms to minimize.
[2022-05-17 11:38:01] [INFO ] Deduced a trap composed of 31 places in 227 ms of which 0 ms to minimize.
[2022-05-17 11:38:01] [INFO ] Deduced a trap composed of 26 places in 216 ms of which 0 ms to minimize.
[2022-05-17 11:38:01] [INFO ] Trap strengthening (SAT) tested/added 58/57 trap constraints in 15633 ms
[2022-05-17 11:38:02] [INFO ] Deduced a trap composed of 74 places in 219 ms of which 0 ms to minimize.
[2022-05-17 11:38:02] [INFO ] Deduced a trap composed of 64 places in 209 ms of which 0 ms to minimize.
[2022-05-17 11:38:02] [INFO ] Deduced a trap composed of 63 places in 196 ms of which 1 ms to minimize.
[2022-05-17 11:38:02] [INFO ] Deduced a trap composed of 73 places in 193 ms of which 0 ms to minimize.
[2022-05-17 11:38:03] [INFO ] Deduced a trap composed of 74 places in 195 ms of which 1 ms to minimize.
[2022-05-17 11:38:03] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1292 ms
[2022-05-17 11:38:03] [INFO ] Deduced a trap composed of 21 places in 218 ms of which 1 ms to minimize.
[2022-05-17 11:38:03] [INFO ] Deduced a trap composed of 22 places in 216 ms of which 1 ms to minimize.
[2022-05-17 11:38:04] [INFO ] Deduced a trap composed of 108 places in 216 ms of which 0 ms to minimize.
[2022-05-17 11:38:04] [INFO ] Deduced a trap composed of 36 places in 220 ms of which 1 ms to minimize.
[2022-05-17 11:38:04] [INFO ] Deduced a trap composed of 92 places in 210 ms of which 1 ms to minimize.
[2022-05-17 11:38:04] [INFO ] Deduced a trap composed of 22 places in 206 ms of which 1 ms to minimize.
[2022-05-17 11:38:05] [INFO ] Deduced a trap composed of 36 places in 205 ms of which 1 ms to minimize.
[2022-05-17 11:38:05] [INFO ] Deduced a trap composed of 58 places in 209 ms of which 0 ms to minimize.
[2022-05-17 11:38:05] [INFO ] Deduced a trap composed of 22 places in 214 ms of which 0 ms to minimize.
[2022-05-17 11:38:05] [INFO ] Deduced a trap composed of 56 places in 201 ms of which 0 ms to minimize.
[2022-05-17 11:38:06] [INFO ] Deduced a trap composed of 32 places in 198 ms of which 1 ms to minimize.
[2022-05-17 11:38:06] [INFO ] Deduced a trap composed of 76 places in 189 ms of which 1 ms to minimize.
[2022-05-17 11:38:06] [INFO ] Deduced a trap composed of 77 places in 193 ms of which 0 ms to minimize.
[2022-05-17 11:38:06] [INFO ] Deduced a trap composed of 66 places in 187 ms of which 1 ms to minimize.
[2022-05-17 11:38:07] [INFO ] Deduced a trap composed of 46 places in 199 ms of which 1 ms to minimize.
[2022-05-17 11:38:07] [INFO ] Deduced a trap composed of 46 places in 211 ms of which 0 ms to minimize.
[2022-05-17 11:38:07] [INFO ] Deduced a trap composed of 46 places in 216 ms of which 0 ms to minimize.
[2022-05-17 11:38:07] [INFO ] Deduced a trap composed of 50 places in 205 ms of which 0 ms to minimize.
[2022-05-17 11:38:08] [INFO ] Deduced a trap composed of 48 places in 221 ms of which 1 ms to minimize.
[2022-05-17 11:38:08] [INFO ] Deduced a trap composed of 67 places in 192 ms of which 1 ms to minimize.
[2022-05-17 11:38:08] [INFO ] Deduced a trap composed of 46 places in 188 ms of which 0 ms to minimize.
[2022-05-17 11:38:08] [INFO ] Deduced a trap composed of 62 places in 178 ms of which 0 ms to minimize.
[2022-05-17 11:38:09] [INFO ] Deduced a trap composed of 75 places in 175 ms of which 0 ms to minimize.
[2022-05-17 11:38:09] [INFO ] Deduced a trap composed of 62 places in 172 ms of which 1 ms to minimize.
[2022-05-17 11:38:09] [INFO ] Deduced a trap composed of 90 places in 177 ms of which 1 ms to minimize.
[2022-05-17 11:38:09] [INFO ] Deduced a trap composed of 66 places in 185 ms of which 0 ms to minimize.
[2022-05-17 11:38:09] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 11:38:09] [INFO ] After 25080ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 63 ms.
Support contains 63 out of 662 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 662/662 places, 1766/1766 transitions.
Applied a total of 0 rules in 58 ms. Remains 662 /662 variables (removed 0) and now considering 1766/1766 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 662/662 places, 1766/1766 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 662/662 places, 1766/1766 transitions.
Applied a total of 0 rules in 48 ms. Remains 662 /662 variables (removed 0) and now considering 1766/1766 (removed 0) transitions.
[2022-05-17 11:38:09] [INFO ] Flow matrix only has 1430 transitions (discarded 336 similar events)
// Phase 1: matrix 1430 rows 662 cols
[2022-05-17 11:38:09] [INFO ] Computed 31 place invariants in 10 ms
[2022-05-17 11:38:10] [INFO ] Implicit Places using invariants in 426 ms returned [646, 647, 648, 649, 650, 659, 660, 661]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 431 ms to find 8 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 654/662 places, 1766/1766 transitions.
Applied a total of 0 rules in 31 ms. Remains 654 /654 variables (removed 0) and now considering 1766/1766 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 654/662 places, 1766/1766 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 288 ms. (steps per millisecond=34 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 330291 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :{}
Probabilistic random walk after 330291 steps, saw 55252 distinct states, run finished after 3002 ms. (steps per millisecond=110 ) properties seen :0
Running SMT prover for 9 properties.
[2022-05-17 11:38:14] [INFO ] Flow matrix only has 1430 transitions (discarded 336 similar events)
// Phase 1: matrix 1430 rows 654 cols
[2022-05-17 11:38:14] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-17 11:38:14] [INFO ] [Real]Absence check using 23 positive place invariants in 10 ms returned sat
[2022-05-17 11:38:14] [INFO ] After 286ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-05-17 11:38:14] [INFO ] [Nat]Absence check using 23 positive place invariants in 9 ms returned sat
[2022-05-17 11:38:15] [INFO ] After 655ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2022-05-17 11:38:15] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 11:38:15] [INFO ] After 530ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2022-05-17 11:38:16] [INFO ] Deduced a trap composed of 76 places in 238 ms of which 1 ms to minimize.
[2022-05-17 11:38:16] [INFO ] Deduced a trap composed of 43 places in 243 ms of which 1 ms to minimize.
[2022-05-17 11:38:16] [INFO ] Deduced a trap composed of 25 places in 241 ms of which 1 ms to minimize.
[2022-05-17 11:38:17] [INFO ] Deduced a trap composed of 15 places in 223 ms of which 0 ms to minimize.
[2022-05-17 11:38:17] [INFO ] Deduced a trap composed of 15 places in 239 ms of which 0 ms to minimize.
[2022-05-17 11:38:17] [INFO ] Deduced a trap composed of 16 places in 240 ms of which 0 ms to minimize.
[2022-05-17 11:38:17] [INFO ] Deduced a trap composed of 15 places in 242 ms of which 0 ms to minimize.
[2022-05-17 11:38:18] [INFO ] Deduced a trap composed of 11 places in 244 ms of which 2 ms to minimize.
[2022-05-17 11:38:18] [INFO ] Deduced a trap composed of 16 places in 249 ms of which 0 ms to minimize.
[2022-05-17 11:38:18] [INFO ] Deduced a trap composed of 12 places in 240 ms of which 0 ms to minimize.
[2022-05-17 11:38:19] [INFO ] Deduced a trap composed of 58 places in 237 ms of which 1 ms to minimize.
[2022-05-17 11:38:19] [INFO ] Deduced a trap composed of 64 places in 234 ms of which 1 ms to minimize.
[2022-05-17 11:38:19] [INFO ] Deduced a trap composed of 40 places in 235 ms of which 0 ms to minimize.
[2022-05-17 11:38:20] [INFO ] Deduced a trap composed of 29 places in 239 ms of which 1 ms to minimize.
[2022-05-17 11:38:20] [INFO ] Deduced a trap composed of 25 places in 233 ms of which 1 ms to minimize.
[2022-05-17 11:38:20] [INFO ] Deduced a trap composed of 22 places in 233 ms of which 1 ms to minimize.
[2022-05-17 11:38:20] [INFO ] Deduced a trap composed of 22 places in 233 ms of which 0 ms to minimize.
[2022-05-17 11:38:21] [INFO ] Deduced a trap composed of 24 places in 244 ms of which 1 ms to minimize.
[2022-05-17 11:38:21] [INFO ] Deduced a trap composed of 21 places in 229 ms of which 0 ms to minimize.
[2022-05-17 11:38:21] [INFO ] Deduced a trap composed of 44 places in 215 ms of which 1 ms to minimize.
[2022-05-17 11:38:21] [INFO ] Deduced a trap composed of 68 places in 206 ms of which 1 ms to minimize.
[2022-05-17 11:38:22] [INFO ] Deduced a trap composed of 44 places in 214 ms of which 0 ms to minimize.
[2022-05-17 11:38:22] [INFO ] Deduced a trap composed of 74 places in 210 ms of which 1 ms to minimize.
[2022-05-17 11:38:22] [INFO ] Deduced a trap composed of 34 places in 176 ms of which 1 ms to minimize.
[2022-05-17 11:38:22] [INFO ] Deduced a trap composed of 48 places in 184 ms of which 0 ms to minimize.
[2022-05-17 11:38:23] [INFO ] Deduced a trap composed of 46 places in 176 ms of which 0 ms to minimize.
[2022-05-17 11:38:23] [INFO ] Deduced a trap composed of 31 places in 188 ms of which 1 ms to minimize.
[2022-05-17 11:38:23] [INFO ] Deduced a trap composed of 34 places in 183 ms of which 0 ms to minimize.
[2022-05-17 11:38:23] [INFO ] Deduced a trap composed of 35 places in 184 ms of which 1 ms to minimize.
[2022-05-17 11:38:24] [INFO ] Deduced a trap composed of 35 places in 178 ms of which 0 ms to minimize.
[2022-05-17 11:38:24] [INFO ] Deduced a trap composed of 35 places in 177 ms of which 0 ms to minimize.
[2022-05-17 11:38:24] [INFO ] Deduced a trap composed of 51 places in 165 ms of which 1 ms to minimize.
[2022-05-17 11:38:24] [INFO ] Deduced a trap composed of 52 places in 188 ms of which 0 ms to minimize.
[2022-05-17 11:38:25] [INFO ] Deduced a trap composed of 32 places in 172 ms of which 0 ms to minimize.
[2022-05-17 11:38:25] [INFO ] Deduced a trap composed of 55 places in 167 ms of which 0 ms to minimize.
[2022-05-17 11:38:25] [INFO ] Deduced a trap composed of 65 places in 167 ms of which 1 ms to minimize.
[2022-05-17 11:38:25] [INFO ] Deduced a trap composed of 65 places in 169 ms of which 0 ms to minimize.
[2022-05-17 11:38:25] [INFO ] Deduced a trap composed of 64 places in 167 ms of which 1 ms to minimize.
[2022-05-17 11:38:26] [INFO ] Deduced a trap composed of 60 places in 165 ms of which 0 ms to minimize.
[2022-05-17 11:38:26] [INFO ] Deduced a trap composed of 44 places in 171 ms of which 1 ms to minimize.
[2022-05-17 11:38:26] [INFO ] Deduced a trap composed of 60 places in 159 ms of which 1 ms to minimize.
[2022-05-17 11:38:26] [INFO ] Deduced a trap composed of 45 places in 160 ms of which 0 ms to minimize.
[2022-05-17 11:38:26] [INFO ] Deduced a trap composed of 65 places in 143 ms of which 0 ms to minimize.
[2022-05-17 11:38:27] [INFO ] Deduced a trap composed of 74 places in 139 ms of which 0 ms to minimize.
[2022-05-17 11:38:27] [INFO ] Deduced a trap composed of 54 places in 144 ms of which 1 ms to minimize.
[2022-05-17 11:38:27] [INFO ] Deduced a trap composed of 54 places in 144 ms of which 0 ms to minimize.
[2022-05-17 11:38:27] [INFO ] Deduced a trap composed of 88 places in 146 ms of which 0 ms to minimize.
[2022-05-17 11:38:27] [INFO ] Deduced a trap composed of 64 places in 149 ms of which 0 ms to minimize.
[2022-05-17 11:38:28] [INFO ] Deduced a trap composed of 42 places in 245 ms of which 0 ms to minimize.
[2022-05-17 11:38:28] [INFO ] Deduced a trap composed of 19 places in 225 ms of which 0 ms to minimize.
[2022-05-17 11:38:28] [INFO ] Deduced a trap composed of 90 places in 199 ms of which 1 ms to minimize.
[2022-05-17 11:38:29] [INFO ] Deduced a trap composed of 45 places in 186 ms of which 1 ms to minimize.
[2022-05-17 11:38:29] [INFO ] Deduced a trap composed of 51 places in 185 ms of which 0 ms to minimize.
[2022-05-17 11:38:29] [INFO ] Deduced a trap composed of 11 places in 222 ms of which 0 ms to minimize.
[2022-05-17 11:38:29] [INFO ] Deduced a trap composed of 41 places in 185 ms of which 0 ms to minimize.
[2022-05-17 11:38:29] [INFO ] Deduced a trap composed of 52 places in 171 ms of which 1 ms to minimize.
[2022-05-17 11:38:30] [INFO ] Deduced a trap composed of 55 places in 174 ms of which 1 ms to minimize.
[2022-05-17 11:38:30] [INFO ] Deduced a trap composed of 51 places in 178 ms of which 1 ms to minimize.
[2022-05-17 11:38:30] [INFO ] Deduced a trap composed of 24 places in 224 ms of which 1 ms to minimize.
[2022-05-17 11:38:31] [INFO ] Deduced a trap composed of 32 places in 221 ms of which 1 ms to minimize.
[2022-05-17 11:38:31] [INFO ] Deduced a trap composed of 67 places in 201 ms of which 1 ms to minimize.
[2022-05-17 11:38:31] [INFO ] Deduced a trap composed of 59 places in 199 ms of which 0 ms to minimize.
[2022-05-17 11:38:31] [INFO ] Deduced a trap composed of 55 places in 189 ms of which 1 ms to minimize.
[2022-05-17 11:38:32] [INFO ] Deduced a trap composed of 54 places in 189 ms of which 1 ms to minimize.
[2022-05-17 11:38:32] [INFO ] Deduced a trap composed of 78 places in 143 ms of which 0 ms to minimize.
[2022-05-17 11:38:33] [INFO ] Deduced a trap composed of 31 places in 195 ms of which 1 ms to minimize.
[2022-05-17 11:38:33] [INFO ] Deduced a trap composed of 74 places in 152 ms of which 1 ms to minimize.
[2022-05-17 11:38:34] [INFO ] Deduced a trap composed of 75 places in 149 ms of which 0 ms to minimize.
[2022-05-17 11:38:34] [INFO ] Deduced a trap composed of 74 places in 146 ms of which 0 ms to minimize.
[2022-05-17 11:38:34] [INFO ] Deduced a trap composed of 75 places in 162 ms of which 1 ms to minimize.
[2022-05-17 11:38:34] [INFO ] Deduced a trap composed of 74 places in 146 ms of which 1 ms to minimize.
[2022-05-17 11:38:34] [INFO ] Deduced a trap composed of 75 places in 146 ms of which 1 ms to minimize.
[2022-05-17 11:38:34] [INFO ] Trap strengthening (SAT) tested/added 73/72 trap constraints in 18977 ms
[2022-05-17 11:38:35] [INFO ] Deduced a trap composed of 64 places in 189 ms of which 0 ms to minimize.
[2022-05-17 11:38:35] [INFO ] Deduced a trap composed of 30 places in 185 ms of which 1 ms to minimize.
[2022-05-17 11:38:35] [INFO ] Deduced a trap composed of 30 places in 185 ms of which 0 ms to minimize.
[2022-05-17 11:38:35] [INFO ] Deduced a trap composed of 31 places in 184 ms of which 1 ms to minimize.
[2022-05-17 11:38:36] [INFO ] Deduced a trap composed of 23 places in 182 ms of which 1 ms to minimize.
[2022-05-17 11:38:36] [INFO ] Deduced a trap composed of 22 places in 179 ms of which 1 ms to minimize.
[2022-05-17 11:38:36] [INFO ] Deduced a trap composed of 74 places in 175 ms of which 0 ms to minimize.
[2022-05-17 11:38:36] [INFO ] Deduced a trap composed of 21 places in 169 ms of which 1 ms to minimize.
[2022-05-17 11:38:36] [INFO ] Deduced a trap composed of 64 places in 138 ms of which 1 ms to minimize.
[2022-05-17 11:38:37] [INFO ] Deduced a trap composed of 64 places in 135 ms of which 1 ms to minimize.
[2022-05-17 11:38:37] [INFO ] Deduced a trap composed of 64 places in 142 ms of which 0 ms to minimize.
[2022-05-17 11:38:37] [INFO ] Deduced a trap composed of 63 places in 181 ms of which 1 ms to minimize.
[2022-05-17 11:38:37] [INFO ] Deduced a trap composed of 64 places in 137 ms of which 0 ms to minimize.
[2022-05-17 11:38:37] [INFO ] Deduced a trap composed of 74 places in 150 ms of which 1 ms to minimize.
[2022-05-17 11:38:38] [INFO ] Deduced a trap composed of 73 places in 146 ms of which 1 ms to minimize.
[2022-05-17 11:38:38] [INFO ] Deduced a trap composed of 74 places in 143 ms of which 1 ms to minimize.
[2022-05-17 11:38:38] [INFO ] Deduced a trap composed of 74 places in 151 ms of which 1 ms to minimize.
[2022-05-17 11:38:38] [INFO ] Deduced a trap composed of 74 places in 149 ms of which 1 ms to minimize.
[2022-05-17 11:38:38] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 3782 ms
[2022-05-17 11:38:39] [INFO ] Deduced a trap composed of 31 places in 194 ms of which 1 ms to minimize.
[2022-05-17 11:38:39] [INFO ] Deduced a trap composed of 52 places in 217 ms of which 1 ms to minimize.
[2022-05-17 11:38:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 11:38:39] [INFO ] After 25061ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 82 ms.
Support contains 63 out of 654 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 654/654 places, 1766/1766 transitions.
Applied a total of 0 rules in 36 ms. Remains 654 /654 variables (removed 0) and now considering 1766/1766 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 654/654 places, 1766/1766 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 654/654 places, 1766/1766 transitions.
Applied a total of 0 rules in 29 ms. Remains 654 /654 variables (removed 0) and now considering 1766/1766 (removed 0) transitions.
[2022-05-17 11:38:39] [INFO ] Flow matrix only has 1430 transitions (discarded 336 similar events)
// Phase 1: matrix 1430 rows 654 cols
[2022-05-17 11:38:39] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-17 11:38:40] [INFO ] Implicit Places using invariants in 393 ms returned []
[2022-05-17 11:38:40] [INFO ] Flow matrix only has 1430 transitions (discarded 336 similar events)
// Phase 1: matrix 1430 rows 654 cols
[2022-05-17 11:38:40] [INFO ] Computed 23 place invariants in 7 ms
[2022-05-17 11:38:40] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 11:38:43] [INFO ] Implicit Places using invariants and state equation in 3090 ms returned []
Implicit Place search using SMT with State Equation took 3484 ms to find 0 implicit places.
[2022-05-17 11:38:43] [INFO ] Redundant transitions in 104 ms returned []
[2022-05-17 11:38:43] [INFO ] Flow matrix only has 1430 transitions (discarded 336 similar events)
// Phase 1: matrix 1430 rows 654 cols
[2022-05-17 11:38:43] [INFO ] Computed 23 place invariants in 9 ms
[2022-05-17 11:38:43] [INFO ] Dead Transitions using invariants and state equation in 653 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 654/654 places, 1766/1766 transitions.
Graph (trivial) has 1235 edges and 654 vertex of which 436 / 654 are part of one of the 56 SCC in 5 ms
Free SCC test removed 380 places
Drop transitions removed 760 transitions
Ensure Unique test removed 336 transitions
Reduce isomorphic transitions removed 1096 transitions.
Performed 8 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 17 place count 266 transition count 660
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 21 place count 266 transition count 656
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -51
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 1 with 39 rules applied. Total rules applied 60 place count 243 transition count 707
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 74 place count 236 transition count 700
Graph (trivial) has 116 edges and 236 vertex of which 75 / 236 are part of one of the 6 SCC in 0 ms
Free SCC test removed 69 places
Iterating global reduction 1 with 1 rules applied. Total rules applied 75 place count 167 transition count 700
Drop transitions removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Iterating post reduction 1 with 75 rules applied. Total rules applied 150 place count 167 transition count 625
Drop transitions removed 82 transitions
Redundant transition composition rules discarded 82 transitions
Iterating global reduction 2 with 82 rules applied. Total rules applied 232 place count 167 transition count 543
Free-agglomeration rule applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 239 place count 167 transition count 536
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 246 place count 160 transition count 536
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 248 place count 160 transition count 534
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 250 place count 158 transition count 534
Partial Free-agglomeration rule applied 13 times.
Drop transitions removed 13 transitions
Iterating global reduction 4 with 13 rules applied. Total rules applied 263 place count 158 transition count 534
Applied a total of 263 rules in 88 ms. Remains 158 /654 variables (removed 496) and now considering 534/1766 (removed 1232) transitions.
Running SMT prover for 9 properties.
// Phase 1: matrix 534 rows 158 cols
[2022-05-17 11:38:43] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-17 11:38:44] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 11:38:44] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-05-17 11:38:44] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 11:38:44] [INFO ] After 226ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2022-05-17 11:38:44] [INFO ] After 459ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 148 ms.
[2022-05-17 11:38:44] [INFO ] After 689ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
[2022-05-17 11:38:44] [INFO ] Flatten gal took : 18 ms
[2022-05-17 11:38:44] [INFO ] Flatten gal took : 16 ms
[2022-05-17 11:38:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9628173414194263817.gal : 4 ms
[2022-05-17 11:38:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18213572778336311829.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms17032688394776382540;'/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/ReachabilityCardinality9628173414194263817.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18213572778336311829.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/ReachabilityCardinality18213572778336311829.prop.
Reachability property AtomicPropp10 is true.
SDD proceeding with computation,8 properties remain. new max is 2
SDD size :1 after 5
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :5 after 8
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :8 after 10
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :10 after 12
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :12 after 680
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :680 after 750
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :750 after 1177
Reachability property AtomicPropp18 is true.
Reachability property AtomicPropp17 is true.
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :1177 after 90944
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :90944 after 2.45411e+08
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :2.45411e+08 after 5.42287e+08
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :5.42287e+08 after 2.62279e+10
Reachability property AtomicPropp27 is true.
Reachability property AtomicPropp25 is true.
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :2.62279e+10 after 1.48595e+11
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :1.48595e+11 after 2.58757e+12
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :2.58757e+12 after 3.81205e+13
Detected timeout of ITS tools.
[2022-05-17 11:38:59] [INFO ] Flatten gal took : 16 ms
[2022-05-17 11:38:59] [INFO ] Applying decomposition
[2022-05-17 11:38:59] [INFO ] Flatten gal took : 17 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/graph15318015172445828330.txt' '-o' '/tmp/graph15318015172445828330.bin' '-w' '/tmp/graph15318015172445828330.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15318015172445828330.bin' '-l' '-1' '-v' '-w' '/tmp/graph15318015172445828330.weights' '-q' '0' '-e' '0.001'
[2022-05-17 11:38:59] [INFO ] Decomposing Gal with order
[2022-05-17 11:38:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 11:39:00] [INFO ] Removed a total of 673 redundant transitions.
[2022-05-17 11:39:00] [INFO ] Flatten gal took : 77 ms
[2022-05-17 11:39:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 10 ms.
[2022-05-17 11:39:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8523463244816479533.gal : 4 ms
[2022-05-17 11:39:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11693552629635052448.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms17032688394776382540;'/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/ReachabilityCardinality8523463244816479533.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11693552629635052448.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/ReachabilityCardinality11693552629635052448.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 9
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :9 after 10
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :10 after 650
Reachability property AtomicPropp29 is true.
Reachability property AtomicPropp28 is true.
Reachability property AtomicPropp19 is true.
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :650 after 256000
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :256000 after 256000
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3002763476543752375
[2022-05-17 11:39:15] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3002763476543752375
Running compilation step : cd /tmp/ltsmin3002763476543752375;'/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 789 ms.
Running link step : cd /tmp/ltsmin3002763476543752375;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin3002763476543752375;'/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' 'AtomicPropp23==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(F(G(F(G(p0)))) U ((p2 U p0)||p1))))'
Support contains 560 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 66 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2022-05-17 11:39:30] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-05-17 11:39:30] [INFO ] Computed 31 place invariants in 12 ms
[2022-05-17 11:39:31] [INFO ] Implicit Places using invariants in 655 ms returned [1976, 1977, 1978, 1979, 1980, 1989, 1990, 1991]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 658 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 42 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1984/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 386 ms :[(OR p0 p1), (OR p0 p1), true, p0, p0, p0]
Running random walk in product with property : Peterson-PT-7-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (AND (EQ s1807 1) (EQ s1947 1)) (AND (EQ s1819 1) (EQ s1920 1)) (AND (EQ s1789 1) (EQ s1955 1)) (AND (EQ s1798 1) (EQ s1951 1)) (AND (EQ s1793 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, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA Peterson-PT-7-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-7-LTLFireability-00 finished in 1239 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((!(X(p1) U p1)||p0))))'
Support contains 520 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 35 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2022-05-17 11:39:31] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-05-17 11:39:31] [INFO ] Computed 31 place invariants in 21 ms
[2022-05-17 11:39:32] [INFO ] Implicit Places using invariants in 794 ms returned [1976, 1977, 1978, 1979, 1980, 1989, 1990, 1991]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 796 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 34 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1984/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 164 ms :[true, (AND p1 (NOT p0)), p1, (AND p1 (NOT p0))]
Running random walk in product with property : Peterson-PT-7-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(OR (AND (EQ s1016 1) (EQ s1927 1)) (AND (EQ s896 1) (EQ s1921 1)) (AND (EQ s895 1) (EQ s1922 1)) (AND (EQ s894 1) (EQ s1923 1)) (AND (EQ s893 1) (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1803 steps with 0 reset in 48 ms.
FORMULA Peterson-PT-7-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-7-LTLFireability-01 finished in 1114 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p0)||G(X(G(p1)))))))'
Support contains 160 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 58 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2022-05-17 11:39:33] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-05-17 11:39:33] [INFO ] Computed 31 place invariants in 22 ms
[2022-05-17 11:39:33] [INFO ] Implicit Places using invariants in 700 ms returned [1976, 1977, 1978, 1979, 1980, 1989, 1990, 1991]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 702 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 51 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1984/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 198 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-PT-7-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=p0, acceptance={} source=5 dest: 2}]], initial=4, aps=[p1:(OR (AND (EQ s1807 1) (EQ s1947 1)) (AND (EQ s1819 1) (EQ s1920 1)) (AND (EQ s1789 1) (EQ s1955 1)) (AND (EQ s1798 1) (EQ s1951 1)) (AND (EQ s1793 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 64 steps with 0 reset in 2 ms.
FORMULA Peterson-PT-7-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-7-LTLFireability-02 finished in 1035 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G((p0 U p1)))&&F(X(((p1 U F(p1))||p2)))))'
Support contains 512 out of 1992 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 504 transitions
Trivial Post-agglo rules discarded 504 transitions
Performed 504 trivial Post agglomeration. Transition count delta: 504
Iterating post reduction 0 with 504 rules applied. Total rules applied 504 place count 1992 transition count 2592
Reduce places removed 504 places and 0 transitions.
Iterating post reduction 1 with 504 rules applied. Total rules applied 1008 place count 1488 transition count 2592
Performed 448 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 448 Pre rules applied. Total rules applied 1008 place count 1488 transition count 2144
Deduced a syphon composed of 448 places in 1 ms
Reduce places removed 448 places and 0 transitions.
Iterating global reduction 2 with 896 rules applied. Total rules applied 1904 place count 1040 transition count 2144
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 2016 place count 984 transition count 2088
Applied a total of 2016 rules in 162 ms. Remains 984 /1992 variables (removed 1008) and now considering 2088/3096 (removed 1008) transitions.
[2022-05-17 11:39:34] [INFO ] Flow matrix only has 1752 transitions (discarded 336 similar events)
// Phase 1: matrix 1752 rows 984 cols
[2022-05-17 11:39:34] [INFO ] Computed 31 place invariants in 4 ms
[2022-05-17 11:39:34] [INFO ] Implicit Places using invariants in 233 ms returned [968, 969, 970, 971, 972, 981, 982, 983]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 237 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 976/1992 places, 2088/3096 transitions.
Applied a total of 0 rules in 27 ms. Remains 976 /976 variables (removed 0) and now considering 2088/2088 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 976/1992 places, 2088/3096 transitions.
Stuttering acceptance computed with spot in 1816 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : Peterson-PT-7-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (AND (EQ s513 1) (EQ s758 1)) (AND (EQ s516 1) (EQ s589 1)) (AND (EQ s479 1) (EQ s509 1)) (AND (EQ s514 1) (EQ s561 1)) (AND (EQ s502 1) (EQ s799 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 0 reset in 8220 ms.
Stack based approach found an accepted trace after 129 steps with 0 reset with depth 130 and stack size 130 in 9 ms.
FORMULA Peterson-PT-7-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-7-LTLFireability-04 finished in 10509 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (p1 U G((F(p2)||(p0 U p3))))))'
Support contains 192 out of 1992 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 882 transitions
Trivial Post-agglo rules discarded 882 transitions
Performed 882 trivial Post agglomeration. Transition count delta: 882
Iterating post reduction 0 with 882 rules applied. Total rules applied 882 place count 1992 transition count 2214
Reduce places removed 882 places and 0 transitions.
Iterating post reduction 1 with 882 rules applied. Total rules applied 1764 place count 1110 transition count 2214
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 399 Pre rules applied. Total rules applied 1764 place count 1110 transition count 1815
Deduced a syphon composed of 399 places in 1 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 2 with 798 rules applied. Total rules applied 2562 place count 711 transition count 1815
Applied a total of 2562 rules in 103 ms. Remains 711 /1992 variables (removed 1281) and now considering 1815/3096 (removed 1281) transitions.
[2022-05-17 11:39:44] [INFO ] Flow matrix only has 1479 transitions (discarded 336 similar events)
// Phase 1: matrix 1479 rows 711 cols
[2022-05-17 11:39:44] [INFO ] Computed 31 place invariants in 6 ms
[2022-05-17 11:39:45] [INFO ] Implicit Places using invariants in 347 ms returned []
[2022-05-17 11:39:45] [INFO ] Flow matrix only has 1479 transitions (discarded 336 similar events)
// Phase 1: matrix 1479 rows 711 cols
[2022-05-17 11:39:45] [INFO ] Computed 31 place invariants in 3 ms
[2022-05-17 11:39:45] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 11:39:48] [INFO ] Implicit Places using invariants and state equation in 3182 ms returned []
Implicit Place search using SMT with State Equation took 3535 ms to find 0 implicit places.
[2022-05-17 11:39:48] [INFO ] Redundant transitions in 116 ms returned []
[2022-05-17 11:39:48] [INFO ] Flow matrix only has 1479 transitions (discarded 336 similar events)
// Phase 1: matrix 1479 rows 711 cols
[2022-05-17 11:39:48] [INFO ] Computed 31 place invariants in 5 ms
[2022-05-17 11:39:49] [INFO ] Dead Transitions using invariants and state equation in 698 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 711/1992 places, 1815/3096 transitions.
Finished structural reductions, in 1 iterations. Remains : 711/1992 places, 1815/3096 transitions.
Stuttering acceptance computed with spot in 496 ms :[(AND (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p0) (NOT p3) p1), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p0) (NOT p3) p1), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : Peterson-PT-7-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p3) (NOT p0) p1), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p2) (NOT p3) p0), acceptance={} source=0 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 7}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p3) p0), acceptance={} source=2 dest: 8}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(OR (AND (NOT p2) p3 p1) (AND (NOT p2) p0 p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p3) (NOT p0) p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p3) p0 (NOT p1)), acceptance={} source=3 dest: 8}, { cond=(OR (AND (NOT p2) p3 (NOT p1)) (AND (NOT p2) p0 (NOT p1))), acceptance={} source=3 dest: 9}, { cond=(AND (NOT p2) (NOT p3) p0 p1), acceptance={0} source=3 dest: 10}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p3) (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p3) p0 (NOT p1)), acceptance={} source=4 dest: 8}, { cond=(AND (NOT p2) (NOT p3) p0 p1), acceptance={} source=4 dest: 10}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p0) p1), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p3) p0 p1), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p2) (NOT p3) (NOT p0) p1), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p2) (NOT p3) p0 (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p2) (NOT p3) p0), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p0) p1), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 2}, { cond=(AND p0 p1), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p2) (NOT p3) p0), acceptance={0} source=8 dest: 8}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=9 dest: 1}, { cond=(AND (NOT p2) (NOT p3) p0), acceptance={} source=9 dest: 8}, { cond=(OR (AND (NOT p2) p3) (AND (NOT p2) p0)), acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=10 dest: 1}, { cond=(AND (NOT p2) (NOT p3) (NOT p0) p1), acceptance={0} source=10 dest: 3}, { cond=(AND (NOT p2) (NOT p3) p0 (NOT p1)), acceptance={} source=10 dest: 8}, { cond=(AND (NOT p2) (NOT p3) p0 p1), acceptance={0} source=10 dest: 10}]], initial=0, aps=[p0:(OR (AND (EQ s601 1) (EQ s666 1)) (AND (EQ s613 1) (EQ s639 1)) (AND (EQ s583 1) (EQ s674 1)) (AND (EQ s592 1) (EQ s670 1)) (AND (EQ s587 1) (EQ s681 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 379 ms.
Stack based approach found an accepted trace after 44 steps with 0 reset with depth 45 and stack size 45 in 2 ms.
FORMULA Peterson-PT-7-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-7-LTLFireability-05 finished in 5375 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||(G(p2)&&p1))))'
Support contains 184 out of 1992 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 882 transitions
Trivial Post-agglo rules discarded 882 transitions
Performed 882 trivial Post agglomeration. Transition count delta: 882
Iterating post reduction 0 with 882 rules applied. Total rules applied 882 place count 1992 transition count 2214
Reduce places removed 882 places and 0 transitions.
Iterating post reduction 1 with 882 rules applied. Total rules applied 1764 place count 1110 transition count 2214
Performed 447 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 447 Pre rules applied. Total rules applied 1764 place count 1110 transition count 1767
Deduced a syphon composed of 447 places in 0 ms
Reduce places removed 447 places and 0 transitions.
Iterating global reduction 2 with 894 rules applied. Total rules applied 2658 place count 663 transition count 1767
Applied a total of 2658 rules in 110 ms. Remains 663 /1992 variables (removed 1329) and now considering 1767/3096 (removed 1329) transitions.
[2022-05-17 11:39:50] [INFO ] Flow matrix only has 1431 transitions (discarded 336 similar events)
// Phase 1: matrix 1431 rows 663 cols
[2022-05-17 11:39:50] [INFO ] Computed 31 place invariants in 4 ms
[2022-05-17 11:39:50] [INFO ] Implicit Places using invariants in 291 ms returned [647, 648, 649, 650, 651, 660, 661, 662]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 294 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 655/1992 places, 1767/3096 transitions.
Applied a total of 0 rules in 23 ms. Remains 655 /655 variables (removed 0) and now considering 1767/1767 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 655/1992 places, 1767/3096 transitions.
Stuttering acceptance computed with spot in 102 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : Peterson-PT-7-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (AND (EQ s522 1) (EQ s643 1)) (AND (EQ s514 1) (EQ s637 1)) (AND (EQ s513 1) (EQ s638 1)) (AND (EQ s512 1) (EQ s639 1)) (AND (EQ s511 1) (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 497 reset in 574 ms.
Stack based approach found an accepted trace after 36 steps with 0 reset with depth 37 and stack size 36 in 1 ms.
FORMULA Peterson-PT-7-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-7-LTLFireability-06 finished in 1128 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(F(G((X(p0)||(p0 U p1))))))))'
Support contains 160 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 59 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2022-05-17 11:39:51] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-05-17 11:39:51] [INFO ] Computed 31 place invariants in 14 ms
[2022-05-17 11:39:51] [INFO ] Implicit Places using invariants in 697 ms returned [1976, 1977, 1978, 1979, 1980, 1989, 1990, 1991]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 699 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 50 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1984/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-PT-7-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (AND (EQ s1807 1) (EQ s1947 1)) (AND (EQ s1819 1) (EQ s1920 1)) (AND (EQ s1789 1) (EQ s1955 1)) (AND (EQ s1798 1) (EQ s1951 1)) (AND (EQ s1793 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 7191 ms.
Stack based approach found an accepted trace after 352 steps with 0 reset with depth 353 and stack size 353 in 16 ms.
FORMULA Peterson-PT-7-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-7-LTLFireability-07 finished in 8161 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(F(p0) U p1)&&(p0 U p2)))'
Support contains 3 out of 1992 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 896 transitions
Trivial Post-agglo rules discarded 896 transitions
Performed 896 trivial Post agglomeration. Transition count delta: 896
Iterating post reduction 0 with 896 rules applied. Total rules applied 896 place count 1992 transition count 2200
Reduce places removed 896 places and 0 transitions.
Iterating post reduction 1 with 896 rules applied. Total rules applied 1792 place count 1096 transition count 2200
Performed 447 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 447 Pre rules applied. Total rules applied 1792 place count 1096 transition count 1753
Deduced a syphon composed of 447 places in 1 ms
Reduce places removed 447 places and 0 transitions.
Iterating global reduction 2 with 894 rules applied. Total rules applied 2686 place count 649 transition count 1753
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 2 with 106 rules applied. Total rules applied 2792 place count 596 transition count 1700
Applied a total of 2792 rules in 113 ms. Remains 596 /1992 variables (removed 1396) and now considering 1700/3096 (removed 1396) transitions.
[2022-05-17 11:39:59] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
// Phase 1: matrix 1364 rows 596 cols
[2022-05-17 11:39:59] [INFO ] Computed 31 place invariants in 5 ms
[2022-05-17 11:39:59] [INFO ] Implicit Places using invariants in 404 ms returned [580, 581, 582, 583, 584, 593, 594, 595]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 405 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 588/1992 places, 1700/3096 transitions.
Applied a total of 0 rules in 20 ms. Remains 588 /588 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 588/1992 places, 1700/3096 transitions.
Stuttering acceptance computed with spot in 182 ms :[true, p1, (AND p1 p0), p0, (OR (NOT p2) p1)]
Running random walk in product with property : Peterson-PT-7-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p2)) p1), acceptance={0} source=4 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=4 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=4, aps=[p1:(EQ s337 1), p0:(EQ s388 1), p2:(NEQ s329 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 256 ms.
Product exploration explored 100000 steps with 0 reset in 295 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (AND (NOT p0) (NOT p1) p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (OR (AND (NOT p0) (NOT p2)) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT p1)), (X (NOT (AND p0 (NOT p1) p2))), (X (X (AND (NOT p0) (NOT p1) p2))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 799 ms. Reduced automaton from 5 states, 14 edges and 3 AP to 5 states, 11 edges and 2 AP.
Stuttering acceptance computed with spot in 158 ms :[true, (AND p1 p0), p1, p0, (AND p1 p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2022-05-17 11:40:01] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
// Phase 1: matrix 1364 rows 588 cols
[2022-05-17 11:40:01] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-17 11:40:01] [INFO ] [Real]Absence check using 23 positive place invariants in 7 ms returned sat
[2022-05-17 11:40:02] [INFO ] After 352ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2022-05-17 11:40:02] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 11:40:02] [INFO ] After 87ms SMT Verify possible using 497 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-17 11:40:02] [INFO ] After 584ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-17 11:40:02] [INFO ] [Nat]Absence check using 23 positive place invariants in 7 ms returned sat
[2022-05-17 11:40:02] [INFO ] After 343ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-17 11:40:03] [INFO ] After 218ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-17 11:40:03] [INFO ] Deduced a trap composed of 51 places in 221 ms of which 0 ms to minimize.
[2022-05-17 11:40:03] [INFO ] Deduced a trap composed of 21 places in 217 ms of which 2 ms to minimize.
[2022-05-17 11:40:03] [INFO ] Deduced a trap composed of 25 places in 220 ms of which 0 ms to minimize.
[2022-05-17 11:40:04] [INFO ] Deduced a trap composed of 49 places in 157 ms of which 0 ms to minimize.
[2022-05-17 11:40:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1044 ms
[2022-05-17 11:40:04] [INFO ] Deduced a trap composed of 25 places in 219 ms of which 0 ms to minimize.
[2022-05-17 11:40:04] [INFO ] Deduced a trap composed of 11 places in 214 ms of which 1 ms to minimize.
[2022-05-17 11:40:04] [INFO ] Deduced a trap composed of 11 places in 207 ms of which 0 ms to minimize.
[2022-05-17 11:40:05] [INFO ] Deduced a trap composed of 12 places in 218 ms of which 3 ms to minimize.
[2022-05-17 11:40:05] [INFO ] Deduced a trap composed of 42 places in 182 ms of which 1 ms to minimize.
[2022-05-17 11:40:05] [INFO ] Deduced a trap composed of 30 places in 195 ms of which 0 ms to minimize.
[2022-05-17 11:40:05] [INFO ] Deduced a trap composed of 34 places in 194 ms of which 1 ms to minimize.
[2022-05-17 11:40:06] [INFO ] Deduced a trap composed of 12 places in 219 ms of which 0 ms to minimize.
[2022-05-17 11:40:06] [INFO ] Deduced a trap composed of 13 places in 203 ms of which 2 ms to minimize.
[2022-05-17 11:40:06] [INFO ] Deduced a trap composed of 21 places in 197 ms of which 1 ms to minimize.
[2022-05-17 11:40:06] [INFO ] Deduced a trap composed of 30 places in 197 ms of which 0 ms to minimize.
[2022-05-17 11:40:07] [INFO ] Deduced a trap composed of 29 places in 198 ms of which 1 ms to minimize.
[2022-05-17 11:40:07] [INFO ] Deduced a trap composed of 52 places in 165 ms of which 1 ms to minimize.
[2022-05-17 11:40:07] [INFO ] Deduced a trap composed of 43 places in 175 ms of which 0 ms to minimize.
[2022-05-17 11:40:07] [INFO ] Deduced a trap composed of 43 places in 170 ms of which 1 ms to minimize.
[2022-05-17 11:40:08] [INFO ] Deduced a trap composed of 52 places in 167 ms of which 0 ms to minimize.
[2022-05-17 11:40:08] [INFO ] Deduced a trap composed of 43 places in 178 ms of which 0 ms to minimize.
[2022-05-17 11:40:08] [INFO ] Deduced a trap composed of 40 places in 171 ms of which 0 ms to minimize.
[2022-05-17 11:40:08] [INFO ] Deduced a trap composed of 52 places in 187 ms of which 1 ms to minimize.
[2022-05-17 11:40:09] [INFO ] Deduced a trap composed of 21 places in 172 ms of which 1 ms to minimize.
[2022-05-17 11:40:09] [INFO ] Deduced a trap composed of 36 places in 195 ms of which 0 ms to minimize.
[2022-05-17 11:40:09] [INFO ] Deduced a trap composed of 50 places in 194 ms of which 1 ms to minimize.
[2022-05-17 11:40:09] [INFO ] Deduced a trap composed of 19 places in 186 ms of which 1 ms to minimize.
[2022-05-17 11:40:10] [INFO ] Deduced a trap composed of 49 places in 193 ms of which 0 ms to minimize.
[2022-05-17 11:40:10] [INFO ] Deduced a trap composed of 34 places in 198 ms of which 1 ms to minimize.
[2022-05-17 11:40:10] [INFO ] Deduced a trap composed of 40 places in 171 ms of which 1 ms to minimize.
[2022-05-17 11:40:10] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 1 ms to minimize.
[2022-05-17 11:40:10] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 6624 ms
[2022-05-17 11:40:10] [INFO ] After 8052ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 148 ms.
[2022-05-17 11:40:11] [INFO ] After 8689ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 588 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 588/588 places, 1700/1700 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 587 transition count 1699
Applied a total of 2 rules in 33 ms. Remains 587 /588 variables (removed 1) and now considering 1699/1700 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 587/588 places, 1699/1700 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 470790 steps, run timeout after 3001 ms. (steps per millisecond=156 ) properties seen :{}
Probabilistic random walk after 470790 steps, saw 64131 distinct states, run finished after 3001 ms. (steps per millisecond=156 ) properties seen :0
Running SMT prover for 3 properties.
[2022-05-17 11:40:14] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
// Phase 1: matrix 1363 rows 587 cols
[2022-05-17 11:40:14] [INFO ] Computed 23 place invariants in 7 ms
[2022-05-17 11:40:14] [INFO ] [Real]Absence check using 23 positive place invariants in 7 ms returned sat
[2022-05-17 11:40:14] [INFO ] After 379ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2022-05-17 11:40:14] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 11:40:15] [INFO ] After 129ms SMT Verify possible using 497 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-17 11:40:15] [INFO ] After 658ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-17 11:40:15] [INFO ] [Nat]Absence check using 23 positive place invariants in 7 ms returned sat
[2022-05-17 11:40:15] [INFO ] After 359ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-17 11:40:15] [INFO ] After 169ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-17 11:40:15] [INFO ] Deduced a trap composed of 12 places in 193 ms of which 0 ms to minimize.
[2022-05-17 11:40:16] [INFO ] Deduced a trap composed of 16 places in 186 ms of which 0 ms to minimize.
[2022-05-17 11:40:16] [INFO ] Deduced a trap composed of 11 places in 203 ms of which 0 ms to minimize.
[2022-05-17 11:40:16] [INFO ] Deduced a trap composed of 48 places in 171 ms of which 1 ms to minimize.
[2022-05-17 11:40:16] [INFO ] Deduced a trap composed of 57 places in 167 ms of which 1 ms to minimize.
[2022-05-17 11:40:16] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1218 ms
[2022-05-17 11:40:17] [INFO ] Deduced a trap composed of 12 places in 216 ms of which 0 ms to minimize.
[2022-05-17 11:40:17] [INFO ] Deduced a trap composed of 52 places in 205 ms of which 1 ms to minimize.
[2022-05-17 11:40:17] [INFO ] Deduced a trap composed of 25 places in 204 ms of which 1 ms to minimize.
[2022-05-17 11:40:18] [INFO ] Deduced a trap composed of 21 places in 197 ms of which 1 ms to minimize.
[2022-05-17 11:40:18] [INFO ] Deduced a trap composed of 20 places in 190 ms of which 0 ms to minimize.
[2022-05-17 11:40:18] [INFO ] Deduced a trap composed of 21 places in 193 ms of which 0 ms to minimize.
[2022-05-17 11:40:18] [INFO ] Deduced a trap composed of 72 places in 181 ms of which 0 ms to minimize.
[2022-05-17 11:40:18] [INFO ] Deduced a trap composed of 52 places in 182 ms of which 0 ms to minimize.
[2022-05-17 11:40:19] [INFO ] Deduced a trap composed of 17 places in 184 ms of which 1 ms to minimize.
[2022-05-17 11:40:19] [INFO ] Deduced a trap composed of 58 places in 180 ms of which 1 ms to minimize.
[2022-05-17 11:40:19] [INFO ] Deduced a trap composed of 39 places in 186 ms of which 2 ms to minimize.
[2022-05-17 11:40:19] [INFO ] Deduced a trap composed of 30 places in 175 ms of which 1 ms to minimize.
[2022-05-17 11:40:20] [INFO ] Deduced a trap composed of 23 places in 193 ms of which 1 ms to minimize.
[2022-05-17 11:40:20] [INFO ] Deduced a trap composed of 36 places in 203 ms of which 0 ms to minimize.
[2022-05-17 11:40:20] [INFO ] Deduced a trap composed of 21 places in 202 ms of which 1 ms to minimize.
[2022-05-17 11:40:20] [INFO ] Deduced a trap composed of 34 places in 195 ms of which 1 ms to minimize.
[2022-05-17 11:40:21] [INFO ] Deduced a trap composed of 66 places in 194 ms of which 0 ms to minimize.
[2022-05-17 11:40:21] [INFO ] Deduced a trap composed of 34 places in 184 ms of which 1 ms to minimize.
[2022-05-17 11:40:21] [INFO ] Deduced a trap composed of 35 places in 190 ms of which 0 ms to minimize.
[2022-05-17 11:40:21] [INFO ] Deduced a trap composed of 97 places in 194 ms of which 1 ms to minimize.
[2022-05-17 11:40:22] [INFO ] Deduced a trap composed of 122 places in 192 ms of which 0 ms to minimize.
[2022-05-17 11:40:22] [INFO ] Deduced a trap composed of 52 places in 196 ms of which 0 ms to minimize.
[2022-05-17 11:40:22] [INFO ] Deduced a trap composed of 52 places in 199 ms of which 1 ms to minimize.
[2022-05-17 11:40:22] [INFO ] Deduced a trap composed of 12 places in 211 ms of which 0 ms to minimize.
[2022-05-17 11:40:23] [INFO ] Deduced a trap composed of 43 places in 179 ms of which 1 ms to minimize.
[2022-05-17 11:40:23] [INFO ] Deduced a trap composed of 43 places in 179 ms of which 0 ms to minimize.
[2022-05-17 11:40:23] [INFO ] Deduced a trap composed of 39 places in 176 ms of which 0 ms to minimize.
[2022-05-17 11:40:23] [INFO ] Deduced a trap composed of 39 places in 178 ms of which 0 ms to minimize.
[2022-05-17 11:40:23] [INFO ] Deduced a trap composed of 32 places in 185 ms of which 0 ms to minimize.
[2022-05-17 11:40:24] [INFO ] Deduced a trap composed of 21 places in 194 ms of which 0 ms to minimize.
[2022-05-17 11:40:24] [INFO ] Deduced a trap composed of 57 places in 180 ms of which 0 ms to minimize.
[2022-05-17 11:40:24] [INFO ] Deduced a trap composed of 56 places in 180 ms of which 1 ms to minimize.
[2022-05-17 11:40:25] [INFO ] Deduced a trap composed of 48 places in 174 ms of which 1 ms to minimize.
[2022-05-17 11:40:25] [INFO ] Deduced a trap composed of 30 places in 173 ms of which 0 ms to minimize.
[2022-05-17 11:40:25] [INFO ] Deduced a trap composed of 57 places in 172 ms of which 0 ms to minimize.
[2022-05-17 11:40:25] [INFO ] Deduced a trap composed of 57 places in 170 ms of which 0 ms to minimize.
[2022-05-17 11:40:25] [INFO ] Deduced a trap composed of 39 places in 168 ms of which 0 ms to minimize.
[2022-05-17 11:40:26] [INFO ] Deduced a trap composed of 52 places in 168 ms of which 1 ms to minimize.
[2022-05-17 11:40:26] [INFO ] Deduced a trap composed of 25 places in 170 ms of which 1 ms to minimize.
[2022-05-17 11:40:26] [INFO ] Deduced a trap composed of 12 places in 166 ms of which 1 ms to minimize.
[2022-05-17 11:40:26] [INFO ] Deduced a trap composed of 44 places in 160 ms of which 1 ms to minimize.
[2022-05-17 11:40:27] [INFO ] Deduced a trap composed of 31 places in 158 ms of which 1 ms to minimize.
[2022-05-17 11:40:27] [INFO ] Deduced a trap composed of 33 places in 182 ms of which 0 ms to minimize.
[2022-05-17 11:40:27] [INFO ] Deduced a trap composed of 52 places in 151 ms of which 1 ms to minimize.
[2022-05-17 11:40:27] [INFO ] Deduced a trap composed of 66 places in 162 ms of which 0 ms to minimize.
[2022-05-17 11:40:28] [INFO ] Deduced a trap composed of 39 places in 161 ms of which 1 ms to minimize.
[2022-05-17 11:40:28] [INFO ] Deduced a trap composed of 34 places in 166 ms of which 0 ms to minimize.
[2022-05-17 11:40:28] [INFO ] Deduced a trap composed of 30 places in 161 ms of which 0 ms to minimize.
[2022-05-17 11:40:28] [INFO ] Deduced a trap composed of 16 places in 178 ms of which 1 ms to minimize.
[2022-05-17 11:40:28] [INFO ] Deduced a trap composed of 21 places in 155 ms of which 0 ms to minimize.
[2022-05-17 11:40:29] [INFO ] Deduced a trap composed of 34 places in 157 ms of which 1 ms to minimize.
[2022-05-17 11:40:29] [INFO ] Deduced a trap composed of 48 places in 149 ms of which 0 ms to minimize.
[2022-05-17 11:40:29] [INFO ] Deduced a trap composed of 41 places in 164 ms of which 1 ms to minimize.
[2022-05-17 11:40:29] [INFO ] Deduced a trap composed of 66 places in 165 ms of which 1 ms to minimize.
[2022-05-17 11:40:30] [INFO ] Deduced a trap composed of 88 places in 162 ms of which 0 ms to minimize.
[2022-05-17 11:40:30] [INFO ] Deduced a trap composed of 57 places in 163 ms of which 0 ms to minimize.
[2022-05-17 11:40:30] [INFO ] Deduced a trap composed of 39 places in 174 ms of which 1 ms to minimize.
[2022-05-17 11:40:30] [INFO ] Deduced a trap composed of 66 places in 116 ms of which 0 ms to minimize.
[2022-05-17 11:40:30] [INFO ] Deduced a trap composed of 65 places in 120 ms of which 1 ms to minimize.
[2022-05-17 11:40:30] [INFO ] Trap strengthening (SAT) tested/added 60/59 trap constraints in 13844 ms
[2022-05-17 11:40:30] [INFO ] After 15445ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 161 ms.
[2022-05-17 11:40:31] [INFO ] After 16102ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 587 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 587/587 places, 1699/1699 transitions.
Applied a total of 0 rules in 25 ms. Remains 587 /587 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 587/587 places, 1699/1699 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 587/587 places, 1699/1699 transitions.
Applied a total of 0 rules in 21 ms. Remains 587 /587 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
[2022-05-17 11:40:31] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
// Phase 1: matrix 1363 rows 587 cols
[2022-05-17 11:40:31] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-17 11:40:31] [INFO ] Implicit Places using invariants in 378 ms returned []
[2022-05-17 11:40:31] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
// Phase 1: matrix 1363 rows 587 cols
[2022-05-17 11:40:31] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-17 11:40:31] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 11:40:34] [INFO ] Implicit Places using invariants and state equation in 2990 ms returned []
Implicit Place search using SMT with State Equation took 3370 ms to find 0 implicit places.
[2022-05-17 11:40:34] [INFO ] Redundant transitions in 37 ms returned []
[2022-05-17 11:40:34] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
// Phase 1: matrix 1363 rows 587 cols
[2022-05-17 11:40:34] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-17 11:40:35] [INFO ] Dead Transitions using invariants and state equation in 620 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 587/587 places, 1699/1699 transitions.
Graph (trivial) has 1280 edges and 587 vertex of which 448 / 587 are part of one of the 56 SCC in 0 ms
Free SCC test removed 392 places
Drop transitions removed 784 transitions
Ensure Unique test removed 390 transitions
Reduce isomorphic transitions removed 1174 transitions.
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 54 Pre rules applied. Total rules applied 1 place count 195 transition count 471
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 0 with 108 rules applied. Total rules applied 109 place count 141 transition count 471
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 133 place count 125 transition count 463
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 149 place count 117 transition count 455
Graph (trivial) has 58 edges and 117 vertex of which 50 / 117 are part of one of the 7 SCC in 0 ms
Free SCC test removed 43 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 156 place count 68 transition count 455
Drop transitions removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Graph (trivial) has 302 edges and 68 vertex of which 42 / 68 are part of one of the 7 SCC in 0 ms
Free SCC test removed 35 places
Iterating post reduction 0 with 51 rules applied. Total rules applied 207 place count 33 transition count 405
Drop transitions removed 210 transitions
Ensure Unique test removed 140 transitions
Reduce isomorphic transitions removed 350 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 557 place count 33 transition count 55
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 558 place count 33 transition count 54
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 558 place count 33 transition count 53
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 560 place count 32 transition count 53
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 561 place count 32 transition count 53
Applied a total of 561 rules in 18 ms. Remains 32 /587 variables (removed 555) and now considering 53/1699 (removed 1646) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 53 rows 32 cols
[2022-05-17 11:40:35] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-17 11:40:35] [INFO ] [Real]Absence check using 9 positive place invariants in 1 ms returned sat
[2022-05-17 11:40:35] [INFO ] After 14ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2022-05-17 11:40:35] [INFO ] After 23ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-05-17 11:40:35] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-17 11:40:35] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2022-05-17 11:40:35] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-17 11:40:35] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-05-17 11:40:35] [INFO ] After 55ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2022-05-17 11:40:35] [INFO ] Flatten gal took : 3 ms
[2022-05-17 11:40:35] [INFO ] Flatten gal took : 2 ms
[2022-05-17 11:40:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1223209268051778459.gal : 1 ms
[2022-05-17 11:40:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7088907659619410704.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms15898537817240892721;'/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/ReachabilityCardinality1223209268051778459.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7088907659619410704.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/ReachabilityCardinality7088907659619410704.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 7
Reachability property apf5 is true.
Reachability property apf0 is true.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :7 after 130
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :130 after 260
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :260 after 1266
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1266 after 2336
Reachability property apf4 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,9592,0.011707,4392,2,125,12,1188,6,0,184,834,0
Total reachable state count : 9592
Verifying 3 reachability properties.
Reachability property apf0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,108,0.011942,4392,2,52,12,1188,7,0,187,834,0
Reachability property apf4 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf4,27,0.01212,4392,2,39,12,1188,8,0,190,834,0
Reachability property apf5 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf5,108,0.012346,4392,2,52,12,1188,9,0,193,834,0
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (AND (NOT p0) (NOT p1) p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (OR (AND (NOT p0) (NOT p2)) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT p1)), (X (NOT (AND p0 (NOT p1) p2))), (X (X (AND (NOT p0) (NOT p1) p2))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 21 factoid took 773 ms. Reduced automaton from 5 states, 11 edges and 2 AP to 5 states, 11 edges and 2 AP.
Stuttering acceptance computed with spot in 138 ms :[true, (AND p1 p0), p1, p0, (AND p1 p0)]
Stuttering acceptance computed with spot in 168 ms :[true, (AND p1 p0), p1, p0, (AND p1 p0)]
Support contains 2 out of 588 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 1700/1700 transitions.
Applied a total of 0 rules in 13 ms. Remains 588 /588 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
[2022-05-17 11:40:36] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
// Phase 1: matrix 1364 rows 588 cols
[2022-05-17 11:40:36] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-17 11:40:36] [INFO ] Implicit Places using invariants in 366 ms returned []
[2022-05-17 11:40:36] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
// Phase 1: matrix 1364 rows 588 cols
[2022-05-17 11:40:36] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-17 11:40:37] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 11:40:40] [INFO ] Implicit Places using invariants and state equation in 3282 ms returned []
Implicit Place search using SMT with State Equation took 3654 ms to find 0 implicit places.
[2022-05-17 11:40:40] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
// Phase 1: matrix 1364 rows 588 cols
[2022-05-17 11:40:40] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-17 11:40:40] [INFO ] Dead Transitions using invariants and state equation in 625 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 588/588 places, 1700/1700 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 362 ms. Reduced automaton from 5 states, 11 edges and 2 AP to 5 states, 11 edges and 2 AP.
Stuttering acceptance computed with spot in 166 ms :[true, (AND p1 p0), p1, p0, (AND p1 p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2022-05-17 11:40:41] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
// Phase 1: matrix 1364 rows 588 cols
[2022-05-17 11:40:41] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-17 11:40:41] [INFO ] [Real]Absence check using 23 positive place invariants in 8 ms returned sat
[2022-05-17 11:40:42] [INFO ] After 345ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2022-05-17 11:40:42] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 11:40:42] [INFO ] After 94ms SMT Verify possible using 497 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-17 11:40:42] [INFO ] After 591ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-17 11:40:42] [INFO ] [Nat]Absence check using 23 positive place invariants in 9 ms returned sat
[2022-05-17 11:40:42] [INFO ] After 370ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-17 11:40:42] [INFO ] After 225ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-17 11:40:43] [INFO ] Deduced a trap composed of 51 places in 201 ms of which 0 ms to minimize.
[2022-05-17 11:40:43] [INFO ] Deduced a trap composed of 21 places in 213 ms of which 0 ms to minimize.
[2022-05-17 11:40:43] [INFO ] Deduced a trap composed of 25 places in 209 ms of which 1 ms to minimize.
[2022-05-17 11:40:43] [INFO ] Deduced a trap composed of 49 places in 141 ms of which 1 ms to minimize.
[2022-05-17 11:40:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 985 ms
[2022-05-17 11:40:44] [INFO ] Deduced a trap composed of 25 places in 213 ms of which 0 ms to minimize.
[2022-05-17 11:40:44] [INFO ] Deduced a trap composed of 11 places in 198 ms of which 1 ms to minimize.
[2022-05-17 11:40:44] [INFO ] Deduced a trap composed of 11 places in 203 ms of which 0 ms to minimize.
[2022-05-17 11:40:45] [INFO ] Deduced a trap composed of 12 places in 203 ms of which 0 ms to minimize.
[2022-05-17 11:40:45] [INFO ] Deduced a trap composed of 42 places in 190 ms of which 0 ms to minimize.
[2022-05-17 11:40:45] [INFO ] Deduced a trap composed of 30 places in 167 ms of which 0 ms to minimize.
[2022-05-17 11:40:45] [INFO ] Deduced a trap composed of 34 places in 192 ms of which 0 ms to minimize.
[2022-05-17 11:40:45] [INFO ] Deduced a trap composed of 12 places in 207 ms of which 0 ms to minimize.
[2022-05-17 11:40:46] [INFO ] Deduced a trap composed of 13 places in 200 ms of which 0 ms to minimize.
[2022-05-17 11:40:46] [INFO ] Deduced a trap composed of 21 places in 192 ms of which 1 ms to minimize.
[2022-05-17 11:40:46] [INFO ] Deduced a trap composed of 30 places in 185 ms of which 1 ms to minimize.
[2022-05-17 11:40:46] [INFO ] Deduced a trap composed of 29 places in 195 ms of which 1 ms to minimize.
[2022-05-17 11:40:47] [INFO ] Deduced a trap composed of 52 places in 175 ms of which 1 ms to minimize.
[2022-05-17 11:40:47] [INFO ] Deduced a trap composed of 43 places in 183 ms of which 1 ms to minimize.
[2022-05-17 11:40:47] [INFO ] Deduced a trap composed of 43 places in 183 ms of which 0 ms to minimize.
[2022-05-17 11:40:47] [INFO ] Deduced a trap composed of 52 places in 182 ms of which 0 ms to minimize.
[2022-05-17 11:40:48] [INFO ] Deduced a trap composed of 43 places in 165 ms of which 1 ms to minimize.
[2022-05-17 11:40:48] [INFO ] Deduced a trap composed of 40 places in 157 ms of which 1 ms to minimize.
[2022-05-17 11:40:48] [INFO ] Deduced a trap composed of 52 places in 182 ms of which 1 ms to minimize.
[2022-05-17 11:40:48] [INFO ] Deduced a trap composed of 21 places in 161 ms of which 1 ms to minimize.
[2022-05-17 11:40:49] [INFO ] Deduced a trap composed of 36 places in 194 ms of which 1 ms to minimize.
[2022-05-17 11:40:49] [INFO ] Deduced a trap composed of 50 places in 182 ms of which 1 ms to minimize.
[2022-05-17 11:40:49] [INFO ] Deduced a trap composed of 19 places in 204 ms of which 1 ms to minimize.
[2022-05-17 11:40:49] [INFO ] Deduced a trap composed of 49 places in 192 ms of which 0 ms to minimize.
[2022-05-17 11:40:50] [INFO ] Deduced a trap composed of 34 places in 198 ms of which 1 ms to minimize.
[2022-05-17 11:40:50] [INFO ] Deduced a trap composed of 40 places in 180 ms of which 0 ms to minimize.
[2022-05-17 11:40:50] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 1 ms to minimize.
[2022-05-17 11:40:50] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 6531 ms
[2022-05-17 11:40:50] [INFO ] After 7905ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 143 ms.
[2022-05-17 11:40:50] [INFO ] After 8571ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 588 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 588/588 places, 1700/1700 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 587 transition count 1699
Applied a total of 2 rules in 39 ms. Remains 587 /588 variables (removed 1) and now considering 1699/1700 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 587/588 places, 1699/1700 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 489411 steps, run timeout after 3001 ms. (steps per millisecond=163 ) properties seen :{}
Probabilistic random walk after 489411 steps, saw 68917 distinct states, run finished after 3003 ms. (steps per millisecond=162 ) properties seen :0
Running SMT prover for 3 properties.
[2022-05-17 11:40:54] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
// Phase 1: matrix 1363 rows 587 cols
[2022-05-17 11:40:54] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-17 11:40:54] [INFO ] [Real]Absence check using 23 positive place invariants in 9 ms returned sat
[2022-05-17 11:40:54] [INFO ] After 368ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2022-05-17 11:40:54] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 11:40:54] [INFO ] After 126ms SMT Verify possible using 497 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-17 11:40:54] [INFO ] After 669ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-17 11:40:54] [INFO ] [Nat]Absence check using 23 positive place invariants in 7 ms returned sat
[2022-05-17 11:40:55] [INFO ] After 349ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-17 11:40:55] [INFO ] After 170ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-17 11:40:55] [INFO ] Deduced a trap composed of 12 places in 205 ms of which 0 ms to minimize.
[2022-05-17 11:40:55] [INFO ] Deduced a trap composed of 16 places in 197 ms of which 0 ms to minimize.
[2022-05-17 11:40:56] [INFO ] Deduced a trap composed of 11 places in 205 ms of which 1 ms to minimize.
[2022-05-17 11:40:56] [INFO ] Deduced a trap composed of 48 places in 172 ms of which 0 ms to minimize.
[2022-05-17 11:40:56] [INFO ] Deduced a trap composed of 57 places in 156 ms of which 1 ms to minimize.
[2022-05-17 11:40:56] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1246 ms
[2022-05-17 11:40:57] [INFO ] Deduced a trap composed of 12 places in 216 ms of which 0 ms to minimize.
[2022-05-17 11:40:57] [INFO ] Deduced a trap composed of 52 places in 212 ms of which 0 ms to minimize.
[2022-05-17 11:40:57] [INFO ] Deduced a trap composed of 25 places in 213 ms of which 1 ms to minimize.
[2022-05-17 11:40:57] [INFO ] Deduced a trap composed of 21 places in 209 ms of which 1 ms to minimize.
[2022-05-17 11:40:58] [INFO ] Deduced a trap composed of 20 places in 206 ms of which 1 ms to minimize.
[2022-05-17 11:40:58] [INFO ] Deduced a trap composed of 21 places in 205 ms of which 1 ms to minimize.
[2022-05-17 11:40:58] [INFO ] Deduced a trap composed of 72 places in 198 ms of which 0 ms to minimize.
[2022-05-17 11:40:58] [INFO ] Deduced a trap composed of 52 places in 197 ms of which 1 ms to minimize.
[2022-05-17 11:40:59] [INFO ] Deduced a trap composed of 17 places in 202 ms of which 0 ms to minimize.
[2022-05-17 11:40:59] [INFO ] Deduced a trap composed of 58 places in 198 ms of which 0 ms to minimize.
[2022-05-17 11:40:59] [INFO ] Deduced a trap composed of 39 places in 214 ms of which 0 ms to minimize.
[2022-05-17 11:40:59] [INFO ] Deduced a trap composed of 30 places in 196 ms of which 0 ms to minimize.
[2022-05-17 11:41:00] [INFO ] Deduced a trap composed of 23 places in 195 ms of which 0 ms to minimize.
[2022-05-17 11:41:00] [INFO ] Deduced a trap composed of 36 places in 207 ms of which 0 ms to minimize.
[2022-05-17 11:41:00] [INFO ] Deduced a trap composed of 21 places in 206 ms of which 1 ms to minimize.
[2022-05-17 11:41:00] [INFO ] Deduced a trap composed of 34 places in 186 ms of which 1 ms to minimize.
[2022-05-17 11:41:01] [INFO ] Deduced a trap composed of 66 places in 197 ms of which 0 ms to minimize.
[2022-05-17 11:41:01] [INFO ] Deduced a trap composed of 34 places in 191 ms of which 0 ms to minimize.
[2022-05-17 11:41:01] [INFO ] Deduced a trap composed of 35 places in 181 ms of which 1 ms to minimize.
[2022-05-17 11:41:01] [INFO ] Deduced a trap composed of 97 places in 192 ms of which 1 ms to minimize.
[2022-05-17 11:41:02] [INFO ] Deduced a trap composed of 122 places in 195 ms of which 1 ms to minimize.
[2022-05-17 11:41:02] [INFO ] Deduced a trap composed of 52 places in 201 ms of which 0 ms to minimize.
[2022-05-17 11:41:02] [INFO ] Deduced a trap composed of 52 places in 197 ms of which 1 ms to minimize.
[2022-05-17 11:41:02] [INFO ] Deduced a trap composed of 12 places in 197 ms of which 0 ms to minimize.
[2022-05-17 11:41:03] [INFO ] Deduced a trap composed of 43 places in 184 ms of which 0 ms to minimize.
[2022-05-17 11:41:03] [INFO ] Deduced a trap composed of 43 places in 183 ms of which 0 ms to minimize.
[2022-05-17 11:41:03] [INFO ] Deduced a trap composed of 39 places in 180 ms of which 1 ms to minimize.
[2022-05-17 11:41:03] [INFO ] Deduced a trap composed of 39 places in 176 ms of which 0 ms to minimize.
[2022-05-17 11:41:04] [INFO ] Deduced a trap composed of 32 places in 189 ms of which 0 ms to minimize.
[2022-05-17 11:41:04] [INFO ] Deduced a trap composed of 21 places in 192 ms of which 1 ms to minimize.
[2022-05-17 11:41:04] [INFO ] Deduced a trap composed of 57 places in 192 ms of which 0 ms to minimize.
[2022-05-17 11:41:04] [INFO ] Deduced a trap composed of 56 places in 191 ms of which 0 ms to minimize.
[2022-05-17 11:41:05] [INFO ] Deduced a trap composed of 48 places in 197 ms of which 0 ms to minimize.
[2022-05-17 11:41:05] [INFO ] Deduced a trap composed of 30 places in 186 ms of which 1 ms to minimize.
[2022-05-17 11:41:05] [INFO ] Deduced a trap composed of 57 places in 183 ms of which 0 ms to minimize.
[2022-05-17 11:41:05] [INFO ] Deduced a trap composed of 57 places in 189 ms of which 1 ms to minimize.
[2022-05-17 11:41:06] [INFO ] Deduced a trap composed of 39 places in 188 ms of which 1 ms to minimize.
[2022-05-17 11:41:06] [INFO ] Deduced a trap composed of 52 places in 187 ms of which 0 ms to minimize.
[2022-05-17 11:41:06] [INFO ] Deduced a trap composed of 25 places in 183 ms of which 1 ms to minimize.
[2022-05-17 11:41:06] [INFO ] Deduced a trap composed of 12 places in 202 ms of which 1 ms to minimize.
[2022-05-17 11:41:07] [INFO ] Deduced a trap composed of 44 places in 182 ms of which 0 ms to minimize.
[2022-05-17 11:41:07] [INFO ] Deduced a trap composed of 31 places in 213 ms of which 1 ms to minimize.
[2022-05-17 11:41:07] [INFO ] Deduced a trap composed of 33 places in 199 ms of which 1 ms to minimize.
[2022-05-17 11:41:07] [INFO ] Deduced a trap composed of 52 places in 174 ms of which 1 ms to minimize.
[2022-05-17 11:41:08] [INFO ] Deduced a trap composed of 66 places in 195 ms of which 1 ms to minimize.
[2022-05-17 11:41:08] [INFO ] Deduced a trap composed of 39 places in 184 ms of which 0 ms to minimize.
[2022-05-17 11:41:08] [INFO ] Deduced a trap composed of 34 places in 177 ms of which 0 ms to minimize.
[2022-05-17 11:41:08] [INFO ] Deduced a trap composed of 30 places in 187 ms of which 1 ms to minimize.
[2022-05-17 11:41:09] [INFO ] Deduced a trap composed of 16 places in 173 ms of which 0 ms to minimize.
[2022-05-17 11:41:09] [INFO ] Deduced a trap composed of 21 places in 177 ms of which 0 ms to minimize.
[2022-05-17 11:41:09] [INFO ] Deduced a trap composed of 34 places in 191 ms of which 1 ms to minimize.
[2022-05-17 11:41:09] [INFO ] Deduced a trap composed of 48 places in 169 ms of which 0 ms to minimize.
[2022-05-17 11:41:10] [INFO ] Deduced a trap composed of 41 places in 176 ms of which 0 ms to minimize.
[2022-05-17 11:41:10] [INFO ] Deduced a trap composed of 66 places in 188 ms of which 1 ms to minimize.
[2022-05-17 11:41:10] [INFO ] Deduced a trap composed of 88 places in 173 ms of which 0 ms to minimize.
[2022-05-17 11:41:10] [INFO ] Deduced a trap composed of 57 places in 175 ms of which 1 ms to minimize.
[2022-05-17 11:41:11] [INFO ] Deduced a trap composed of 39 places in 203 ms of which 0 ms to minimize.
[2022-05-17 11:41:11] [INFO ] Deduced a trap composed of 66 places in 119 ms of which 1 ms to minimize.
[2022-05-17 11:41:11] [INFO ] Deduced a trap composed of 65 places in 128 ms of which 1 ms to minimize.
[2022-05-17 11:41:11] [INFO ] Trap strengthening (SAT) tested/added 60/59 trap constraints in 14633 ms
[2022-05-17 11:41:11] [INFO ] After 16266ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 167 ms.
[2022-05-17 11:41:11] [INFO ] After 16944ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 587 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 587/587 places, 1699/1699 transitions.
Applied a total of 0 rules in 20 ms. Remains 587 /587 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 587/587 places, 1699/1699 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 587/587 places, 1699/1699 transitions.
Applied a total of 0 rules in 24 ms. Remains 587 /587 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
[2022-05-17 11:41:11] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
// Phase 1: matrix 1363 rows 587 cols
[2022-05-17 11:41:11] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-17 11:41:12] [INFO ] Implicit Places using invariants in 563 ms returned []
[2022-05-17 11:41:12] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
// Phase 1: matrix 1363 rows 587 cols
[2022-05-17 11:41:12] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-17 11:41:12] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 11:41:15] [INFO ] Implicit Places using invariants and state equation in 3017 ms returned []
Implicit Place search using SMT with State Equation took 3599 ms to find 0 implicit places.
[2022-05-17 11:41:15] [INFO ] Redundant transitions in 22 ms returned []
[2022-05-17 11:41:15] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
// Phase 1: matrix 1363 rows 587 cols
[2022-05-17 11:41:15] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-17 11:41:16] [INFO ] Dead Transitions using invariants and state equation in 660 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 587/587 places, 1699/1699 transitions.
Graph (trivial) has 1280 edges and 587 vertex of which 448 / 587 are part of one of the 56 SCC in 1 ms
Free SCC test removed 392 places
Drop transitions removed 784 transitions
Ensure Unique test removed 390 transitions
Reduce isomorphic transitions removed 1174 transitions.
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 54 Pre rules applied. Total rules applied 1 place count 195 transition count 471
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 0 with 108 rules applied. Total rules applied 109 place count 141 transition count 471
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 133 place count 125 transition count 463
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 149 place count 117 transition count 455
Graph (trivial) has 58 edges and 117 vertex of which 50 / 117 are part of one of the 7 SCC in 0 ms
Free SCC test removed 43 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 156 place count 68 transition count 455
Drop transitions removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Graph (trivial) has 302 edges and 68 vertex of which 42 / 68 are part of one of the 7 SCC in 0 ms
Free SCC test removed 35 places
Iterating post reduction 0 with 51 rules applied. Total rules applied 207 place count 33 transition count 405
Drop transitions removed 210 transitions
Ensure Unique test removed 140 transitions
Reduce isomorphic transitions removed 350 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 557 place count 33 transition count 55
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 558 place count 33 transition count 54
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 558 place count 33 transition count 53
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 560 place count 32 transition count 53
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 561 place count 32 transition count 53
Applied a total of 561 rules in 22 ms. Remains 32 /587 variables (removed 555) and now considering 53/1699 (removed 1646) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 53 rows 32 cols
[2022-05-17 11:41:16] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-17 11:41:16] [INFO ] [Real]Absence check using 9 positive place invariants in 1 ms returned sat
[2022-05-17 11:41:16] [INFO ] After 15ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2022-05-17 11:41:16] [INFO ] After 24ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-05-17 11:41:16] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-17 11:41:16] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 11:41:16] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-17 11:41:16] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-05-17 11:41:16] [INFO ] After 71ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2022-05-17 11:41:16] [INFO ] Flatten gal took : 3 ms
[2022-05-17 11:41:16] [INFO ] Flatten gal took : 4 ms
[2022-05-17 11:41:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3783235695240543824.gal : 1 ms
[2022-05-17 11:41:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5599912748136927623.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms5545090442610478673;'/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/ReachabilityCardinality3783235695240543824.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5599912748136927623.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/ReachabilityCardinality5599912748136927623.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 7
Reachability property apf5 is true.
Reachability property apf0 is true.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :7 after 130
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :130 after 260
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :260 after 1266
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1266 after 2336
Reachability property apf4 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,9592,0.01435,4396,2,125,12,1188,6,0,184,834,0
Total reachable state count : 9592
Verifying 3 reachability properties.
Reachability property apf0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,108,0.014621,4396,2,52,12,1188,7,0,187,834,0
Reachability property apf4 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf4,27,0.014821,4396,2,39,12,1188,8,0,190,834,0
Reachability property apf5 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf5,108,0.014986,4396,2,52,12,1188,9,0,193,834,0
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 12 factoid took 553 ms. Reduced automaton from 5 states, 11 edges and 2 AP to 5 states, 11 edges and 2 AP.
Stuttering acceptance computed with spot in 130 ms :[true, (AND p1 p0), p1, p0, (AND p1 p0)]
Stuttering acceptance computed with spot in 145 ms :[true, (AND p1 p0), p1, p0, (AND p1 p0)]
Stuttering acceptance computed with spot in 137 ms :[true, (AND p1 p0), p1, p0, (AND p1 p0)]
Product exploration explored 100000 steps with 0 reset in 252 ms.
Product exploration explored 100000 steps with 0 reset in 298 ms.
Applying partial POR strategy [true, false, true, true, true]
Stuttering acceptance computed with spot in 171 ms :[true, (AND p1 p0), p1, p0, (AND p1 p0)]
Support contains 2 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 1700/1700 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 588 transition count 1700
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 1 rules in 70 ms. Remains 588 /588 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
[2022-05-17 11:41:18] [INFO ] Redundant transitions in 23 ms returned []
[2022-05-17 11:41:18] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
// Phase 1: matrix 1364 rows 588 cols
[2022-05-17 11:41:18] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-17 11:41:18] [INFO ] Dead Transitions using invariants and state equation in 628 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 588/588 places, 1700/1700 transitions.
Finished structural reductions, in 1 iterations. Remains : 588/588 places, 1700/1700 transitions.
Product exploration explored 100000 steps with 0 reset in 245 ms.
Product exploration explored 100000 steps with 0 reset in 292 ms.
Built C files in :
/tmp/ltsmin13475150421897899913
[2022-05-17 11:41:19] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13475150421897899913
Running compilation step : cd /tmp/ltsmin13475150421897899913;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13475150421897899913;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13475150421897899913;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 1700/1700 transitions.
Applied a total of 0 rules in 25 ms. Remains 588 /588 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
[2022-05-17 11:41:22] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
// Phase 1: matrix 1364 rows 588 cols
[2022-05-17 11:41:22] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-17 11:41:22] [INFO ] Implicit Places using invariants in 335 ms returned []
[2022-05-17 11:41:22] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
// Phase 1: matrix 1364 rows 588 cols
[2022-05-17 11:41:22] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-17 11:41:23] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 11:41:25] [INFO ] Implicit Places using invariants and state equation in 3154 ms returned []
Implicit Place search using SMT with State Equation took 3502 ms to find 0 implicit places.
[2022-05-17 11:41:25] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
// Phase 1: matrix 1364 rows 588 cols
[2022-05-17 11:41:25] [INFO ] Computed 23 place invariants in 7 ms
[2022-05-17 11:41:26] [INFO ] Dead Transitions using invariants and state equation in 609 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 588/588 places, 1700/1700 transitions.
Built C files in :
/tmp/ltsmin16147460573073276791
[2022-05-17 11:41:26] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16147460573073276791
Running compilation step : cd /tmp/ltsmin16147460573073276791;'/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 3002 ms.
Running link step : cd /tmp/ltsmin16147460573073276791;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin16147460573073276791;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5905135522307709078.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 11:41:41] [INFO ] Flatten gal took : 64 ms
[2022-05-17 11:41:41] [INFO ] Flatten gal took : 49 ms
[2022-05-17 11:41:41] [INFO ] Time to serialize gal into /tmp/LTL641884338494660343.gal : 7 ms
[2022-05-17 11:41:41] [INFO ] Time to serialize properties into /tmp/LTL4132718443331722170.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/LTL641884338494660343.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4132718443331722170.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/LTL6418843...265
Read 1 LTL properties
Checking formula 0 : !(((!((F("(EndTurn_6_4==1)"))U("(IsEndLoop_1_6_7==1)")))&&(("(EndTurn_6_4==1)")U("(IsEndLoop_1_2_7==0)"))))
Formula 0 simplified : !(!(F"(EndTurn_6_4==1)" U "(IsEndLoop_1_6_7==1)") & ("(EndTurn_6_4==1)" U "(IsEndLoop_1_2_7==0)"))
Detected timeout of ITS tools.
[2022-05-17 11:41:57] [INFO ] Flatten gal took : 49 ms
[2022-05-17 11:41:57] [INFO ] Applying decomposition
[2022-05-17 11:41:57] [INFO ] Flatten gal took : 48 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/graph16609496193464346887.txt' '-o' '/tmp/graph16609496193464346887.bin' '-w' '/tmp/graph16609496193464346887.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16609496193464346887.bin' '-l' '-1' '-v' '-w' '/tmp/graph16609496193464346887.weights' '-q' '0' '-e' '0.001'
[2022-05-17 11:41:57] [INFO ] Decomposing Gal with order
[2022-05-17 11:41:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 11:41:57] [INFO ] Removed a total of 2488 redundant transitions.
[2022-05-17 11:41:57] [INFO ] Flatten gal took : 145 ms
[2022-05-17 11:41:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 864 labels/synchronizations in 69 ms.
[2022-05-17 11:41:57] [INFO ] Time to serialize gal into /tmp/LTL9898118101098164872.gal : 11 ms
[2022-05-17 11:41:57] [INFO ] Time to serialize properties into /tmp/LTL17176026609622475377.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/LTL9898118101098164872.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17176026609622475377.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/LTL9898118...246
Read 1 LTL properties
Checking formula 0 : !(((!((F("(i2.i1.u39.EndTurn_6_4==1)"))U("(i14.i1.u60.IsEndLoop_1_6_7==1)")))&&(("(i2.i1.u39.EndTurn_6_4==1)")U("(i4.u5.IsEndLoop_1_2_...165
Formula 0 simplified : !(!(F"(i2.i1.u39.EndTurn_6_4==1)" U "(i14.i1.u60.IsEndLoop_1_6_7==1)") & ("(i2.i1.u39.EndTurn_6_4==1)" U "(i4.u5.IsEndLoop_1_2_7==0)...158
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16353778994331696082
[2022-05-17 11:42:12] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16353778994331696082
Running compilation step : cd /tmp/ltsmin16353778994331696082;'/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 2990 ms.
Running link step : cd /tmp/ltsmin16353778994331696082;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin16353778994331696082;'/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)) U (LTLAPp1==true))&&((LTLAPp0==true) U (LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Peterson-PT-7-LTLFireability-09 finished in 148401 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(p1)||p2)))'
Support contains 4 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 62 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2022-05-17 11:42:27] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-05-17 11:42:27] [INFO ] Computed 31 place invariants in 14 ms
[2022-05-17 11:42:28] [INFO ] Implicit Places using invariants in 878 ms returned [1976, 1977, 1978, 1979, 1980, 1989, 1990, 1991]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 882 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 61 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1984/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 207 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : Peterson-PT-7-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(EQ s536 1), p2:(AND (EQ s979 1) (EQ s1013 1)), p0:(EQ s1899 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Peterson-PT-7-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-7-LTLFireability-10 finished in 1251 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X((F(p0)||p0))||p1))))'
Support contains 3 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 72 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2022-05-17 11:42:28] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-05-17 11:42:28] [INFO ] Computed 31 place invariants in 10 ms
[2022-05-17 11:42:29] [INFO ] Implicit Places using invariants in 831 ms returned [1976, 1977, 1978, 1979, 1980, 1989, 1990, 1991]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 833 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 56 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1984/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-PT-7-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(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 (EQ s1812 1) (EQ s1974 1)), p0:(EQ s579 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 372 ms.
Stack based approach found an accepted trace after 1195 steps with 0 reset with depth 1196 and stack size 1196 in 5 ms.
FORMULA Peterson-PT-7-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-7-LTLFireability-11 finished in 1528 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(F(p1))&&p0))))'
Support contains 3 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 59 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2022-05-17 11:42:30] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-05-17 11:42:30] [INFO ] Computed 31 place invariants in 13 ms
[2022-05-17 11:42:31] [INFO ] Implicit Places using invariants in 820 ms returned [1976, 1977, 1978, 1979, 1980, 1989, 1990, 1991]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 822 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 64 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1984/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-PT-7-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s766 1), p0:(AND (EQ s1014 1) (EQ s1925 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][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 343 ms.
Stack based approach found an accepted trace after 544 steps with 0 reset with depth 545 and stack size 545 in 2 ms.
FORMULA Peterson-PT-7-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-7-LTLFireability-12 finished in 1442 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(X(p0)) U X(G(p1))) U p1)))'
Support contains 2 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 64 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2022-05-17 11:42:31] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-05-17 11:42:31] [INFO ] Computed 31 place invariants in 13 ms
[2022-05-17 11:42:32] [INFO ] Implicit Places using invariants in 804 ms returned [1976, 1977, 1978, 1979, 1980, 1989, 1990, 1991]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 806 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1984/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 55 ms. Remains 1984 /1984 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1984/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 233 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p0)]
Running random walk in product with property : Peterson-PT-7-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 5}, { cond=(AND p1 p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(EQ s208 1), p0:(EQ s446 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-7-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-7-LTLFireability-13 finished in 1189 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(!(p1 U X(p2))&&F(p3))))'
Support contains 6 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 69 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2022-05-17 11:42:33] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-05-17 11:42:33] [INFO ] Computed 31 place invariants in 9 ms
[2022-05-17 11:42:33] [INFO ] Implicit Places using invariants in 759 ms returned [1976, 1977, 1978, 1979, 1980, 1990, 1991]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 761 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1985/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 56 ms. Remains 1985 /1985 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1985/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 304 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) p2)), p2, p2, (NOT p3), (AND (NOT p0) p2), (AND (NOT p3) (NOT p0)), (AND (NOT p0) p2), true, (NOT p0)]
Running random walk in product with property : Peterson-PT-7-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=0 dest: 3}, { cond=p0, acceptance={} source=0 dest: 4}, { cond=(AND p0 (NOT p3)), acceptance={} source=0 dest: 5}, { cond=(AND p0 p1), acceptance={} source=0 dest: 6}], [{ cond=p2, acceptance={} source=1 dest: 7}], [{ cond=true, acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 7}, { cond=(AND p0 p2), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p3)), acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 2}, { cond=p0, acceptance={} source=6 dest: 4}, { cond=(AND p0 p1), acceptance={} source=6 dest: 6}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(NOT p0), acceptance={} source=8 dest: 7}, { cond=p0, acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(OR (EQ s1019 0) (EQ s1025 0)), p1:(AND (EQ s1019 1) (EQ s1025 1)), p3:(AND (EQ s1006 1) (EQ s1984 1)), p2:(AND (EQ s1340 1) (EQ s1844 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, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1310 ms.
Product exploration explored 100000 steps with 50000 reset in 1293 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p3 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p2))), (X p0), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2)))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (NOT p3)), (X p3), (X (AND p0 (NOT p3))), (X (NOT (AND p0 (NOT p3)))), (X (X (NOT p3))), (X (X p3)), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3)))))]
Property proved to be true thanks to knowledge :(X (NOT p2))
Knowledge based reduction with 18 factoid took 480 ms. Reduced automaton from 9 states, 21 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA Peterson-PT-7-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-PT-7-LTLFireability-14 finished in 4315 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((((G(p0) U p1)||p2) U X(G(p3)))))'
Support contains 7 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 63 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2022-05-17 11:42:37] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-05-17 11:42:37] [INFO ] Computed 31 place invariants in 11 ms
[2022-05-17 11:42:38] [INFO ] Implicit Places using invariants in 748 ms returned [1976, 1977, 1979, 1980, 1989, 1990, 1991]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 754 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1985/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 72 ms. Remains 1985 /1985 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1985/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 281 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p3)), (AND p0 (NOT p1) (NOT p3)), true, (NOT p0), (NOT p1)]
Running random walk in product with property : Peterson-PT-7-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=p3, acceptance={} source=1 dest: 1}, { cond=(NOT p3), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(OR (AND p2 p3) (AND p1 p3) (AND p0 p3)), acceptance={} source=2 dest: 2}, { cond=(OR (AND p2 (NOT p3)) (AND p1 (NOT p3)) (AND p0 (NOT p3))), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 4}], [{ cond=(OR (AND p2 (NOT p0) p3) (AND p1 (NOT p0) p3)), acceptance={} source=3 dest: 1}, { cond=(OR (AND p2 p0 p3) (AND p1 p0 p3)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p3)), acceptance={} source=3 dest: 6}], [{ cond=(AND p2 (NOT p1) p0 p3), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=4 dest: 7}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p3:(EQ s486 1), p2:(AND (EQ s1329 1) (EQ s1798 1)), p1:(AND (EQ s1337 1) (EQ s1812 1)), p0:(AND (EQ s1019 1) (EQ s1976 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-7-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-7-LTLFireability-15 finished in 1195 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(F(p0) U p1)&&(p0 U p2)))'
[2022-05-17 11:42:38] [INFO ] Flatten gal took : 72 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4669183042771393490
[2022-05-17 11:42:38] [INFO ] Too many transitions (3096) to apply POR reductions. Disabling POR matrices.
[2022-05-17 11:42:38] [INFO ] Applying decomposition
[2022-05-17 11:42:38] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4669183042771393490
Running compilation step : cd /tmp/ltsmin4669183042771393490;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' '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-05-17 11:42:38] [INFO ] Flatten gal took : 72 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/graph4204756359469257108.txt' '-o' '/tmp/graph4204756359469257108.bin' '-w' '/tmp/graph4204756359469257108.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4204756359469257108.bin' '-l' '-1' '-v' '-w' '/tmp/graph4204756359469257108.weights' '-q' '0' '-e' '0.001'
[2022-05-17 11:42:39] [INFO ] Decomposing Gal with order
[2022-05-17 11:42:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 11:42:39] [INFO ] Removed a total of 2835 redundant transitions.
[2022-05-17 11:42:39] [INFO ] Flatten gal took : 138 ms
[2022-05-17 11:42:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2022-05-17 11:42:39] [INFO ] Time to serialize gal into /tmp/LTLFireability1938766578584569686.gal : 16 ms
[2022-05-17 11:42:39] [INFO ] Time to serialize properties into /tmp/LTLFireability14447772453433554715.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/LTLFireability1938766578584569686.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14447772453433554715.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 1 LTL properties
Checking formula 0 : !(((!((F("(i47.u273.EndTurn_6_4==1)"))U("(i0.u348.IsEndLoop_1_6_7==1)")))&&(("(i47.u273.EndTurn_6_4==1)")U("(i31.i0.i0.u283.IsEndLoop_...169
Formula 0 simplified : !(!(F"(i47.u273.EndTurn_6_4==1)" U "(i0.u348.IsEndLoop_1_6_7==1)") & ("(i47.u273.EndTurn_6_4==1)" U "(i31.i0.i0.u283.IsEndLoop_1_2_7...162
Compilation finished in 7369 ms.
Running link step : cd /tmp/ltsmin4669183042771393490;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin4669183042771393490;'/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' '(!(<>((LTLAPp0==true)) U (LTLAPp1==true))&&((LTLAPp0==true) U (LTLAPp2==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-17 12:04:32] [INFO ] Applying decomposition
[2022-05-17 12:04:33] [INFO ] Flatten gal took : 553 ms
[2022-05-17 12:04:33] [INFO ] Decomposing Gal with order
[2022-05-17 12:04:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 12:04:38] [INFO ] Removed a total of 2137 redundant transitions.
[2022-05-17 12:04:39] [INFO ] Flatten gal took : 2398 ms
[2022-05-17 12:04:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 977 labels/synchronizations in 200 ms.
[2022-05-17 12:04:39] [INFO ] Time to serialize gal into /tmp/LTLFireability14749258762535742285.gal : 72 ms
[2022-05-17 12:04:39] [INFO ] Time to serialize properties into /tmp/LTLFireability2942045399722900962.ltl : 4 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/LTLFireability14749258762535742285.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2942045399722900962.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 1 LTL properties
Checking formula 0 : !(((!((F("(u2.EndTurn_6_4==1)"))U("(u1.IsEndLoop_1_6_7==1)")))&&(("(u2.EndTurn_6_4==1)")U("(u1.IsEndLoop_1_2_7!=1)"))))
Formula 0 simplified : !(!(F"(u2.EndTurn_6_4==1)" U "(u1.IsEndLoop_1_6_7==1)") & ("(u2.EndTurn_6_4==1)" U "(u1.IsEndLoop_1_2_7!=1)"))
Detected timeout of ITS tools.
[2022-05-17 12:26:32] [INFO ] Flatten gal took : 589 ms
[2022-05-17 12:26:34] [INFO ] Input system was already deterministic with 3096 transitions.
[2022-05-17 12:26:34] [INFO ] Transformed 1992 places.
[2022-05-17 12:26:34] [INFO ] Transformed 3096 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-05-17 12:26:36] [INFO ] Time to serialize gal into /tmp/LTLFireability9806906767422072251.gal : 16 ms
[2022-05-17 12:26:36] [INFO ] Time to serialize properties into /tmp/LTLFireability11313140979817160135.ltl : 9 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/LTLFireability9806906767422072251.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11313140979817160135.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("(EndTurn_6_4==1)"))U("(IsEndLoop_1_6_7==1)")))&&(("(EndTurn_6_4==1)")U("(IsEndLoop_1_2_7!=1)"))))
Formula 0 simplified : !(!(F"(EndTurn_6_4==1)" U "(IsEndLoop_1_6_7==1)") & ("(EndTurn_6_4==1)" U "(IsEndLoop_1_2_7!=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
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ 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="Peterson-PT-7"
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 Peterson-PT-7, 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 r168-tall-165277016200092"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-7.tgz
mv Peterson-PT-7 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 '
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 ;