Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 732K
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Apr 22 14:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 15:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 12 15:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 15:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 12 15:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 302K May 18 16:42 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 Anderson-PT-06-LTLFireability-00
FORMULA_NAME Anderson-PT-06-LTLFireability-01
FORMULA_NAME Anderson-PT-06-LTLFireability-02
FORMULA_NAME Anderson-PT-06-LTLFireability-03
FORMULA_NAME Anderson-PT-06-LTLFireability-04
FORMULA_NAME Anderson-PT-06-LTLFireability-05
FORMULA_NAME Anderson-PT-06-LTLFireability-06
FORMULA_NAME Anderson-PT-06-LTLFireability-07
FORMULA_NAME Anderson-PT-06-LTLFireability-08
FORMULA_NAME Anderson-PT-06-LTLFireability-09
FORMULA_NAME Anderson-PT-06-LTLFireability-10
FORMULA_NAME Anderson-PT-06-LTLFireability-11
FORMULA_NAME Anderson-PT-06-LTLFireability-12
FORMULA_NAME Anderson-PT-06-LTLFireability-13
FORMULA_NAME Anderson-PT-06-LTLFireability-14
FORMULA_NAME Anderson-PT-06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716515480822

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-06
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-24 01:51:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 01:51:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 01:51:24] [INFO ] Load time of PNML (sax parser for PT used): 140 ms
[2024-05-24 01:51:24] [INFO ] Transformed 229 places.
[2024-05-24 01:51:24] [INFO ] Transformed 600 transitions.
[2024-05-24 01:51:24] [INFO ] Found NUPN structural information;
[2024-05-24 01:51:24] [INFO ] Parsed PT model containing 229 places and 600 transitions and 2280 arcs in 277 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Anderson-PT-06-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-06-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 229 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 600/600 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 197 transition count 478
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 197 transition count 478
Applied a total of 64 rules in 64 ms. Remains 197 /229 variables (removed 32) and now considering 478/600 (removed 122) transitions.
// Phase 1: matrix 478 rows 197 cols
[2024-05-24 01:51:24] [INFO ] Computed 15 invariants in 41 ms
[2024-05-24 01:51:25] [INFO ] Implicit Places using invariants in 514 ms returned []
[2024-05-24 01:51:25] [INFO ] Invariant cache hit.
[2024-05-24 01:51:25] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-24 01:51:25] [INFO ] Implicit Places using invariants and state equation in 815 ms returned []
Implicit Place search using SMT with State Equation took 1377 ms to find 0 implicit places.
[2024-05-24 01:51:25] [INFO ] Invariant cache hit.
[2024-05-24 01:51:26] [INFO ] Dead Transitions using invariants and state equation in 461 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 197/229 places, 478/600 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1906 ms. Remains : 197/229 places, 478/600 transitions.
Support contains 50 out of 197 places after structural reductions.
[2024-05-24 01:51:26] [INFO ] Flatten gal took : 210 ms
[2024-05-24 01:51:27] [INFO ] Flatten gal took : 168 ms
[2024-05-24 01:51:27] [INFO ] Input system was already deterministic with 478 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 900 ms. (steps per millisecond=11 ) properties (out of 44) seen :24
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 13) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-05-24 01:51:28] [INFO ] Invariant cache hit.
[2024-05-24 01:51:28] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2024-05-24 01:51:28] [INFO ] [Real]Absence check using 7 positive and 8 generalized place invariants in 8 ms returned sat
[2024-05-24 01:51:28] [INFO ] After 174ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-24 01:51:29] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2024-05-24 01:51:29] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 9 ms returned sat
[2024-05-24 01:51:29] [INFO ] After 644ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-24 01:51:29] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-24 01:51:30] [INFO ] After 345ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2024-05-24 01:51:30] [INFO ] After 848ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 329 ms.
[2024-05-24 01:51:30] [INFO ] After 2002ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 155 ms.
Support contains 11 out of 197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 478/478 transitions.
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 28 Pre rules applied. Total rules applied 0 place count 197 transition count 450
Deduced a syphon composed of 28 places in 6 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 0 with 56 rules applied. Total rules applied 56 place count 169 transition count 450
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 78 place count 147 transition count 258
Iterating global reduction 0 with 22 rules applied. Total rules applied 100 place count 147 transition count 258
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 104 place count 145 transition count 256
Applied a total of 104 rules in 87 ms. Remains 145 /197 variables (removed 52) and now considering 256/478 (removed 222) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 145/197 places, 256/478 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 386 ms. (steps per millisecond=25 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 6) 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 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 256 rows 145 cols
[2024-05-24 01:51:32] [INFO ] Computed 15 invariants in 11 ms
[2024-05-24 01:51:32] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2024-05-24 01:51:32] [INFO ] [Real]Absence check using 8 positive and 7 generalized place invariants in 17 ms returned sat
[2024-05-24 01:51:32] [INFO ] After 401ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-24 01:51:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2024-05-24 01:51:32] [INFO ] [Nat]Absence check using 8 positive and 7 generalized place invariants in 12 ms returned sat
[2024-05-24 01:51:33] [INFO ] After 226ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-24 01:51:33] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-24 01:51:33] [INFO ] After 170ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-24 01:51:33] [INFO ] After 411ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 253 ms.
[2024-05-24 01:51:33] [INFO ] After 1017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 41 ms.
Support contains 10 out of 145 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 145/145 places, 256/256 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 144 transition count 255
Applied a total of 2 rules in 19 ms. Remains 144 /145 variables (removed 1) and now considering 255/256 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 144/145 places, 255/256 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 255 rows 144 cols
[2024-05-24 01:51:34] [INFO ] Computed 15 invariants in 4 ms
[2024-05-24 01:51:34] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2024-05-24 01:51:34] [INFO ] [Real]Absence check using 8 positive and 7 generalized place invariants in 12 ms returned sat
[2024-05-24 01:51:34] [INFO ] After 226ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 01:51:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2024-05-24 01:51:34] [INFO ] [Nat]Absence check using 8 positive and 7 generalized place invariants in 14 ms returned sat
[2024-05-24 01:51:34] [INFO ] After 156ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 01:51:34] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-24 01:51:34] [INFO ] After 80ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 01:51:34] [INFO ] After 142ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 50 ms.
[2024-05-24 01:51:34] [INFO ] After 430ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 144 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 255/255 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 142 transition count 233
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 142 transition count 233
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 141 transition count 232
Applied a total of 6 rules in 22 ms. Remains 141 /144 variables (removed 3) and now considering 232/255 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 141/144 places, 232/255 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 232 rows 141 cols
[2024-05-24 01:51:34] [INFO ] Computed 15 invariants in 3 ms
[2024-05-24 01:51:35] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2024-05-24 01:51:35] [INFO ] [Real]Absence check using 8 positive and 7 generalized place invariants in 14 ms returned sat
[2024-05-24 01:51:35] [INFO ] After 139ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-24 01:51:35] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-24 01:51:35] [INFO ] After 43ms SMT Verify possible using 30 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 01:51:35] [INFO ] After 271ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 01:51:35] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2024-05-24 01:51:35] [INFO ] [Nat]Absence check using 8 positive and 7 generalized place invariants in 14 ms returned sat
[2024-05-24 01:51:35] [INFO ] After 128ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 01:51:35] [INFO ] After 37ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 01:51:35] [INFO ] After 61ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2024-05-24 01:51:35] [INFO ] After 287ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 141 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 141/141 places, 232/232 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 140 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 140 transition count 221
Applied a total of 2 rules in 19 ms. Remains 140 /141 variables (removed 1) and now considering 221/232 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 140/141 places, 221/232 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 41526 steps, run visited all 1 properties in 213 ms. (steps per millisecond=194 )
Probabilistic random walk after 41526 steps, saw 23350 distinct states, run finished after 214 ms. (steps per millisecond=194 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&(p1 U (p2||G(p1)))))'
Support contains 5 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 478/478 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 173 transition count 264
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 173 transition count 264
Applied a total of 48 rules in 10 ms. Remains 173 /197 variables (removed 24) and now considering 264/478 (removed 214) transitions.
// Phase 1: matrix 264 rows 173 cols
[2024-05-24 01:51:36] [INFO ] Computed 15 invariants in 3 ms
[2024-05-24 01:51:36] [INFO ] Implicit Places using invariants in 279 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 295 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 172/197 places, 264/478 transitions.
Applied a total of 0 rules in 5 ms. Remains 172 /172 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 310 ms. Remains : 172/197 places, 264/478 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 412 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : Anderson-PT-06-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR p2 p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (NEQ s51 1) (OR (NEQ s36 1) (NOT (AND (EQ s14 1) (EQ s18 1))))), p1:(NEQ s51 1), p0:(AND (EQ s14 1) (EQ s22 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][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 357 ms.
Stack based approach found an accepted trace after 71 steps with 0 reset with depth 72 and stack size 72 in 1 ms.
FORMULA Anderson-PT-06-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-06-LTLFireability-00 finished in 1182 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(!p0) U X(p1)) U p2)))'
Support contains 5 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 478/478 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 172 transition count 263
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 172 transition count 263
Applied a total of 50 rules in 10 ms. Remains 172 /197 variables (removed 25) and now considering 263/478 (removed 215) transitions.
// Phase 1: matrix 263 rows 172 cols
[2024-05-24 01:51:37] [INFO ] Computed 15 invariants in 3 ms
[2024-05-24 01:51:37] [INFO ] Implicit Places using invariants in 234 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 239 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 171/197 places, 263/478 transitions.
Applied a total of 0 rules in 4 ms. Remains 171 /171 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 254 ms. Remains : 171/197 places, 263/478 transitions.
Stuttering acceptance computed with spot in 267 ms :[(NOT p2), (NOT p2), (NOT p1), (AND p0 (NOT p1)), p0]
Running random walk in product with property : Anderson-PT-06-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s56 1), p0:(AND (EQ s10 1) (EQ s25 1)), p1:(AND (NOT (AND (EQ s10 1) (EQ s25 1))) (NOT (AND (EQ s13 1) (EQ s21 1))))], 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]]
Product exploration explored 100000 steps with 27315 reset in 392 ms.
Product exploration explored 100000 steps with 27388 reset in 349 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 p2) (NOT p0) p1), (X (NOT (AND (NOT p2) p0))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 5 factoid took 321 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 272 ms :[(NOT p2), (NOT p2), (NOT p1), (AND p0 (NOT p1)), p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 332 ms. (steps per millisecond=30 ) properties (out of 5) seen :1
Finished Best-First random walk after 239 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=119 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND (NOT p2) p0))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (F p0), (F (AND p0 (NOT p1))), (F p2), (F (NOT p1)), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 5 factoid took 398 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 271 ms :[(NOT p2), (NOT p2), (NOT p1), (AND p0 (NOT p1)), p0]
Stuttering acceptance computed with spot in 260 ms :[(NOT p2), (NOT p2), (NOT p1), (AND p0 (NOT p1)), p0]
// Phase 1: matrix 263 rows 171 cols
[2024-05-24 01:51:40] [INFO ] Computed 14 invariants in 5 ms
[2024-05-24 01:51:41] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2024-05-24 01:51:41] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 34 ms returned unsat
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND (NOT p2) p0))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (F p0), (F (AND p0 (NOT p1))), (F p2), (F (NOT p1)), (F (AND p0 (NOT p2))), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 5 factoid took 494 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-06-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-06-LTLFireability-01 finished in 3989 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(F(p0))||(p1&&X(p2)))))'
Support contains 3 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 478/478 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 171 transition count 252
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 171 transition count 252
Applied a total of 52 rules in 6 ms. Remains 171 /197 variables (removed 26) and now considering 252/478 (removed 226) transitions.
// Phase 1: matrix 252 rows 171 cols
[2024-05-24 01:51:41] [INFO ] Computed 15 invariants in 4 ms
[2024-05-24 01:51:41] [INFO ] Implicit Places using invariants in 263 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 265 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/197 places, 252/478 transitions.
Applied a total of 0 rules in 2 ms. Remains 170 /170 variables (removed 0) and now considering 252/252 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 273 ms. Remains : 170/197 places, 252/478 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Anderson-PT-06-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s8 0) (EQ s21 0)), p0:(AND (EQ s8 1) (EQ s21 1)), p2:(EQ s33 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 50000 reset in 237 ms.
Product exploration explored 100000 steps with 50000 reset in 244 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) p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 122 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-06-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-06-LTLFireability-02 finished in 1084 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X((X(F(p1))||G(p2))))))'
Support contains 6 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 478/478 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 171 transition count 262
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 171 transition count 262
Applied a total of 52 rules in 5 ms. Remains 171 /197 variables (removed 26) and now considering 262/478 (removed 216) transitions.
// Phase 1: matrix 262 rows 171 cols
[2024-05-24 01:51:42] [INFO ] Computed 15 invariants in 6 ms
[2024-05-24 01:51:42] [INFO ] Implicit Places using invariants in 236 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 241 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/197 places, 262/478 transitions.
Applied a total of 0 rules in 1 ms. Remains 170 /170 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 249 ms. Remains : 170/197 places, 262/478 transitions.
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Anderson-PT-06-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(OR p0 p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s13 0) (EQ s19 0)), p2:(AND (EQ s5 1) (EQ s74 1)), p1:(AND (EQ s7 1) (EQ s22 1))], 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 47 reset in 146 ms.
Stack based approach found an accepted trace after 46 steps with 0 reset with depth 47 and stack size 47 in 1 ms.
FORMULA Anderson-PT-06-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-06-LTLFireability-03 finished in 610 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F((!p0 U (p1||G(!p0)))) U X(G(p2))))))'
Support contains 4 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 478/478 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 172 transition count 273
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 172 transition count 273
Applied a total of 50 rules in 4 ms. Remains 172 /197 variables (removed 25) and now considering 273/478 (removed 205) transitions.
// Phase 1: matrix 273 rows 172 cols
[2024-05-24 01:51:43] [INFO ] Computed 15 invariants in 2 ms
[2024-05-24 01:51:43] [INFO ] Implicit Places using invariants in 294 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 296 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 171/197 places, 273/478 transitions.
Applied a total of 0 rules in 1 ms. Remains 171 /171 variables (removed 0) and now considering 273/273 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 304 ms. Remains : 171/197 places, 273/478 transitions.
Stuttering acceptance computed with spot in 288 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : Anderson-PT-06-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s13 1) (EQ s23 1)), p1:(AND (NOT (AND (EQ s13 1) (EQ s26 1))) (NOT (AND (EQ s13 1) (EQ s21 1)))), p0:(AND (EQ s13 1) (EQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 138 ms.
Stack based approach found an accepted trace after 55 steps with 0 reset with depth 56 and stack size 56 in 0 ms.
FORMULA Anderson-PT-06-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-06-LTLFireability-04 finished in 759 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0||G(p1)))||(p2 U (p3||G(p2)))))'
Support contains 6 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 478/478 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 171 transition count 252
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 171 transition count 252
Applied a total of 52 rules in 4 ms. Remains 171 /197 variables (removed 26) and now considering 252/478 (removed 226) transitions.
// Phase 1: matrix 252 rows 171 cols
[2024-05-24 01:51:44] [INFO ] Computed 15 invariants in 2 ms
[2024-05-24 01:51:44] [INFO ] Implicit Places using invariants in 263 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 265 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/197 places, 252/478 transitions.
Applied a total of 0 rules in 2 ms. Remains 170 /170 variables (removed 0) and now considering 252/252 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 272 ms. Remains : 170/197 places, 252/478 transitions.
Stuttering acceptance computed with spot in 344 ms :[true, (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2))]
Running random walk in product with property : Anderson-PT-06-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) p1), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p3) p2 (NOT p0) p1), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p3) p2 p1), acceptance={} source=6 dest: 6}]], initial=1, aps=[p3:(AND (NOT (AND (EQ s13 1) (EQ s36 1))) (EQ s14 1) (EQ s24 1)), p2:(AND (EQ s14 1) (EQ s24 1)), p1:(OR (EQ s13 0) (EQ s30 0)), p0:(EQ s43 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 248 ms.
Product exploration explored 100000 steps with 50000 reset in 261 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 p3) (NOT p2) p1 p0), (X (NOT (AND (NOT p3) p2 (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p3) p2 (NOT p0) (NOT p1)))), (X (X (AND (NOT p3) (NOT p2)))), true, (X (X (AND (NOT p3) (NOT p2) p1))), (X (X (NOT (AND (NOT p3) p2 p1)))), (X (X p1)), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 38 ms. Reduced automaton from 7 states, 17 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-06-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-06-LTLFireability-05 finished in 1190 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(G(p1)))))'
Support contains 4 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 478/478 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 171 transition count 262
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 171 transition count 262
Applied a total of 52 rules in 5 ms. Remains 171 /197 variables (removed 26) and now considering 262/478 (removed 216) transitions.
// Phase 1: matrix 262 rows 171 cols
[2024-05-24 01:51:45] [INFO ] Computed 15 invariants in 4 ms
[2024-05-24 01:51:45] [INFO ] Implicit Places using invariants in 220 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 221 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/197 places, 262/478 transitions.
Applied a total of 0 rules in 2 ms. Remains 170 /170 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 228 ms. Remains : 170/197 places, 262/478 transitions.
Stuttering acceptance computed with spot in 166 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Anderson-PT-06-LTLFireability-07 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: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s9 1) (EQ s19 1)), p1:(OR (EQ s10 0) (EQ s22 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 25001 steps with 0 reset in 27 ms.
FORMULA Anderson-PT-06-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-06-LTLFireability-07 finished in 443 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G((F(p1)&&p0)))&&((p2 U p3)||X(p4))))'
Support contains 10 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 478/478 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 174 transition count 295
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 174 transition count 295
Applied a total of 46 rules in 4 ms. Remains 174 /197 variables (removed 23) and now considering 295/478 (removed 183) transitions.
// Phase 1: matrix 295 rows 174 cols
[2024-05-24 01:51:45] [INFO ] Computed 15 invariants in 2 ms
[2024-05-24 01:51:45] [INFO ] Implicit Places using invariants in 260 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 263 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 173/197 places, 295/478 transitions.
Applied a total of 0 rules in 2 ms. Remains 173 /173 variables (removed 0) and now considering 295/295 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 270 ms. Remains : 173/197 places, 295/478 transitions.
Stuttering acceptance computed with spot in 340 ms :[(OR (NOT p1) (NOT p0) (AND (NOT p3) (NOT p4))), (OR (NOT p0) (NOT p1)), (AND p0 (NOT p4)), (OR (AND p2 (NOT p3) (NOT p4)) (AND p0 (NOT p3) (NOT p4))), true, (NOT p1), (NOT p3)]
Running random walk in product with property : Anderson-PT-06-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=(AND p0 (NOT p4)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2) p0 (NOT p4)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p4)), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p3:(AND (EQ s10 1) (EQ s28 1)), p2:(AND (EQ s7 1) (EQ s24 1)), p0:(AND (EQ s8 1) (EQ s20 1)), p1:(AND (EQ s16 1) (EQ s26 1)), p4:(OR (EQ s13 0) (EQ s22 0)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-06-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-06-LTLFireability-09 finished in 633 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((F(p0) U G(p1))&&X((p2||(p3 U p4))))))'
Support contains 7 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 478/478 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 172 transition count 263
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 172 transition count 263
Applied a total of 50 rules in 7 ms. Remains 172 /197 variables (removed 25) and now considering 263/478 (removed 215) transitions.
// Phase 1: matrix 263 rows 172 cols
[2024-05-24 01:51:46] [INFO ] Computed 15 invariants in 2 ms
[2024-05-24 01:51:46] [INFO ] Implicit Places using invariants in 232 ms returned []
[2024-05-24 01:51:46] [INFO ] Invariant cache hit.
[2024-05-24 01:51:46] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-24 01:51:47] [INFO ] Implicit Places using invariants and state equation in 580 ms returned []
Implicit Place search using SMT with State Equation took 815 ms to find 0 implicit places.
[2024-05-24 01:51:47] [INFO ] Invariant cache hit.
[2024-05-24 01:51:47] [INFO ] Dead Transitions using invariants and state equation in 280 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 172/197 places, 263/478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1104 ms. Remains : 172/197 places, 263/478 transitions.
Stuttering acceptance computed with spot in 336 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p4))), (NOT p0), (NOT p1), (AND (NOT p2) (NOT p4)), true, (NOT p4)]
Running random walk in product with property : Anderson-PT-06-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p4) (NOT p3)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) (NOT p4) p3), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p4) (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p4) p3), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s9 1) (EQ s24 1)), p0:(EQ s57 1), p2:(AND (EQ s0 1) (EQ s165 1)), p4:(AND (EQ s10 1) (EQ s22 1)), p3:(OR (EQ s57 1) (AND (EQ s0 1) (EQ s165 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 230 ms.
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Anderson-PT-06-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-06-LTLFireability-10 finished in 1702 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 6 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 478/478 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 0 place count 197 transition count 449
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 58 place count 168 transition count 449
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 84 place count 142 transition count 233
Iterating global reduction 0 with 26 rules applied. Total rules applied 110 place count 142 transition count 233
Applied a total of 110 rules in 34 ms. Remains 142 /197 variables (removed 55) and now considering 233/478 (removed 245) transitions.
// Phase 1: matrix 233 rows 142 cols
[2024-05-24 01:51:48] [INFO ] Computed 15 invariants in 2 ms
[2024-05-24 01:51:48] [INFO ] Implicit Places using invariants in 221 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 222 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 141/197 places, 233/478 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 141 transition count 211
Reduce places removed 22 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 28 rules applied. Total rules applied 50 place count 119 transition count 205
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 56 place count 113 transition count 205
Applied a total of 56 rules in 25 ms. Remains 113 /141 variables (removed 28) and now considering 205/233 (removed 28) transitions.
// Phase 1: matrix 205 rows 113 cols
[2024-05-24 01:51:48] [INFO ] Computed 14 invariants in 1 ms
[2024-05-24 01:51:48] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-05-24 01:51:48] [INFO ] Invariant cache hit.
[2024-05-24 01:51:48] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-24 01:51:48] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 641 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 113/197 places, 205/478 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 924 ms. Remains : 113/197 places, 205/478 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-06-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (AND (EQ s15 1) (EQ s20 1)) (AND (EQ s3 1) (EQ s64 1))), p1:(AND (EQ s6 1) (EQ s24 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 235 reset in 221 ms.
Stack based approach found an accepted trace after 40 steps with 0 reset with depth 41 and stack size 41 in 0 ms.
FORMULA Anderson-PT-06-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-06-LTLFireability-11 finished in 1248 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0 U p1))))'
Support contains 3 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 478/478 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 171 transition count 252
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 171 transition count 252
Applied a total of 52 rules in 14 ms. Remains 171 /197 variables (removed 26) and now considering 252/478 (removed 226) transitions.
// Phase 1: matrix 252 rows 171 cols
[2024-05-24 01:51:49] [INFO ] Computed 15 invariants in 2 ms
[2024-05-24 01:51:49] [INFO ] Implicit Places using invariants in 241 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 243 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/197 places, 252/478 transitions.
Applied a total of 0 rules in 5 ms. Remains 170 /170 variables (removed 0) and now considering 252/252 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 262 ms. Remains : 170/197 places, 252/478 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : Anderson-PT-06-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s25 1), p0:(AND (EQ s7 1) (EQ s21 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-06-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-06-LTLFireability-12 finished in 427 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||(p1 U X(p2))) U p2))'
Support contains 6 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 478/478 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 172 transition count 273
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 172 transition count 273
Applied a total of 50 rules in 12 ms. Remains 172 /197 variables (removed 25) and now considering 273/478 (removed 205) transitions.
// Phase 1: matrix 273 rows 172 cols
[2024-05-24 01:51:49] [INFO ] Computed 15 invariants in 2 ms
[2024-05-24 01:51:49] [INFO ] Implicit Places using invariants in 195 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 199 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 171/197 places, 273/478 transitions.
Applied a total of 0 rules in 4 ms. Remains 171 /171 variables (removed 0) and now considering 273/273 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 215 ms. Remains : 171/197 places, 273/478 transitions.
Stuttering acceptance computed with spot in 170 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : Anderson-PT-06-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p2:(AND (EQ s6 1) (EQ s19 1)), p0:(AND (EQ s15 1) (EQ s20 1)), p1:(AND (EQ s9 1) (EQ s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-06-LTLFireability-13 finished in 412 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0||F(G(p1))) U (G(!p2)||(!p2&&F(!p1))))))'
Support contains 6 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 478/478 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 170 transition count 251
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 170 transition count 251
Applied a total of 54 rules in 8 ms. Remains 170 /197 variables (removed 27) and now considering 251/478 (removed 227) transitions.
// Phase 1: matrix 251 rows 170 cols
[2024-05-24 01:51:50] [INFO ] Computed 15 invariants in 2 ms
[2024-05-24 01:51:50] [INFO ] Implicit Places using invariants in 337 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 339 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 169/197 places, 251/478 transitions.
Applied a total of 0 rules in 4 ms. Remains 169 /169 variables (removed 0) and now considering 251/251 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 351 ms. Remains : 169/197 places, 251/478 transitions.
Stuttering acceptance computed with spot in 186 ms :[p2, p2, (NOT p1), (AND p2 p1)]
Running random walk in product with property : Anderson-PT-06-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={0} source=1 dest: 1}, { cond=(AND p2 p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}, { cond=(AND p2 p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s6 1) (EQ s24 1)), p0:(AND (EQ s3 1) (EQ s105 1)), p1:(AND (EQ s2 1) (EQ s112 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 415 ms.
Product exploration explored 100000 steps with 50000 reset in 399 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 p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) p1))), (X (X (NOT p2))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 18 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-06-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-06-LTLFireability-14 finished in 1402 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((G(p1)||G(p2))))))'
Support contains 6 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 478/478 transitions.
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 30 Pre rules applied. Total rules applied 0 place count 197 transition count 448
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 60 rules applied. Total rules applied 60 place count 167 transition count 448
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 86 place count 141 transition count 232
Iterating global reduction 0 with 26 rules applied. Total rules applied 112 place count 141 transition count 232
Applied a total of 112 rules in 22 ms. Remains 141 /197 variables (removed 56) and now considering 232/478 (removed 246) transitions.
// Phase 1: matrix 232 rows 141 cols
[2024-05-24 01:51:51] [INFO ] Computed 15 invariants in 2 ms
[2024-05-24 01:51:51] [INFO ] Implicit Places using invariants in 194 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 195 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 140/197 places, 232/478 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 140 transition count 210
Reduce places removed 22 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 28 rules applied. Total rules applied 50 place count 118 transition count 204
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 56 place count 112 transition count 204
Applied a total of 56 rules in 9 ms. Remains 112 /140 variables (removed 28) and now considering 204/232 (removed 28) transitions.
// Phase 1: matrix 204 rows 112 cols
[2024-05-24 01:51:51] [INFO ] Computed 14 invariants in 2 ms
[2024-05-24 01:51:51] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-24 01:51:51] [INFO ] Invariant cache hit.
[2024-05-24 01:51:51] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-24 01:51:52] [INFO ] Implicit Places using invariants and state equation in 422 ms returned []
Implicit Place search using SMT with State Equation took 576 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 112/197 places, 204/478 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 803 ms. Remains : 112/197 places, 204/478 transitions.
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Anderson-PT-06-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s8 0) (EQ s25 0)), p1:(AND (EQ s13 1) (EQ s23 1)), p2:(OR (AND (EQ s8 1) (EQ s25 1)) (AND (EQ s0 1) (EQ s65 1) (EQ s13 1) (EQ s23 1)))], nbAcceptance=2, 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 0 reset in 298 ms.
Stack based approach found an accepted trace after 31 steps with 0 reset with depth 32 and stack size 32 in 0 ms.
FORMULA Anderson-PT-06-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-06-LTLFireability-15 finished in 1256 ms.
All properties solved by simple procedures.
Total runtime 28851 ms.

BK_STOP 1716515513788

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Anderson-PT-06"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is Anderson-PT-06, 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 r021-smll-171620128200208"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-06.tgz
mv Anderson-PT-06 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 ;