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-165277016100060.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-3, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277016100060
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 812K
-rw-r--r-- 1 mcc users 44K Apr 30 09:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 212K Apr 30 09:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 34K Apr 30 09:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 169K Apr 30 09:17 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 19K May 9 08:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 9 08:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 9 08:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 9 08:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 9 08:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.6K 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 143K 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-3-LTLFireability-00
FORMULA_NAME Peterson-PT-3-LTLFireability-01
FORMULA_NAME Peterson-PT-3-LTLFireability-02
FORMULA_NAME Peterson-PT-3-LTLFireability-03
FORMULA_NAME Peterson-PT-3-LTLFireability-04
FORMULA_NAME Peterson-PT-3-LTLFireability-05
FORMULA_NAME Peterson-PT-3-LTLFireability-06
FORMULA_NAME Peterson-PT-3-LTLFireability-07
FORMULA_NAME Peterson-PT-3-LTLFireability-08
FORMULA_NAME Peterson-PT-3-LTLFireability-09
FORMULA_NAME Peterson-PT-3-LTLFireability-10
FORMULA_NAME Peterson-PT-3-LTLFireability-11
FORMULA_NAME Peterson-PT-3-LTLFireability-12
FORMULA_NAME Peterson-PT-3-LTLFireability-13
FORMULA_NAME Peterson-PT-3-LTLFireability-14
FORMULA_NAME Peterson-PT-3-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652779772948

