Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.6M
-rw-r--r-- 1 mcc users 8.2K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 23 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 14K Mar 23 15:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Mar 23 15:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Mar 23 15:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 23 15:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 23 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 2.1M Mar 31 16:48 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-12-LTLFireability-00
FORMULA_NAME Anderson-PT-12-LTLFireability-01
FORMULA_NAME Anderson-PT-12-LTLFireability-02
FORMULA_NAME Anderson-PT-12-LTLFireability-03
FORMULA_NAME Anderson-PT-12-LTLFireability-04
FORMULA_NAME Anderson-PT-12-LTLFireability-05
FORMULA_NAME Anderson-PT-12-LTLFireability-06
FORMULA_NAME Anderson-PT-12-LTLFireability-07
FORMULA_NAME Anderson-PT-12-LTLFireability-08
FORMULA_NAME Anderson-PT-12-LTLFireability-09
FORMULA_NAME Anderson-PT-12-LTLFireability-10
FORMULA_NAME Anderson-PT-12-LTLFireability-11
FORMULA_NAME Anderson-PT-12-LTLFireability-12
FORMULA_NAME Anderson-PT-12-LTLFireability-13
FORMULA_NAME Anderson-PT-12-LTLFireability-14
FORMULA_NAME Anderson-PT-12-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1680852106154

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-12
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2023-04-07 07:21:47] [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]
[2023-04-07 07:21:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 07:21:47] [INFO ] Load time of PNML (sax parser for PT used): 153 ms
[2023-04-07 07:21:47] [INFO ] Transformed 889 places.
[2023-04-07 07:21:47] [INFO ] Transformed 4152 transitions.
[2023-04-07 07:21:47] [INFO ] Found NUPN structural information;
[2023-04-07 07:21:47] [INFO ] Parsed PT model containing 889 places and 4152 transitions and 16080 arcs in 280 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Anderson-PT-12-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-12-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-12-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-12-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 889 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 889/889 places, 4152/4152 transitions.
Discarding 244 places :
Symmetric choice reduction at 0 with 244 rule applications. Total rules 244 place count 645 transition count 1400
Iterating global reduction 0 with 244 rules applied. Total rules applied 488 place count 645 transition count 1400
Applied a total of 488 rules in 143 ms. Remains 645 /889 variables (removed 244) and now considering 1400/4152 (removed 2752) transitions.
// Phase 1: matrix 1400 rows 645 cols
[2023-04-07 07:21:48] [INFO ] Computed 27 invariants in 67 ms
[2023-04-07 07:21:49] [INFO ] Implicit Places using invariants in 830 ms returned []
[2023-04-07 07:21:49] [INFO ] Invariant cache hit.
[2023-04-07 07:21:49] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 07:21:51] [INFO ] Implicit Places using invariants and state equation in 2461 ms returned []
Implicit Place search using SMT with State Equation took 3324 ms to find 0 implicit places.
[2023-04-07 07:21:51] [INFO ] Invariant cache hit.
[2023-04-07 07:21:52] [INFO ] Dead Transitions using invariants and state equation in 970 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 645/889 places, 1400/4152 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4439 ms. Remains : 645/889 places, 1400/4152 transitions.
Support contains 41 out of 645 places after structural reductions.
[2023-04-07 07:21:52] [INFO ] Flatten gal took : 127 ms
[2023-04-07 07:21:52] [INFO ] Flatten gal took : 82 ms
[2023-04-07 07:21:53] [INFO ] Input system was already deterministic with 1400 transitions.
Support contains 39 out of 645 places (down from 41) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 511 ms. (steps per millisecond=19 ) properties (out of 25) seen :8
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
[2023-04-07 07:21:53] [INFO ] Invariant cache hit.
[2023-04-07 07:21:53] [INFO ] After 297ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-04-07 07:21:54] [INFO ] [Nat]Absence check using 14 positive place invariants in 20 ms returned sat
[2023-04-07 07:21:54] [INFO ] [Nat]Absence check using 14 positive and 13 generalized place invariants in 21 ms returned sat
[2023-04-07 07:21:56] [INFO ] After 2527ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :14
[2023-04-07 07:21:56] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 07:21:59] [INFO ] After 2100ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :2 sat :14
[2023-04-07 07:22:02] [INFO ] After 5045ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :14
Attempting to minimize the solution found.
Minimization took 1897 ms.
[2023-04-07 07:22:03] [INFO ] After 9949ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :14
Fused 16 Parikh solutions to 14 different solutions.
Parikh walk visited 1 properties in 57 ms.
Support contains 22 out of 645 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 645/645 places, 1400/1400 transitions.
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 132 Pre rules applied. Total rules applied 0 place count 645 transition count 1268
Deduced a syphon composed of 132 places in 1 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 0 with 264 rules applied. Total rules applied 264 place count 513 transition count 1268
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 273 place count 504 transition count 1105
Iterating global reduction 0 with 9 rules applied. Total rules applied 282 place count 504 transition count 1105
Applied a total of 282 rules in 108 ms. Remains 504 /645 variables (removed 141) and now considering 1105/1400 (removed 295) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 504/645 places, 1105/1400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1105 rows 504 cols
[2023-04-07 07:22:05] [INFO ] Computed 27 invariants in 29 ms
[2023-04-07 07:22:05] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2023-04-07 07:22:05] [INFO ] [Real]Absence check using 14 positive and 13 generalized place invariants in 16 ms returned sat
[2023-04-07 07:22:06] [INFO ] After 1168ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-04-07 07:22:06] [INFO ] [Nat]Absence check using 14 positive place invariants in 18 ms returned sat
[2023-04-07 07:22:06] [INFO ] [Nat]Absence check using 14 positive and 13 generalized place invariants in 25 ms returned sat
[2023-04-07 07:22:07] [INFO ] After 1142ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-04-07 07:22:07] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 07:22:08] [INFO ] After 1048ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-04-07 07:22:09] [INFO ] After 2077ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 688 ms.
[2023-04-07 07:22:10] [INFO ] After 4138ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 95 ms.
Support contains 13 out of 504 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 504/504 places, 1105/1105 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 500 transition count 1013
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 500 transition count 1013
Applied a total of 8 rules in 64 ms. Remains 500 /504 variables (removed 4) and now considering 1013/1105 (removed 92) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 500/504 places, 1013/1105 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1013 rows 500 cols
[2023-04-07 07:22:11] [INFO ] Computed 27 invariants in 7 ms
[2023-04-07 07:22:11] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-04-07 07:22:11] [INFO ] [Real]Absence check using 13 positive and 14 generalized place invariants in 24 ms returned sat
[2023-04-07 07:22:12] [INFO ] After 1028ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-07 07:22:12] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-04-07 07:22:12] [INFO ] [Nat]Absence check using 13 positive and 14 generalized place invariants in 32 ms returned sat
[2023-04-07 07:22:13] [INFO ] After 824ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-04-07 07:22:13] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 07:22:14] [INFO ] After 1146ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-04-07 07:22:15] [INFO ] After 1796ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 565 ms.
[2023-04-07 07:22:15] [INFO ] After 3398ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 24 ms.
Support contains 11 out of 500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 1013/1013 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 499 transition count 990
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 499 transition count 990
Applied a total of 2 rules in 35 ms. Remains 499 /500 variables (removed 1) and now considering 990/1013 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 499/500 places, 990/1013 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 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 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 210711 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :{}
Probabilistic random walk after 210711 steps, saw 169627 distinct states, run finished after 3002 ms. (steps per millisecond=70 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 990 rows 499 cols
[2023-04-07 07:22:19] [INFO ] Computed 27 invariants in 11 ms
[2023-04-07 07:22:19] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2023-04-07 07:22:19] [INFO ] [Real]Absence check using 14 positive and 13 generalized place invariants in 19 ms returned sat
[2023-04-07 07:22:20] [INFO ] After 1001ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-07 07:22:20] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2023-04-07 07:22:20] [INFO ] [Nat]Absence check using 14 positive and 13 generalized place invariants in 18 ms returned sat
[2023-04-07 07:22:21] [INFO ] After 1038ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-04-07 07:22:21] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 07:22:22] [INFO ] After 941ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-04-07 07:22:23] [INFO ] After 1610ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 457 ms.
[2023-04-07 07:22:23] [INFO ] After 3290ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 51 ms.
Support contains 11 out of 499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 499/499 places, 990/990 transitions.
Applied a total of 0 rules in 28 ms. Remains 499 /499 variables (removed 0) and now considering 990/990 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 499/499 places, 990/990 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 499/499 places, 990/990 transitions.
Applied a total of 0 rules in 23 ms. Remains 499 /499 variables (removed 0) and now considering 990/990 (removed 0) transitions.
[2023-04-07 07:22:23] [INFO ] Invariant cache hit.
[2023-04-07 07:22:24] [INFO ] Implicit Places using invariants in 558 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 560 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 498/499 places, 990/990 transitions.
Drop transitions removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 498 transition count 852
Reduce places removed 138 places and 0 transitions.
Iterating post reduction 1 with 138 rules applied. Total rules applied 276 place count 360 transition count 852
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 282 place count 360 transition count 846
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 288 place count 354 transition count 846
Applied a total of 288 rules in 38 ms. Remains 354 /498 variables (removed 144) and now considering 846/990 (removed 144) transitions.
// Phase 1: matrix 846 rows 354 cols
[2023-04-07 07:22:24] [INFO ] Computed 26 invariants in 5 ms
[2023-04-07 07:22:24] [INFO ] Implicit Places using invariants in 396 ms returned []
[2023-04-07 07:22:24] [INFO ] Invariant cache hit.
[2023-04-07 07:22:25] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 07:22:26] [INFO ] Implicit Places using invariants and state equation in 1279 ms returned []
Implicit Place search using SMT with State Equation took 1681 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 354/499 places, 846/990 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2302 ms. Remains : 354/499 places, 846/990 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) 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 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 :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 227783 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :{}
Probabilistic random walk after 227783 steps, saw 180281 distinct states, run finished after 3001 ms. (steps per millisecond=75 ) properties seen :0
Running SMT prover for 6 properties.
[2023-04-07 07:22:29] [INFO ] Invariant cache hit.
[2023-04-07 07:22:29] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2023-04-07 07:22:29] [INFO ] [Real]Absence check using 14 positive and 12 generalized place invariants in 11 ms returned sat
[2023-04-07 07:22:30] [INFO ] After 676ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-07 07:22:30] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-04-07 07:22:30] [INFO ] [Nat]Absence check using 14 positive and 12 generalized place invariants in 11 ms returned sat
[2023-04-07 07:22:31] [INFO ] After 557ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-04-07 07:22:31] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 07:22:31] [INFO ] After 449ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-04-07 07:22:32] [INFO ] After 926ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 342 ms.
[2023-04-07 07:22:32] [INFO ] After 1956ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 16 ms.
Support contains 11 out of 354 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 354/354 places, 846/846 transitions.
Applied a total of 0 rules in 20 ms. Remains 354 /354 variables (removed 0) and now considering 846/846 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 354/354 places, 846/846 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 354/354 places, 846/846 transitions.
Applied a total of 0 rules in 11 ms. Remains 354 /354 variables (removed 0) and now considering 846/846 (removed 0) transitions.
[2023-04-07 07:22:32] [INFO ] Invariant cache hit.
[2023-04-07 07:22:32] [INFO ] Implicit Places using invariants in 285 ms returned []
[2023-04-07 07:22:32] [INFO ] Invariant cache hit.
[2023-04-07 07:22:32] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 07:22:33] [INFO ] Implicit Places using invariants and state equation in 1234 ms returned []
Implicit Place search using SMT with State Equation took 1522 ms to find 0 implicit places.
[2023-04-07 07:22:33] [INFO ] Redundant transitions in 49 ms returned []
[2023-04-07 07:22:33] [INFO ] Invariant cache hit.
[2023-04-07 07:22:34] [INFO ] Dead Transitions using invariants and state equation in 475 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2076 ms. Remains : 354/354 places, 846/846 transitions.
Performed 144 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 144 Pre rules applied. Total rules applied 0 place count 354 transition count 702
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 0 with 288 rules applied. Total rules applied 288 place count 210 transition count 702
Applied a total of 288 rules in 14 ms. Remains 210 /354 variables (removed 144) and now considering 702/846 (removed 144) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 702 rows 210 cols
[2023-04-07 07:22:34] [INFO ] Computed 26 invariants in 9 ms
[2023-04-07 07:22:34] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-07 07:22:34] [INFO ] [Real]Absence check using 13 positive and 13 generalized place invariants in 6 ms returned sat
[2023-04-07 07:22:34] [INFO ] After 493ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-07 07:22:35] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-04-07 07:22:35] [INFO ] [Nat]Absence check using 13 positive and 13 generalized place invariants in 6 ms returned sat
[2023-04-07 07:22:35] [INFO ] After 388ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-04-07 07:22:35] [INFO ] After 673ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 242 ms.
[2023-04-07 07:22:35] [INFO ] After 1008ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA Anderson-PT-12-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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' '!(F((G(p0)||G(F(p1)))))'
Support contains 4 out of 645 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 645/645 places, 1400/1400 transitions.
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 132 Pre rules applied. Total rules applied 0 place count 645 transition count 1268
Deduced a syphon composed of 132 places in 0 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 0 with 264 rules applied. Total rules applied 264 place count 513 transition count 1268
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 282 place count 495 transition count 898
Iterating global reduction 0 with 18 rules applied. Total rules applied 300 place count 495 transition count 898
Applied a total of 300 rules in 60 ms. Remains 495 /645 variables (removed 150) and now considering 898/1400 (removed 502) transitions.
// Phase 1: matrix 898 rows 495 cols
[2023-04-07 07:22:36] [INFO ] Computed 27 invariants in 14 ms
[2023-04-07 07:22:36] [INFO ] Implicit Places using invariants in 568 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 570 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 494/645 places, 898/1400 transitions.
Drop transitions removed 142 transitions
Trivial Post-agglo rules discarded 142 transitions
Performed 142 trivial Post agglomeration. Transition count delta: 142
Iterating post reduction 0 with 142 rules applied. Total rules applied 142 place count 494 transition count 756
Reduce places removed 142 places and 0 transitions.
Iterating post reduction 1 with 142 rules applied. Total rules applied 284 place count 352 transition count 756
Applied a total of 284 rules in 18 ms. Remains 352 /494 variables (removed 142) and now considering 756/898 (removed 142) transitions.
// Phase 1: matrix 756 rows 352 cols
[2023-04-07 07:22:37] [INFO ] Computed 26 invariants in 9 ms
[2023-04-07 07:22:37] [INFO ] Implicit Places using invariants in 297 ms returned []
[2023-04-07 07:22:37] [INFO ] Invariant cache hit.
[2023-04-07 07:22:37] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 07:22:38] [INFO ] Implicit Places using invariants and state equation in 1240 ms returned []
Implicit Place search using SMT with State Equation took 1540 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 352/645 places, 756/1400 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2188 ms. Remains : 352/645 places, 756/1400 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 208 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-12-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s27 0) (EQ s41 0)), p1:(OR (NEQ s32 1) (NEQ s42 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 296 ms.
Product exploration explored 100000 steps with 0 reset in 262 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), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 98 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-04-07 07:22:39] [INFO ] Invariant cache hit.
[2023-04-07 07:22:39] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 07:22:39] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2023-04-07 07:22:39] [INFO ] [Nat]Absence check using 14 positive and 12 generalized place invariants in 15 ms returned sat
[2023-04-07 07:22:39] [INFO ] After 66ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 14 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-12-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-12-LTLFireability-00 finished in 3577 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(G(p1))))'
Support contains 3 out of 645 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 645/645 places, 1400/1400 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 627 transition count 1008
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 627 transition count 1008
Applied a total of 36 rules in 29 ms. Remains 627 /645 variables (removed 18) and now considering 1008/1400 (removed 392) transitions.
// Phase 1: matrix 1008 rows 627 cols
[2023-04-07 07:22:39] [INFO ] Computed 27 invariants in 15 ms
[2023-04-07 07:22:40] [INFO ] Implicit Places using invariants in 611 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 614 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 626/645 places, 1008/1400 transitions.
Applied a total of 0 rules in 23 ms. Remains 626 /626 variables (removed 0) and now considering 1008/1008 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 666 ms. Remains : 626/645 places, 1008/1400 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-12-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s137 1), p1:(AND (EQ s33 1) (EQ s39 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 7 reset in 201 ms.
Stack based approach found an accepted trace after 176 steps with 1 reset with depth 170 and stack size 170 in 1 ms.
FORMULA Anderson-PT-12-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-12-LTLFireability-01 finished in 1017 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(!p0))'
Support contains 2 out of 645 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 645/645 places, 1400/1400 transitions.
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 132 Pre rules applied. Total rules applied 0 place count 645 transition count 1268
Deduced a syphon composed of 132 places in 1 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 0 with 264 rules applied. Total rules applied 264 place count 513 transition count 1268
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 283 place count 494 transition count 875
Iterating global reduction 0 with 19 rules applied. Total rules applied 302 place count 494 transition count 875
Applied a total of 302 rules in 41 ms. Remains 494 /645 variables (removed 151) and now considering 875/1400 (removed 525) transitions.
// Phase 1: matrix 875 rows 494 cols
[2023-04-07 07:22:40] [INFO ] Computed 27 invariants in 12 ms
[2023-04-07 07:22:41] [INFO ] Implicit Places using invariants in 576 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 579 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 493/645 places, 875/1400 transitions.
Drop transitions removed 143 transitions
Trivial Post-agglo rules discarded 143 transitions
Performed 143 trivial Post agglomeration. Transition count delta: 143
Iterating post reduction 0 with 143 rules applied. Total rules applied 143 place count 493 transition count 732
Reduce places removed 143 places and 0 transitions.
Iterating post reduction 1 with 143 rules applied. Total rules applied 286 place count 350 transition count 732
Applied a total of 286 rules in 15 ms. Remains 350 /493 variables (removed 143) and now considering 732/875 (removed 143) transitions.
// Phase 1: matrix 732 rows 350 cols
[2023-04-07 07:22:41] [INFO ] Computed 26 invariants in 9 ms
[2023-04-07 07:22:41] [INFO ] Implicit Places using invariants in 321 ms returned []
[2023-04-07 07:22:41] [INFO ] Invariant cache hit.
[2023-04-07 07:22:41] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 07:22:43] [INFO ] Implicit Places using invariants and state equation in 1249 ms returned []
Implicit Place search using SMT with State Equation took 1571 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 350/645 places, 732/1400 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2207 ms. Remains : 350/645 places, 732/1400 transitions.
Stuttering acceptance computed with spot in 53 ms :[true, p0]
Running random walk in product with property : Anderson-PT-12-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s19 1) (EQ s43 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-12-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-12-LTLFireability-02 finished in 2286 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(p0) U p1)))&&(F(p0) U G(p2))))'
Support contains 5 out of 645 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 645/645 places, 1400/1400 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 627 transition count 1008
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 627 transition count 1008
Applied a total of 36 rules in 22 ms. Remains 627 /645 variables (removed 18) and now considering 1008/1400 (removed 392) transitions.
// Phase 1: matrix 1008 rows 627 cols
[2023-04-07 07:22:43] [INFO ] Computed 27 invariants in 14 ms
[2023-04-07 07:22:43] [INFO ] Implicit Places using invariants in 607 ms returned []
[2023-04-07 07:22:43] [INFO ] Invariant cache hit.
[2023-04-07 07:22:44] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 07:22:45] [INFO ] Implicit Places using invariants and state equation in 1919 ms returned []
Implicit Place search using SMT with State Equation took 2532 ms to find 0 implicit places.
[2023-04-07 07:22:45] [INFO ] Invariant cache hit.
[2023-04-07 07:22:46] [INFO ] Dead Transitions using invariants and state equation in 834 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 627/645 places, 1008/1400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3389 ms. Remains : 627/645 places, 1008/1400 transitions.
Stuttering acceptance computed with spot in 310 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p2), true]
Running random walk in product with property : Anderson-PT-12-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s0 1) (EQ s502 1)), p0:(AND (EQ s29 1) (EQ s48 1)), p1:(EQ s156 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-12-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-12-LTLFireability-05 finished in 3732 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 645 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 645/645 places, 1400/1400 transitions.
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 132 Pre rules applied. Total rules applied 0 place count 645 transition count 1268
Deduced a syphon composed of 132 places in 1 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 0 with 264 rules applied. Total rules applied 264 place count 513 transition count 1268
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 283 place count 494 transition count 875
Iterating global reduction 0 with 19 rules applied. Total rules applied 302 place count 494 transition count 875
Applied a total of 302 rules in 52 ms. Remains 494 /645 variables (removed 151) and now considering 875/1400 (removed 525) transitions.
// Phase 1: matrix 875 rows 494 cols
[2023-04-07 07:22:46] [INFO ] Computed 27 invariants in 13 ms
[2023-04-07 07:22:47] [INFO ] Implicit Places using invariants in 569 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 571 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 493/645 places, 875/1400 transitions.
Drop transitions removed 143 transitions
Trivial Post-agglo rules discarded 143 transitions
Performed 143 trivial Post agglomeration. Transition count delta: 143
Iterating post reduction 0 with 143 rules applied. Total rules applied 143 place count 493 transition count 732
Reduce places removed 143 places and 0 transitions.
Iterating post reduction 1 with 143 rules applied. Total rules applied 286 place count 350 transition count 732
Applied a total of 286 rules in 15 ms. Remains 350 /493 variables (removed 143) and now considering 732/875 (removed 143) transitions.
// Phase 1: matrix 732 rows 350 cols
[2023-04-07 07:22:47] [INFO ] Computed 26 invariants in 11 ms
[2023-04-07 07:22:47] [INFO ] Implicit Places using invariants in 333 ms returned []
[2023-04-07 07:22:47] [INFO ] Invariant cache hit.
[2023-04-07 07:22:48] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 07:22:48] [INFO ] Implicit Places using invariants and state equation in 1098 ms returned []
Implicit Place search using SMT with State Equation took 1433 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 350/645 places, 732/1400 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2073 ms. Remains : 350/645 places, 732/1400 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-12-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s16 1) (EQ s46 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1 reset in 169 ms.
Stack based approach found an accepted trace after 53 steps with 0 reset with depth 54 and stack size 54 in 0 ms.
FORMULA Anderson-PT-12-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-12-LTLFireability-06 finished in 2305 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((X(X(X(G(p1)))) U (!p2&&X(X(X(G(p1)))))))||p0)))'
Support contains 4 out of 645 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 645/645 places, 1400/1400 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 627 transition count 1030
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 627 transition count 1030
Applied a total of 36 rules in 27 ms. Remains 627 /645 variables (removed 18) and now considering 1030/1400 (removed 370) transitions.
// Phase 1: matrix 1030 rows 627 cols
[2023-04-07 07:22:49] [INFO ] Computed 27 invariants in 14 ms
[2023-04-07 07:22:49] [INFO ] Implicit Places using invariants in 610 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 612 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 626/645 places, 1030/1400 transitions.
Applied a total of 0 rules in 10 ms. Remains 626 /626 variables (removed 0) and now considering 1030/1030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 649 ms. Remains : 626/645 places, 1030/1400 transitions.
Stuttering acceptance computed with spot in 238 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (NOT p1) p2), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : Anderson-PT-12-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=p2, acceptance={0} source=2 dest: 2}, { cond=true, acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=p1, acceptance={} source=5 dest: 5}, { cond=(NOT p1), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(OR (NEQ s21 1) (NEQ s44 1)), p2:(AND (EQ s21 1) (EQ s44 1)), p1:(AND (EQ s30 1) (EQ s43 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 472 ms.
Product exploration explored 100000 steps with 50000 reset in 472 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X p0), (X (X (NOT p2))), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 17 ms. Reduced automaton from 7 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-12-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-12-LTLFireability-07 finished in 1887 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)))'
Support contains 2 out of 645 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 645/645 places, 1400/1400 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 626 transition count 1007
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 626 transition count 1007
Applied a total of 38 rules in 26 ms. Remains 626 /645 variables (removed 19) and now considering 1007/1400 (removed 393) transitions.
// Phase 1: matrix 1007 rows 626 cols
[2023-04-07 07:22:51] [INFO ] Computed 27 invariants in 14 ms
[2023-04-07 07:22:51] [INFO ] Implicit Places using invariants in 554 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 556 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 625/645 places, 1007/1400 transitions.
Applied a total of 0 rules in 10 ms. Remains 625 /625 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 593 ms. Remains : 625/645 places, 1007/1400 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-12-LTLFireability-08 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 s20 1) (EQ s48 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-12-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-12-LTLFireability-08 finished in 696 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||(p1 U p2))))'
Support contains 6 out of 645 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 645/645 places, 1400/1400 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 628 transition count 1053
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 628 transition count 1053
Applied a total of 34 rules in 26 ms. Remains 628 /645 variables (removed 17) and now considering 1053/1400 (removed 347) transitions.
// Phase 1: matrix 1053 rows 628 cols
[2023-04-07 07:22:51] [INFO ] Computed 27 invariants in 14 ms
[2023-04-07 07:22:52] [INFO ] Implicit Places using invariants in 587 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 589 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 627/645 places, 1053/1400 transitions.
Applied a total of 0 rules in 14 ms. Remains 627 /627 variables (removed 0) and now considering 1053/1053 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 631 ms. Remains : 627/645 places, 1053/1400 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true]
Running random walk in product with property : Anderson-PT-12-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p2:(AND (EQ s14 1) (EQ s42 1)), p1:(OR (NOT (AND (EQ s14 1) (EQ s42 1))) (AND (EQ s24 1) (EQ s37 1))), p0:(AND (EQ s13 1) (EQ s39 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 10 reset in 177 ms.
Stack based approach found an accepted trace after 86 steps with 0 reset with depth 87 and stack size 87 in 0 ms.
FORMULA Anderson-PT-12-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-12-LTLFireability-10 finished in 969 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(F(p1)))))'
Support contains 4 out of 645 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 645/645 places, 1400/1400 transitions.
Performed 131 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 131 Pre rules applied. Total rules applied 0 place count 645 transition count 1269
Deduced a syphon composed of 131 places in 1 ms
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 0 with 262 rules applied. Total rules applied 262 place count 514 transition count 1269
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 282 place count 494 transition count 853
Iterating global reduction 0 with 20 rules applied. Total rules applied 302 place count 494 transition count 853
Applied a total of 302 rules in 38 ms. Remains 494 /645 variables (removed 151) and now considering 853/1400 (removed 547) transitions.
// Phase 1: matrix 853 rows 494 cols
[2023-04-07 07:22:52] [INFO ] Computed 27 invariants in 12 ms
[2023-04-07 07:22:53] [INFO ] Implicit Places using invariants in 544 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 545 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 493/645 places, 853/1400 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 493 transition count 733
Reduce places removed 120 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 132 rules applied. Total rules applied 252 place count 373 transition count 721
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 264 place count 361 transition count 721
Applied a total of 264 rules in 14 ms. Remains 361 /493 variables (removed 132) and now considering 721/853 (removed 132) transitions.
// Phase 1: matrix 721 rows 361 cols
[2023-04-07 07:22:53] [INFO ] Computed 26 invariants in 5 ms
[2023-04-07 07:22:53] [INFO ] Implicit Places using invariants in 323 ms returned []
[2023-04-07 07:22:53] [INFO ] Invariant cache hit.
[2023-04-07 07:22:53] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 07:22:54] [INFO ] Implicit Places using invariants and state equation in 1087 ms returned []
Implicit Place search using SMT with State Equation took 1412 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 361/645 places, 721/1400 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2011 ms. Remains : 361/645 places, 721/1400 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-12-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s2 1) (EQ s201 1)), p1:(AND (EQ s34 1) (EQ s155 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 26 reset in 158 ms.
Stack based approach found an accepted trace after 50 steps with 0 reset with depth 51 and stack size 51 in 1 ms.
FORMULA Anderson-PT-12-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-12-LTLFireability-11 finished in 2265 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(!(G(F(X(p0))) U !p0))))'
Support contains 2 out of 645 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 645/645 places, 1400/1400 transitions.
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 132 Pre rules applied. Total rules applied 0 place count 645 transition count 1268
Deduced a syphon composed of 132 places in 1 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 0 with 264 rules applied. Total rules applied 264 place count 513 transition count 1268
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 283 place count 494 transition count 875
Iterating global reduction 0 with 19 rules applied. Total rules applied 302 place count 494 transition count 875
Applied a total of 302 rules in 37 ms. Remains 494 /645 variables (removed 151) and now considering 875/1400 (removed 525) transitions.
// Phase 1: matrix 875 rows 494 cols
[2023-04-07 07:22:54] [INFO ] Computed 27 invariants in 11 ms
[2023-04-07 07:22:55] [INFO ] Implicit Places using invariants in 565 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 568 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 493/645 places, 875/1400 transitions.
Drop transitions removed 143 transitions
Trivial Post-agglo rules discarded 143 transitions
Performed 143 trivial Post agglomeration. Transition count delta: 143
Iterating post reduction 0 with 143 rules applied. Total rules applied 143 place count 493 transition count 732
Reduce places removed 143 places and 0 transitions.
Iterating post reduction 1 with 143 rules applied. Total rules applied 286 place count 350 transition count 732
Applied a total of 286 rules in 11 ms. Remains 350 /493 variables (removed 143) and now considering 732/875 (removed 143) transitions.
// Phase 1: matrix 732 rows 350 cols
[2023-04-07 07:22:55] [INFO ] Computed 26 invariants in 4 ms
[2023-04-07 07:22:55] [INFO ] Implicit Places using invariants in 294 ms returned []
[2023-04-07 07:22:55] [INFO ] Invariant cache hit.
[2023-04-07 07:22:56] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 07:22:56] [INFO ] Implicit Places using invariants and state equation in 1081 ms returned []
Implicit Place search using SMT with State Equation took 1377 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 350/645 places, 732/1400 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1993 ms. Remains : 350/645 places, 732/1400 transitions.
Stuttering acceptance computed with spot in 426 ms :[(NOT p0), (NOT p0), false]
Running random walk in product with property : Anderson-PT-12-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s33 1) (EQ s45 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 154 ms.
Stack based approach found an accepted trace after 75 steps with 0 reset with depth 76 and stack size 76 in 0 ms.
FORMULA Anderson-PT-12-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-12-LTLFireability-14 finished in 2598 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)))'
Support contains 2 out of 645 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 645/645 places, 1400/1400 transitions.
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 132 Pre rules applied. Total rules applied 0 place count 645 transition count 1268
Deduced a syphon composed of 132 places in 0 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 0 with 264 rules applied. Total rules applied 264 place count 513 transition count 1268
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 283 place count 494 transition count 875
Iterating global reduction 0 with 19 rules applied. Total rules applied 302 place count 494 transition count 875
Applied a total of 302 rules in 30 ms. Remains 494 /645 variables (removed 151) and now considering 875/1400 (removed 525) transitions.
// Phase 1: matrix 875 rows 494 cols
[2023-04-07 07:22:57] [INFO ] Computed 27 invariants in 12 ms
[2023-04-07 07:22:58] [INFO ] Implicit Places using invariants in 558 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 573 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 493/645 places, 875/1400 transitions.
Drop transitions removed 143 transitions
Trivial Post-agglo rules discarded 143 transitions
Performed 143 trivial Post agglomeration. Transition count delta: 143
Iterating post reduction 0 with 143 rules applied. Total rules applied 143 place count 493 transition count 732
Reduce places removed 143 places and 0 transitions.
Iterating post reduction 1 with 143 rules applied. Total rules applied 286 place count 350 transition count 732
Applied a total of 286 rules in 12 ms. Remains 350 /493 variables (removed 143) and now considering 732/875 (removed 143) transitions.
// Phase 1: matrix 732 rows 350 cols
[2023-04-07 07:22:58] [INFO ] Computed 26 invariants in 4 ms
[2023-04-07 07:22:58] [INFO ] Implicit Places using invariants in 296 ms returned []
[2023-04-07 07:22:58] [INFO ] Invariant cache hit.
[2023-04-07 07:22:58] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 07:22:59] [INFO ] Implicit Places using invariants and state equation in 904 ms returned []
Implicit Place search using SMT with State Equation took 1216 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 350/645 places, 732/1400 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1833 ms. Remains : 350/645 places, 732/1400 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-12-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s34 1) (EQ s47 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 175 ms.
Stack based approach found an accepted trace after 318 steps with 0 reset with depth 319 and stack size 319 in 1 ms.
FORMULA Anderson-PT-12-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-12-LTLFireability-15 finished in 2112 ms.
All properties solved by simple procedures.
Total runtime 72031 ms.

BK_STOP 1680852181767

--------------------
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-12"
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-5348"
echo " Executing tool itstools"
echo " Input is Anderson-PT-12, 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 r517-tall-167987243300068"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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