Running Version 202205111006
[2022-05-17 09:29:34] [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 09:29:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 09:29:34] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2022-05-17 09:29:34] [INFO ] Transformed 244 places.
[2022-05-17 09:29:34] [INFO ] Transformed 332 transitions.
[2022-05-17 09:29:34] [INFO ] Found NUPN structural information;
[2022-05-17 09:29:34] [INFO ] Completing missing partition info from NUPN : creating a component with [TestAlone_1_2_3, TestAlone_2_2_3]
[2022-05-17 09:29:34] [INFO ] Parsed PT model containing 244 places and 332 transitions in 204 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Peterson-PT-3-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 189 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 14 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2022-05-17 09:29:34] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2022-05-17 09:29:34] [INFO ] Computed 15 place invariants in 18 ms
[2022-05-17 09:29:34] [INFO ] Implicit Places using invariants in 214 ms returned [230, 231, 232, 233]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 240 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 6 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 240/244 places, 332/332 transitions.
Support contains 189 out of 240 places after structural reductions.
[2022-05-17 09:29:34] [INFO ] Flatten gal took : 50 ms
[2022-05-17 09:29:35] [INFO ] Flatten gal took : 29 ms
[2022-05-17 09:29:35] [INFO ] Input system was already deterministic with 332 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 402 ms. (steps per millisecond=24 ) properties (out of 27) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2022-05-17 09:29:36] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 240 cols
[2022-05-17 09:29:36] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-17 09:29:36] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-17 09:29:36] [INFO ] After 392ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-17 09:29:36] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2022-05-17 09:29:36] [INFO ] After 188ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-17 09:29:36] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-05-17 09:29:36] [INFO ] After 145ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2022-05-17 09:29:37] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 10 ms to minimize.
[2022-05-17 09:29:37] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 2 ms to minimize.
[2022-05-17 09:29:37] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 1 ms to minimize.
[2022-05-17 09:29:37] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2022-05-17 09:29:37] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2022-05-17 09:29:37] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 0 ms to minimize.
[2022-05-17 09:29:37] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2022-05-17 09:29:37] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2022-05-17 09:29:37] [INFO ] Deduced a trap composed of 70 places in 56 ms of which 1 ms to minimize.
[2022-05-17 09:29:37] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 0 ms to minimize.
[2022-05-17 09:29:37] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 0 ms to minimize.
[2022-05-17 09:29:37] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 12 ms to minimize.
[2022-05-17 09:29:37] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1003 ms
[2022-05-17 09:29:38] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 0 ms to minimize.
[2022-05-17 09:29:38] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 0 ms to minimize.
[2022-05-17 09:29:38] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 0 ms to minimize.
[2022-05-17 09:29:38] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 12 ms to minimize.
[2022-05-17 09:29:38] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2022-05-17 09:29:38] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 0 ms to minimize.
[2022-05-17 09:29:38] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2022-05-17 09:29:38] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 548 ms
[2022-05-17 09:29:38] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 0 ms to minimize.
[2022-05-17 09:29:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2022-05-17 09:29:38] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2022-05-17 09:29:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2022-05-17 09:29:38] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 0 ms to minimize.
[2022-05-17 09:29:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2022-05-17 09:29:38] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2022-05-17 09:29:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2022-05-17 09:29:38] [INFO ] After 2194ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 173 ms.
[2022-05-17 09:29:39] [INFO ] After 2689ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 1 properties in 34 ms.
Support contains 51 out of 240 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 240/240 places, 332/332 transitions.
Drop transitions removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 240 transition count 274
Reduce places removed 58 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 59 rules applied. Total rules applied 117 place count 182 transition count 273
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 118 place count 181 transition count 273
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 118 place count 181 transition count 230
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 204 place count 138 transition count 230
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 226 place count 127 transition count 219
Applied a total of 226 rules in 29 ms. Remains 127 /240 variables (removed 113) and now considering 219/332 (removed 113) transitions.
Finished structural reductions, in 1 iterations. Remains : 127/240 places, 219/332 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2022-05-17 09:29:39] [INFO ] Flow matrix only has 195 transitions (discarded 24 similar events)
// Phase 1: matrix 195 rows 127 cols
[2022-05-17 09:29:39] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 09:29:39] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-17 09:29:40] [INFO ] After 198ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-17 09:29:40] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-17 09:29:40] [INFO ] After 104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-17 09:29:40] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-05-17 09:29:40] [INFO ] After 93ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-17 09:29:40] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2022-05-17 09:29:40] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2022-05-17 09:29:40] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 0 ms to minimize.
[2022-05-17 09:29:40] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 0 ms to minimize.
[2022-05-17 09:29:40] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2022-05-17 09:29:40] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 0 ms to minimize.
[2022-05-17 09:29:40] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2022-05-17 09:29:40] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 0 ms to minimize.
[2022-05-17 09:29:40] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 423 ms
[2022-05-17 09:29:40] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2022-05-17 09:29:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2022-05-17 09:29:40] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2022-05-17 09:29:40] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 6 ms to minimize.
[2022-05-17 09:29:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 110 ms
[2022-05-17 09:29:40] [INFO ] After 768ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 88 ms.
[2022-05-17 09:29:41] [INFO ] After 1018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 13 ms.
Support contains 50 out of 127 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 127/127 places, 219/219 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 127 transition count 218
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 126 transition count 218
Applied a total of 2 rules in 9 ms. Remains 126 /127 variables (removed 1) and now considering 218/219 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 126/127 places, 218/219 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 785635 steps, run timeout after 3001 ms. (steps per millisecond=261 ) properties seen :{0=1, 3=1, 4=1}
Probabilistic random walk after 785635 steps, saw 157316 distinct states, run finished after 3001 ms. (steps per millisecond=261 ) properties seen :3
Running SMT prover for 2 properties.
[2022-05-17 09:29:44] [INFO ] Flow matrix only has 194 transitions (discarded 24 similar events)
// Phase 1: matrix 194 rows 126 cols
[2022-05-17 09:29:44] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 09:29:44] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-17 09:29:44] [INFO ] After 46ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2022-05-17 09:29:44] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-05-17 09:29:44] [INFO ] After 19ms SMT Verify possible using 57 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-17 09:29:44] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-17 09:29:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-17 09:29:44] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-17 09:29:44] [INFO ] After 16ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-17 09:29:44] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 0 ms to minimize.
[2022-05-17 09:29:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2022-05-17 09:29:44] [INFO ] After 91ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 14 ms.
[2022-05-17 09:29:44] [INFO ] After 197ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 126 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 126/126 places, 218/218 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 126 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 125 transition count 217
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 2 place count 125 transition count 178
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 80 place count 86 transition count 178
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 2 with 2 rules applied. Total rules applied 82 place count 85 transition count 177
Applied a total of 82 rules in 19 ms. Remains 85 /126 variables (removed 41) and now considering 177/218 (removed 41) transitions.
Finished structural reductions, in 1 iterations. Remains : 85/126 places, 177/218 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Finished probabilistic random walk after 67388 steps, run visited all 2 properties in 198 ms. (steps per millisecond=340 )
Probabilistic random walk after 67388 steps, saw 13609 distinct states, run finished after 198 ms. (steps per millisecond=340 ) properties seen :2
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' '!(G(((p0 U p1) U !p2)))'
Support contains 72 out of 240 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 240/240 places, 332/332 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 240 transition count 296
Reduce places removed 36 places and 0 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Iterating post reduction 1 with 66 rules applied. Total rules applied 102 place count 204 transition count 266
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 132 place count 174 transition count 266
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 132 place count 174 transition count 253
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 158 place count 161 transition count 253
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 176 place count 152 transition count 244
Applied a total of 176 rules in 43 ms. Remains 152 /240 variables (removed 88) and now considering 244/332 (removed 88) transitions.
[2022-05-17 09:29:45] [INFO ] Flow matrix only has 220 transitions (discarded 24 similar events)
// Phase 1: matrix 220 rows 152 cols
[2022-05-17 09:29:45] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 09:29:45] [INFO ] Implicit Places using invariants in 59 ms returned []
[2022-05-17 09:29:45] [INFO ] Flow matrix only has 220 transitions (discarded 24 similar events)
// Phase 1: matrix 220 rows 152 cols
[2022-05-17 09:29:45] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-17 09:29:45] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-05-17 09:29:45] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2022-05-17 09:29:45] [INFO ] Redundant transitions in 13 ms returned []
[2022-05-17 09:29:45] [INFO ] Flow matrix only has 220 transitions (discarded 24 similar events)
// Phase 1: matrix 220 rows 152 cols
[2022-05-17 09:29:45] [INFO ] Computed 11 place invariants in 3 ms
[2022-05-17 09:29:46] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 152/240 places, 244/332 transitions.
Finished structural reductions, in 1 iterations. Remains : 152/240 places, 244/332 transitions.
Stuttering acceptance computed with spot in 255 ms :[p2, true, (NOT p1), p2]
Running random walk in product with property : Peterson-PT-3-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p2) p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=3 dest: 2}, { cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(OR (AND (EQ s132 1) (EQ s143 1)) (AND (EQ s135 1) (EQ s144 1)) (AND (EQ s132 1) (EQ s144 1)) (AND (EQ s135 1) (EQ s145 1)) (AND (EQ s132 1) (EQ s142 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA Peterson-PT-3-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-3-LTLFireability-00 finished in 716 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X(X(p0)) U X(p1)) U ((X(G(p2))&&!p3) U p3)))'
Support contains 148 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 332/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2022-05-17 09:29:46] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 240 cols
[2022-05-17 09:29:46] [INFO ] Computed 11 place invariants in 3 ms
[2022-05-17 09:29:46] [INFO ] Implicit Places using invariants in 75 ms returned []
[2022-05-17 09:29:46] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 240 cols
[2022-05-17 09:29:46] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 09:29:46] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-05-17 09:29:46] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2022-05-17 09:29:46] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 240 cols
[2022-05-17 09:29:46] [INFO ] Computed 11 place invariants in 3 ms
[2022-05-17 09:29:46] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 240/240 places, 332/332 transitions.
Stuttering acceptance computed with spot in 385 ms :[(NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), true, (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p2), (NOT p3)]
Running random walk in product with property : Peterson-PT-3-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(NOT p3), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p3) (NOT p1) p2), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p1) p0), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=5 dest: 7}], [{ cond=(NOT p2), acceptance={} source=6 dest: 4}, { cond=p2, acceptance={} source=6 dest: 6}], [{ cond=(NOT p3), acceptance={} source=7 dest: 6}, { cond=(NOT p3), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p3:(OR (AND (EQ s116 1) (EQ s133 1)) (AND (EQ s116 1) (EQ s135 1)) (AND (EQ s116 1) (EQ s134 1)) (AND (EQ s116 1) (EQ s137 1)) (AND (EQ s116 1) (EQ s136 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 3 steps with 0 reset in 1 ms.
FORMULA Peterson-PT-3-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-3-LTLFireability-01 finished in 805 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 4 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 332/332 transitions.
Applied a total of 0 rules in 15 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2022-05-17 09:29:47] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 240 cols
[2022-05-17 09:29:47] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 09:29:47] [INFO ] Implicit Places using invariants in 92 ms returned []
[2022-05-17 09:29:47] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 240 cols
[2022-05-17 09:29:47] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 09:29:47] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-05-17 09:29:47] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
[2022-05-17 09:29:47] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 240 cols
[2022-05-17 09:29:47] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-17 09:29:47] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 240/240 places, 332/332 transitions.
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-3-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s53 0) (EQ s59 0) (EQ s58 0) (EQ s60 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 66 steps with 0 reset in 2 ms.
FORMULA Peterson-PT-3-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-3-LTLFireability-03 finished in 611 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)&&p1))))'
Support contains 48 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 332/332 transitions.
Applied a total of 0 rules in 11 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2022-05-17 09:29:47] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 240 cols
[2022-05-17 09:29:47] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 09:29:47] [INFO ] Implicit Places using invariants in 73 ms returned []
[2022-05-17 09:29:47] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 240 cols
[2022-05-17 09:29:47] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 09:29:47] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-05-17 09:29:48] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
[2022-05-17 09:29:48] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 240 cols
[2022-05-17 09:29:48] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 09:29:48] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 240/240 places, 332/332 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-PT-3-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={0} source=2 dest: 0}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (AND (OR (EQ s111 0) (EQ s132 0)) (OR (EQ s111 0) (EQ s131 0)) (OR (EQ s111 0) (EQ s130 0)) (OR (EQ s111 0) (EQ s129 0)) (OR (EQ s109 0) (EQ s113 0...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1299 reset in 510 ms.
Stack based approach found an accepted trace after 103 steps with 1 reset with depth 43 and stack size 43 in 1 ms.
FORMULA Peterson-PT-3-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-3-LTLFireability-04 finished in 1068 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G((F(p2) U G(p3)))||p1)))'
Support contains 60 out of 240 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 240/240 places, 332/332 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 240 transition count 290
Reduce places removed 42 places and 0 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Iterating post reduction 1 with 78 rules applied. Total rules applied 120 place count 198 transition count 254
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 156 place count 162 transition count 254
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 156 place count 162 transition count 230
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 204 place count 138 transition count 230
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 222 place count 129 transition count 221
Applied a total of 222 rules in 21 ms. Remains 129 /240 variables (removed 111) and now considering 221/332 (removed 111) transitions.
[2022-05-17 09:29:48] [INFO ] Flow matrix only has 197 transitions (discarded 24 similar events)
// Phase 1: matrix 197 rows 129 cols
[2022-05-17 09:29:48] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 09:29:48] [INFO ] Implicit Places using invariants in 57 ms returned []
[2022-05-17 09:29:48] [INFO ] Flow matrix only has 197 transitions (discarded 24 similar events)
// Phase 1: matrix 197 rows 129 cols
[2022-05-17 09:29:48] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 09:29:48] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-05-17 09:29:49] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2022-05-17 09:29:49] [INFO ] Redundant transitions in 12 ms returned []
[2022-05-17 09:29:49] [INFO ] Flow matrix only has 197 transitions (discarded 24 similar events)
// Phase 1: matrix 197 rows 129 cols
[2022-05-17 09:29:49] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 09:29:49] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 129/240 places, 221/332 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/240 places, 221/332 transitions.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p3)), (NOT p2), (NOT p3)]
Running random walk in product with property : Peterson-PT-3-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p3 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p3) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=p3, acceptance={} source=2 dest: 2}, { cond=(NOT p3), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (EQ s101 1) (EQ s120 1)) (AND (EQ s91 1) (EQ s127 1)) (AND (EQ s104 1) (EQ s113 1)) (AND (EQ s90 1) (EQ s121 1)) (AND (EQ s89 1) (EQ s119 1)) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 5275 reset in 340 ms.
Stack based approach found an accepted trace after 39 steps with 2 reset with depth 14 and stack size 14 in 0 ms.
FORMULA Peterson-PT-3-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-3-LTLFireability-06 finished in 805 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (X(p1)&&((X(p0) U X(p2))||F(p2)))))'
Support contains 36 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 332/332 transitions.
Applied a total of 0 rules in 7 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2022-05-17 09:29:49] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 240 cols
[2022-05-17 09:29:49] [INFO ] Computed 11 place invariants in 3 ms
[2022-05-17 09:29:49] [INFO ] Implicit Places using invariants in 69 ms returned []
[2022-05-17 09:29:49] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 240 cols
[2022-05-17 09:29:49] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-17 09:29:49] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-05-17 09:29:49] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
[2022-05-17 09:29:49] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 240 cols
[2022-05-17 09:29:49] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 09:29:50] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 240/240 places, 332/332 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), true]
Running random walk in product with property : Peterson-PT-3-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s53 1) (EQ s59 1) (EQ s58 1) (EQ s60 1)), p2:(OR (AND (EQ s114 1) (EQ s233 1)) (AND (EQ s102 1) (EQ s237 1)) (AND (EQ s116 1) (EQ s234 1)) (AND...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 58 steps with 1 reset in 0 ms.
FORMULA Peterson-PT-3-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-3-LTLFireability-07 finished in 622 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((G(G(p0))||p0))||F(p1)))'
Support contains 4 out of 240 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 240/240 places, 332/332 transitions.
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 0 with 95 rules applied. Total rules applied 95 place count 240 transition count 237
Reduce places removed 95 places and 0 transitions.
Iterating post reduction 1 with 95 rules applied. Total rules applied 190 place count 145 transition count 237
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 190 place count 145 transition count 190
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 284 place count 98 transition count 190
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 308 place count 86 transition count 178
Applied a total of 308 rules in 20 ms. Remains 86 /240 variables (removed 154) and now considering 178/332 (removed 154) transitions.
[2022-05-17 09:29:50] [INFO ] Flow matrix only has 154 transitions (discarded 24 similar events)
// Phase 1: matrix 154 rows 86 cols
[2022-05-17 09:29:50] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-17 09:29:50] [INFO ] Implicit Places using invariants in 62 ms returned []
[2022-05-17 09:29:50] [INFO ] Flow matrix only has 154 transitions (discarded 24 similar events)
// Phase 1: matrix 154 rows 86 cols
[2022-05-17 09:29:50] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 09:29:50] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-05-17 09:29:50] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2022-05-17 09:29:50] [INFO ] Redundant transitions in 2 ms returned []
[2022-05-17 09:29:50] [INFO ] Flow matrix only has 154 transitions (discarded 24 similar events)
// Phase 1: matrix 154 rows 86 cols
[2022-05-17 09:29:50] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 09:29:50] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 86/240 places, 178/332 transitions.
Finished structural reductions, in 1 iterations. Remains : 86/240 places, 178/332 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-PT-3-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(AND (EQ s72 1) (EQ s85 1)), p0:(AND (EQ s52 1) (EQ s56 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1 reset in 122 ms.
Stack based approach found an accepted trace after 22 steps with 0 reset with depth 23 and stack size 23 in 0 ms.
FORMULA Peterson-PT-3-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-3-LTLFireability-08 finished in 516 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(X(p0)))))'
Support contains 2 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 332/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2022-05-17 09:29:50] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 240 cols
[2022-05-17 09:29:50] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 09:29:50] [INFO ] Implicit Places using invariants in 90 ms returned []
[2022-05-17 09:29:50] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 240 cols
[2022-05-17 09:29:50] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 09:29:50] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-05-17 09:29:51] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
[2022-05-17 09:29:51] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 240 cols
[2022-05-17 09:29:51] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 09:29:51] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 240/240 places, 332/332 transitions.
Stuttering acceptance computed with spot in 143 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-3-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(AND (EQ s102 1) (EQ s237 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][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-3-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-3-LTLFireability-09 finished in 650 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 2 out of 240 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 240/240 places, 332/332 transitions.
Drop transitions removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 240 transition count 238
Reduce places removed 94 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 95 rules applied. Total rules applied 189 place count 146 transition count 237
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 190 place count 145 transition count 237
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 190 place count 145 transition count 190
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 284 place count 98 transition count 190
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 306 place count 87 transition count 179
Applied a total of 306 rules in 16 ms. Remains 87 /240 variables (removed 153) and now considering 179/332 (removed 153) transitions.
[2022-05-17 09:29:51] [INFO ] Flow matrix only has 155 transitions (discarded 24 similar events)
// Phase 1: matrix 155 rows 87 cols
[2022-05-17 09:29:51] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-17 09:29:51] [INFO ] Implicit Places using invariants in 60 ms returned []
[2022-05-17 09:29:51] [INFO ] Flow matrix only has 155 transitions (discarded 24 similar events)
// Phase 1: matrix 155 rows 87 cols
[2022-05-17 09:29:51] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 09:29:51] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-05-17 09:29:51] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2022-05-17 09:29:51] [INFO ] Redundant transitions in 2 ms returned []
[2022-05-17 09:29:51] [INFO ] Flow matrix only has 155 transitions (discarded 24 similar events)
// Phase 1: matrix 155 rows 87 cols
[2022-05-17 09:29:51] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-17 09:29:51] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/240 places, 179/332 transitions.
Finished structural reductions, in 1 iterations. Remains : 87/240 places, 179/332 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-PT-3-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s6 1), p1:(NEQ s31 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 980 reset in 135 ms.
Stack based approach found an accepted trace after 441 steps with 1 reset with depth 37 and stack size 34 in 1 ms.
FORMULA Peterson-PT-3-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-3-LTLFireability-11 finished in 506 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!(p0 U X((X(F(G(p2)))&&G(p3)&&p1))))))'
Support contains 5 out of 240 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 240/240 places, 332/332 transitions.
Drop transitions removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 0 with 92 rules applied. Total rules applied 92 place count 240 transition count 240
Reduce places removed 92 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 93 rules applied. Total rules applied 185 place count 148 transition count 239
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 186 place count 147 transition count 239
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 186 place count 147 transition count 191
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 282 place count 99 transition count 191
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 306 place count 87 transition count 179
Applied a total of 306 rules in 27 ms. Remains 87 /240 variables (removed 153) and now considering 179/332 (removed 153) transitions.
[2022-05-17 09:29:51] [INFO ] Flow matrix only has 155 transitions (discarded 24 similar events)
// Phase 1: matrix 155 rows 87 cols
[2022-05-17 09:29:51] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 09:29:52] [INFO ] Implicit Places using invariants in 66 ms returned []
[2022-05-17 09:29:52] [INFO ] Flow matrix only has 155 transitions (discarded 24 similar events)
// Phase 1: matrix 155 rows 87 cols
[2022-05-17 09:29:52] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 09:29:52] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-05-17 09:29:52] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2022-05-17 09:29:52] [INFO ] Redundant transitions in 1 ms returned []
[2022-05-17 09:29:52] [INFO ] Flow matrix only has 155 transitions (discarded 24 similar events)
// Phase 1: matrix 155 rows 87 cols
[2022-05-17 09:29:52] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-17 09:29:52] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/240 places, 179/332 transitions.
Finished structural reductions, in 1 iterations. Remains : 87/240 places, 179/332 transitions.
Stuttering acceptance computed with spot in 423 ms :[(AND p1 p2 p3), (AND p1 p2 p3)]
Running random walk in product with property : Peterson-PT-3-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 p2 p3), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p2 p3), acceptance={} source=1 dest: 1}, { cond=(AND p1 p2 p3), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s50 1) (EQ s57 1)), p2:(AND (EQ s61 1) (EQ s72 1)), p3:(EQ s70 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 120 ms.
Product exploration explored 100000 steps with 0 reset in 152 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 p2) (NOT p3)), (X (NOT (AND p1 p2 p3))), (X (NOT (AND (NOT p1) p2 p3))), (X (X (NOT (AND p1 p2 p3)))), (X (X (NOT (AND (NOT p1) p2 p3))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 195 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 78 ms :[(AND p1 p2 p3), (AND p1 p2 p3)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Probably explored full state space saw : 75317 states, properties seen :1
Probabilistic random walk after 376585 steps, saw 75317 distinct states, run finished after 561 ms. (steps per millisecond=671 ) properties seen :1
Explored full state space saw : 75318 states, properties seen :0
Exhaustive walk after 376590 steps, saw 75318 distinct states, run finished after 471 ms. (steps per millisecond=799 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3)), (X (NOT (AND p1 p2 p3))), (X (NOT (AND (NOT p1) p2 p3))), (X (X (NOT (AND p1 p2 p3)))), (X (X (NOT (AND (NOT p1) p2 p3)))), (G (NOT (AND p1 p2 p3)))]
False Knowledge obtained : [(F (AND (NOT p1) p2 p3))]
Property proved to be true thanks to knowledge :(G (NOT (AND p1 p2 p3)))
Knowledge based reduction with 6 factoid took 193 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA Peterson-PT-3-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-PT-3-LTLFireability-12 finished in 2664 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U p1)||X(G(p2)))))'
Support contains 3 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 332/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2022-05-17 09:29:54] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 240 cols
[2022-05-17 09:29:54] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 09:29:54] [INFO ] Implicit Places using invariants in 86 ms returned []
[2022-05-17 09:29:54] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 240 cols
[2022-05-17 09:29:54] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 09:29:54] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-05-17 09:29:54] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
[2022-05-17 09:29:54] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 240 cols
[2022-05-17 09:29:54] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 09:29:55] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 240/240 places, 332/332 transitions.
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), true, (NOT p1)]
Running random walk in product with property : Peterson-PT-3-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), 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=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(NEQ s38 1), p0:(EQ s52 1), p2:(AND (EQ s38 0) (EQ s39 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 134 ms.
Product exploration explored 100000 steps with 0 reset in 197 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 p1 (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (OR p1 p0)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 565 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 500180 steps, run timeout after 3001 ms. (steps per millisecond=166 ) properties seen :{}
Probabilistic random walk after 500180 steps, saw 102705 distinct states, run finished after 3001 ms. (steps per millisecond=166 ) properties seen :0
Running SMT prover for 6 properties.
[2022-05-17 09:29:59] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 240 cols
[2022-05-17 09:29:59] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 09:29:59] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-17 09:29:59] [INFO ] After 128ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:5
[2022-05-17 09:30:00] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-05-17 09:30:00] [INFO ] After 18ms SMT Verify possible using 57 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-17 09:30:00] [INFO ] After 237ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-17 09:30:00] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-17 09:30:00] [INFO ] After 115ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-17 09:30:00] [INFO ] After 84ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-05-17 09:30:00] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 0 ms to minimize.
[2022-05-17 09:30:00] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2022-05-17 09:30:00] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 0 ms to minimize.
[2022-05-17 09:30:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 222 ms
[2022-05-17 09:30:00] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 0 ms to minimize.
[2022-05-17 09:30:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2022-05-17 09:30:00] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2022-05-17 09:30:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2022-05-17 09:30:00] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 0 ms to minimize.
[2022-05-17 09:30:00] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2022-05-17 09:30:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 159 ms
[2022-05-17 09:30:00] [INFO ] After 726ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 81 ms.
[2022-05-17 09:30:01] [INFO ] After 1017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 3 out of 240 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 240/240 places, 332/332 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 240 transition count 236
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 192 place count 144 transition count 236
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 192 place count 144 transition count 189
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 286 place count 97 transition count 189
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 306 place count 87 transition count 179
Applied a total of 306 rules in 11 ms. Remains 87 /240 variables (removed 153) and now considering 179/332 (removed 153) transitions.
Finished structural reductions, in 1 iterations. Remains : 87/240 places, 179/332 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Finished probabilistic random walk after 119968 steps, run visited all 6 properties in 527 ms. (steps per millisecond=227 )
Probabilistic random walk after 119968 steps, saw 24159 distinct states, run finished after 528 ms. (steps per millisecond=227 ) properties seen :6
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (OR p1 p0)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p0) (NOT p1))), (F p2), (F (AND (NOT p2) p0 (NOT p1))), (F (NOT (OR p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 14 factoid took 677 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), true, (NOT p1)]
Stuttering acceptance computed with spot in 968 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), true, (NOT p1)]
Support contains 3 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 332/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2022-05-17 09:30:03] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 240 cols
[2022-05-17 09:30:03] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-17 09:30:03] [INFO ] Implicit Places using invariants in 97 ms returned []
[2022-05-17 09:30:03] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 240 cols
[2022-05-17 09:30:03] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 09:30:04] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-05-17 09:30:04] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
[2022-05-17 09:30:04] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 240 cols
[2022-05-17 09:30:04] [INFO ] Computed 11 place invariants in 3 ms
[2022-05-17 09:30:04] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 240/240 places, 332/332 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 p0) p1 (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (OR p0 p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (OR p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 602 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) 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 6) 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 6) 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 6) 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 6) 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 6) seen :0
Interrupted probabilistic random walk after 575170 steps, run timeout after 3001 ms. (steps per millisecond=191 ) properties seen :{}
Probabilistic random walk after 575170 steps, saw 117148 distinct states, run finished after 3001 ms. (steps per millisecond=191 ) properties seen :0
Running SMT prover for 6 properties.
[2022-05-17 09:30:08] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 240 cols
[2022-05-17 09:30:08] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 09:30:08] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-17 09:30:08] [INFO ] After 130ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:5
[2022-05-17 09:30:08] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-05-17 09:30:08] [INFO ] After 16ms SMT Verify possible using 57 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-17 09:30:08] [INFO ] After 251ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-17 09:30:08] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-17 09:30:09] [INFO ] After 121ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-17 09:30:09] [INFO ] After 88ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-05-17 09:30:09] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2022-05-17 09:30:09] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 2 ms to minimize.
[2022-05-17 09:30:09] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 0 ms to minimize.
[2022-05-17 09:30:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 243 ms
[2022-05-17 09:30:09] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 0 ms to minimize.
[2022-05-17 09:30:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2022-05-17 09:30:09] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2022-05-17 09:30:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2022-05-17 09:30:09] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 0 ms to minimize.
[2022-05-17 09:30:09] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 0 ms to minimize.
[2022-05-17 09:30:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 158 ms
[2022-05-17 09:30:09] [INFO ] After 743ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 84 ms.
[2022-05-17 09:30:09] [INFO ] After 1042ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 240 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 240/240 places, 332/332 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 240 transition count 236
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 192 place count 144 transition count 236
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 192 place count 144 transition count 189
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 286 place count 97 transition count 189
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 306 place count 87 transition count 179
Applied a total of 306 rules in 10 ms. Remains 87 /240 variables (removed 153) and now considering 179/332 (removed 153) transitions.
Finished structural reductions, in 1 iterations. Remains : 87/240 places, 179/332 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) 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 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Finished probabilistic random walk after 119968 steps, run visited all 6 properties in 546 ms. (steps per millisecond=219 )
Probabilistic random walk after 119968 steps, saw 24159 distinct states, run finished after 546 ms. (steps per millisecond=219 ) properties seen :6
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (OR p0 p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (OR p0 p1)))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p0) (NOT p1))), (F p2), (F (AND (NOT p2) p0 (NOT p1))), (F (NOT (OR p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 14 factoid took 719 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), true, (NOT p1)]
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), true, (NOT p1)]
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), true, (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 140 ms.
Product exploration explored 100000 steps with 0 reset in 165 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), true, (NOT p1)]
Support contains 3 out of 240 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 240/240 places, 332/332 transitions.
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 240 transition count 332
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 40 Pre rules applied. Total rules applied 60 place count 240 transition count 350
Deduced a syphon composed of 100 places in 0 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 100 place count 240 transition count 350
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 139 place count 201 transition count 311
Deduced a syphon composed of 61 places in 0 ms
Iterating global reduction 1 with 39 rules applied. Total rules applied 178 place count 201 transition count 311
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 114 places in 0 ms
Iterating global reduction 1 with 53 rules applied. Total rules applied 231 place count 201 transition count 311
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 276 place count 156 transition count 266
Deduced a syphon composed of 69 places in 0 ms
Iterating global reduction 1 with 45 rules applied. Total rules applied 321 place count 156 transition count 266
Deduced a syphon composed of 69 places in 1 ms
Applied a total of 321 rules in 33 ms. Remains 156 /240 variables (removed 84) and now considering 266/332 (removed 66) transitions.
[2022-05-17 09:30:12] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-17 09:30:12] [INFO ] Flow matrix only has 242 transitions (discarded 24 similar events)
// Phase 1: matrix 242 rows 156 cols
[2022-05-17 09:30:12] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-17 09:30:12] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 156/240 places, 266/332 transitions.
Finished structural reductions, in 1 iterations. Remains : 156/240 places, 266/332 transitions.
Product exploration explored 100000 steps with 0 reset in 139 ms.
Product exploration explored 100000 steps with 0 reset in 198 ms.
Built C files in :
/tmp/ltsmin16265730949589447168
[2022-05-17 09:30:13] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16265730949589447168
Running compilation step : cd /tmp/ltsmin16265730949589447168;'/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 549 ms.
Running link step : cd /tmp/ltsmin16265730949589447168;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin16265730949589447168;'/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/stateBased5271116974003733985.hoa' '--buchi-type=spotba'
LTSmin run took 6630 ms.
FORMULA Peterson-PT-3-LTLFireability-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Peterson-PT-3-LTLFireability-14 finished in 25952 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(X((G(p0)||p1))))))'
Support contains 3 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 332/332 transitions.
Applied a total of 0 rules in 8 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2022-05-17 09:30:20] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 240 cols
[2022-05-17 09:30:20] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-17 09:30:20] [INFO ] Implicit Places using invariants in 107 ms returned []
[2022-05-17 09:30:20] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 240 cols
[2022-05-17 09:30:20] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 09:30:20] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-05-17 09:30:20] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
[2022-05-17 09:30:20] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 240 cols
[2022-05-17 09:30:20] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 09:30:21] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 240/240 places, 332/332 transitions.
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-PT-3-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (EQ s145 0) (EQ s216 0)), p1:(EQ s191 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 197 ms.
Product exploration explored 100000 steps with 25000 reset in 205 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 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) 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 2) seen :0
Interrupted probabilistic random walk after 858170 steps, run timeout after 3001 ms. (steps per millisecond=285 ) properties seen :{}
Probabilistic random walk after 858170 steps, saw 173624 distinct states, run finished after 3001 ms. (steps per millisecond=285 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-17 09:30:24] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 240 cols
[2022-05-17 09:30:24] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 09:30:25] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-17 09:30:25] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-17 09:30:25] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-17 09:30:25] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-17 09:30:25] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-05-17 09:30:25] [INFO ] After 31ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-17 09:30:25] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 0 ms to minimize.
[2022-05-17 09:30:25] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 0 ms to minimize.
[2022-05-17 09:30:25] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 3 ms to minimize.
[2022-05-17 09:30:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 196 ms
[2022-05-17 09:30:25] [INFO ] After 252ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2022-05-17 09:30:25] [INFO ] After 410ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 240 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 240/240 places, 332/332 transitions.
Drop transitions removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 240 transition count 238
Reduce places removed 94 places and 0 transitions.
Iterating post reduction 1 with 94 rules applied. Total rules applied 188 place count 146 transition count 238
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 188 place count 146 transition count 190
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 284 place count 98 transition count 190
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 308 place count 86 transition count 178
Applied a total of 308 rules in 10 ms. Remains 86 /240 variables (removed 154) and now considering 178/332 (removed 154) transitions.
Finished structural reductions, in 1 iterations. Remains : 86/240 places, 178/332 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 90273 steps, run visited all 1 properties in 113 ms. (steps per millisecond=798 )
Probabilistic random walk after 90273 steps, saw 18223 distinct states, run finished after 114 ms. (steps per millisecond=791 ) properties seen :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), true, (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1)))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Peterson-PT-3-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-PT-3-LTLFireability-15 finished in 5251 ms.
All properties solved by simple procedures.
Total runtime 51661 ms.

BK_STOP 1652779825887

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Peterson-PT-3"
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-3, 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-165277016100060"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-3.tgz
mv Peterson-PT-3 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;