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.r521-tall-167987246100052.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 ltsminxred
Input is Anderson-PT-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r521-tall-167987246100052
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Mar 23 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 13K Mar 23 15:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Mar 23 15:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Mar 23 15:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 23 15:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 1.3M 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-10-LTLFireability-00
FORMULA_NAME Anderson-PT-10-LTLFireability-01
FORMULA_NAME Anderson-PT-10-LTLFireability-02
FORMULA_NAME Anderson-PT-10-LTLFireability-03
FORMULA_NAME Anderson-PT-10-LTLFireability-04
FORMULA_NAME Anderson-PT-10-LTLFireability-05
FORMULA_NAME Anderson-PT-10-LTLFireability-06
FORMULA_NAME Anderson-PT-10-LTLFireability-07
FORMULA_NAME Anderson-PT-10-LTLFireability-08
FORMULA_NAME Anderson-PT-10-LTLFireability-09
FORMULA_NAME Anderson-PT-10-LTLFireability-10
FORMULA_NAME Anderson-PT-10-LTLFireability-11
FORMULA_NAME Anderson-PT-10-LTLFireability-12
FORMULA_NAME Anderson-PT-10-LTLFireability-13
FORMULA_NAME Anderson-PT-10-LTLFireability-14
FORMULA_NAME Anderson-PT-10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1680864201134

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-10
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 10:43:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 10:43:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 10:43:24] [INFO ] Load time of PNML (sax parser for PT used): 227 ms
[2023-04-07 10:43:24] [INFO ] Transformed 621 places.
[2023-04-07 10:43:24] [INFO ] Transformed 2480 transitions.
[2023-04-07 10:43:24] [INFO ] Found NUPN structural information;
[2023-04-07 10:43:25] [INFO ] Parsed PT model containing 621 places and 2480 transitions and 9560 arcs in 437 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA Anderson-PT-10-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-10-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-10-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-10-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-10-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-10-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 621 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 621/621 places, 2480/2480 transitions.
Discarding 163 places :
Symmetric choice reduction at 0 with 163 rule applications. Total rules 163 place count 458 transition count 1003
Iterating global reduction 0 with 163 rules applied. Total rules applied 326 place count 458 transition count 1003
Applied a total of 326 rules in 205 ms. Remains 458 /621 variables (removed 163) and now considering 1003/2480 (removed 1477) transitions.
// Phase 1: matrix 1003 rows 458 cols
[2023-04-07 10:43:25] [INFO ] Computed 23 invariants in 49 ms
[2023-04-07 10:43:26] [INFO ] Implicit Places using invariants in 911 ms returned []
[2023-04-07 10:43:26] [INFO ] Invariant cache hit.
[2023-04-07 10:43:27] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 10:43:33] [INFO ] Implicit Places using invariants and state equation in 6842 ms returned []
Implicit Place search using SMT with State Equation took 7834 ms to find 0 implicit places.
[2023-04-07 10:43:33] [INFO ] Invariant cache hit.
[2023-04-07 10:43:34] [INFO ] Dead Transitions using invariants and state equation in 877 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 458/621 places, 1003/2480 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8930 ms. Remains : 458/621 places, 1003/2480 transitions.
Support contains 37 out of 458 places after structural reductions.
[2023-04-07 10:43:34] [INFO ] Flatten gal took : 108 ms
[2023-04-07 10:43:34] [INFO ] Flatten gal took : 84 ms
[2023-04-07 10:43:34] [INFO ] Input system was already deterministic with 1003 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 567 ms. (steps per millisecond=17 ) properties (out of 20) seen :3
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 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 13) 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 13) 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 13) 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 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 12) 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 12) seen :1
Running SMT prover for 11 properties.
[2023-04-07 10:43:35] [INFO ] Invariant cache hit.
[2023-04-07 10:43:36] [INFO ] [Real]Absence check using 12 positive place invariants in 61 ms returned sat
[2023-04-07 10:43:36] [INFO ] [Real]Absence check using 12 positive and 11 generalized place invariants in 19 ms returned sat
[2023-04-07 10:43:38] [INFO ] After 2779ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-04-07 10:43:39] [INFO ] [Nat]Absence check using 12 positive place invariants in 44 ms returned sat
[2023-04-07 10:43:39] [INFO ] [Nat]Absence check using 12 positive and 11 generalized place invariants in 37 ms returned sat
[2023-04-07 10:43:41] [INFO ] After 2074ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-04-07 10:43:41] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 10:43:43] [INFO ] After 1715ms SMT Verify possible using 90 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-04-07 10:43:44] [INFO ] After 3490ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 1390 ms.
[2023-04-07 10:43:46] [INFO ] After 7677ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 177 ms.
Support contains 19 out of 458 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 458/458 places, 1003/1003 transitions.
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 90 Pre rules applied. Total rules applied 0 place count 458 transition count 913
Deduced a syphon composed of 90 places in 0 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 0 with 180 rules applied. Total rules applied 180 place count 368 transition count 913
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 186 place count 362 transition count 799
Iterating global reduction 0 with 6 rules applied. Total rules applied 192 place count 362 transition count 799
Applied a total of 192 rules in 232 ms. Remains 362 /458 variables (removed 96) and now considering 799/1003 (removed 204) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 232 ms. Remains : 362/458 places, 799/1003 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :2
Running SMT prover for 6 properties.
// Phase 1: matrix 799 rows 362 cols
[2023-04-07 10:43:47] [INFO ] Computed 23 invariants in 9 ms
[2023-04-07 10:43:48] [INFO ] [Real]Absence check using 12 positive place invariants in 86 ms returned sat
[2023-04-07 10:43:48] [INFO ] [Real]Absence check using 12 positive and 11 generalized place invariants in 87 ms returned sat
[2023-04-07 10:43:49] [INFO ] After 2636ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-07 10:43:50] [INFO ] [Nat]Absence check using 12 positive place invariants in 27 ms returned sat
[2023-04-07 10:43:50] [INFO ] [Nat]Absence check using 12 positive and 11 generalized place invariants in 36 ms returned sat
[2023-04-07 10:43:51] [INFO ] After 931ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-04-07 10:43:51] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 10:43:51] [INFO ] After 554ms SMT Verify possible using 90 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-04-07 10:43:52] [INFO ] After 1171ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 455 ms.
[2023-04-07 10:43:52] [INFO ] After 2880ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 29 ms.
Support contains 12 out of 362 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 362/362 places, 799/799 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 358 transition count 723
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 358 transition count 723
Applied a total of 8 rules in 131 ms. Remains 358 /362 variables (removed 4) and now considering 723/799 (removed 76) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 358/362 places, 723/799 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) 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 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 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 346482 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :{0=1}
Probabilistic random walk after 346482 steps, saw 252582 distinct states, run finished after 3013 ms. (steps per millisecond=114 ) properties seen :1
Running SMT prover for 5 properties.
// Phase 1: matrix 723 rows 358 cols
[2023-04-07 10:43:56] [INFO ] Computed 23 invariants in 8 ms
[2023-04-07 10:43:57] [INFO ] [Real]Absence check using 12 positive place invariants in 78 ms returned sat
[2023-04-07 10:43:57] [INFO ] [Real]Absence check using 12 positive and 11 generalized place invariants in 23 ms returned sat
[2023-04-07 10:43:57] [INFO ] After 1080ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-04-07 10:43:57] [INFO ] [Nat]Absence check using 12 positive place invariants in 14 ms returned sat
[2023-04-07 10:43:57] [INFO ] [Nat]Absence check using 12 positive and 11 generalized place invariants in 18 ms returned sat
[2023-04-07 10:43:58] [INFO ] After 645ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-04-07 10:43:58] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 10:43:58] [INFO ] After 452ms SMT Verify possible using 90 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-04-07 10:43:59] [INFO ] After 978ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 306 ms.
[2023-04-07 10:43:59] [INFO ] After 2155ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 14 ms.
Support contains 10 out of 358 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 358/358 places, 723/723 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 357 transition count 704
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 357 transition count 704
Applied a total of 2 rules in 51 ms. Remains 357 /358 variables (removed 1) and now considering 704/723 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 357/358 places, 704/723 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 349189 steps, run timeout after 3010 ms. (steps per millisecond=116 ) properties seen :{}
Probabilistic random walk after 349189 steps, saw 258753 distinct states, run finished after 3011 ms. (steps per millisecond=115 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 704 rows 357 cols
[2023-04-07 10:44:03] [INFO ] Computed 23 invariants in 22 ms
[2023-04-07 10:44:03] [INFO ] [Real]Absence check using 12 positive place invariants in 13 ms returned sat
[2023-04-07 10:44:03] [INFO ] [Real]Absence check using 12 positive and 11 generalized place invariants in 18 ms returned sat
[2023-04-07 10:44:03] [INFO ] After 191ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-04-07 10:44:03] [INFO ] [Nat]Absence check using 12 positive place invariants in 9 ms returned sat
[2023-04-07 10:44:03] [INFO ] [Nat]Absence check using 12 positive and 11 generalized place invariants in 9 ms returned sat
[2023-04-07 10:44:03] [INFO ] After 441ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-04-07 10:44:04] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 10:44:04] [INFO ] After 382ms SMT Verify possible using 90 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-04-07 10:44:04] [INFO ] After 747ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 283 ms.
[2023-04-07 10:44:05] [INFO ] After 1636ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 33 ms.
Support contains 10 out of 357 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 704/704 transitions.
Applied a total of 0 rules in 39 ms. Remains 357 /357 variables (removed 0) and now considering 704/704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 357/357 places, 704/704 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 704/704 transitions.
Applied a total of 0 rules in 32 ms. Remains 357 /357 variables (removed 0) and now considering 704/704 (removed 0) transitions.
[2023-04-07 10:44:05] [INFO ] Invariant cache hit.
[2023-04-07 10:44:05] [INFO ] Implicit Places using invariants in 611 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 617 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 356/357 places, 704/704 transitions.
Drop transitions removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 356 transition count 610
Reduce places removed 94 places and 0 transitions.
Iterating post reduction 1 with 94 rules applied. Total rules applied 188 place count 262 transition count 610
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 194 place count 262 transition count 604
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 200 place count 256 transition count 604
Applied a total of 200 rules in 27 ms. Remains 256 /356 variables (removed 100) and now considering 604/704 (removed 100) transitions.
// Phase 1: matrix 604 rows 256 cols
[2023-04-07 10:44:05] [INFO ] Computed 22 invariants in 3 ms
[2023-04-07 10:44:06] [INFO ] Implicit Places using invariants in 375 ms returned []
[2023-04-07 10:44:06] [INFO ] Invariant cache hit.
[2023-04-07 10:44:06] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 10:44:07] [INFO ] Implicit Places using invariants and state equation in 1157 ms returned []
Implicit Place search using SMT with State Equation took 1544 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 256/357 places, 604/704 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2221 ms. Remains : 256/357 places, 604/704 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 390658 steps, run timeout after 3001 ms. (steps per millisecond=130 ) properties seen :{1=1, 4=1}
Probabilistic random walk after 390658 steps, saw 282698 distinct states, run finished after 3001 ms. (steps per millisecond=130 ) properties seen :2
Running SMT prover for 3 properties.
[2023-04-07 10:44:10] [INFO ] Invariant cache hit.
[2023-04-07 10:44:10] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-04-07 10:44:10] [INFO ] [Real]Absence check using 12 positive and 10 generalized place invariants in 22 ms returned sat
[2023-04-07 10:44:11] [INFO ] After 538ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 10:44:11] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-04-07 10:44:11] [INFO ] [Nat]Absence check using 12 positive and 10 generalized place invariants in 10 ms returned sat
[2023-04-07 10:44:11] [INFO ] After 248ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 10:44:11] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 10:44:11] [INFO ] After 193ms SMT Verify possible using 90 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 10:44:11] [INFO ] After 330ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 117 ms.
[2023-04-07 10:44:12] [INFO ] After 837ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 7 ms.
Support contains 7 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 604/604 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 254 transition count 566
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 254 transition count 566
Applied a total of 4 rules in 28 ms. Remains 254 /256 variables (removed 2) and now considering 566/604 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 254/256 places, 566/604 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 313688 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :{}
Probabilistic random walk after 313688 steps, saw 234725 distinct states, run finished after 3001 ms. (steps per millisecond=104 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 566 rows 254 cols
[2023-04-07 10:44:15] [INFO ] Computed 22 invariants in 14 ms
[2023-04-07 10:44:15] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-04-07 10:44:15] [INFO ] [Real]Absence check using 12 positive and 10 generalized place invariants in 8 ms returned sat
[2023-04-07 10:44:15] [INFO ] After 558ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 10:44:16] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-04-07 10:44:16] [INFO ] [Nat]Absence check using 12 positive and 10 generalized place invariants in 7 ms returned sat
[2023-04-07 10:44:16] [INFO ] After 285ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 10:44:16] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 10:44:16] [INFO ] After 220ms SMT Verify possible using 90 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 10:44:16] [INFO ] After 492ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 139 ms.
[2023-04-07 10:44:17] [INFO ] After 1087ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 7 ms.
Support contains 7 out of 254 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 254/254 places, 566/566 transitions.
Applied a total of 0 rules in 12 ms. Remains 254 /254 variables (removed 0) and now considering 566/566 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 254/254 places, 566/566 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 254/254 places, 566/566 transitions.
Applied a total of 0 rules in 19 ms. Remains 254 /254 variables (removed 0) and now considering 566/566 (removed 0) transitions.
[2023-04-07 10:44:17] [INFO ] Invariant cache hit.
[2023-04-07 10:44:17] [INFO ] Implicit Places using invariants in 405 ms returned []
[2023-04-07 10:44:17] [INFO ] Invariant cache hit.
[2023-04-07 10:44:17] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 10:44:18] [INFO ] Implicit Places using invariants and state equation in 1305 ms returned []
Implicit Place search using SMT with State Equation took 1729 ms to find 0 implicit places.
[2023-04-07 10:44:18] [INFO ] Redundant transitions in 37 ms returned []
[2023-04-07 10:44:18] [INFO ] Invariant cache hit.
[2023-04-07 10:44:19] [INFO ] Dead Transitions using invariants and state equation in 765 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2590 ms. Remains : 254/254 places, 566/566 transitions.
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 100 Pre rules applied. Total rules applied 0 place count 254 transition count 466
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 154 transition count 466
Applied a total of 200 rules in 40 ms. Remains 154 /254 variables (removed 100) and now considering 466/566 (removed 100) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 466 rows 154 cols
[2023-04-07 10:44:19] [INFO ] Computed 22 invariants in 2 ms
[2023-04-07 10:44:19] [INFO ] [Real]Absence check using 12 positive place invariants in 56 ms returned sat
[2023-04-07 10:44:20] [INFO ] [Real]Absence check using 12 positive and 10 generalized place invariants in 10 ms returned sat
[2023-04-07 10:44:20] [INFO ] After 605ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 10:44:20] [INFO ] [Nat]Absence check using 12 positive place invariants in 14 ms returned sat
[2023-04-07 10:44:20] [INFO ] [Nat]Absence check using 12 positive and 10 generalized place invariants in 8 ms returned sat
[2023-04-07 10:44:20] [INFO ] After 244ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 10:44:20] [INFO ] After 373ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 129 ms.
[2023-04-07 10:44:21] [INFO ] After 685ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
FORMULA Anderson-PT-10-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!(G((F(G(p0)) U p1)))'
Support contains 4 out of 458 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 458/458 places, 1003/1003 transitions.
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 90 Pre rules applied. Total rules applied 0 place count 458 transition count 913
Deduced a syphon composed of 90 places in 0 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 0 with 180 rules applied. Total rules applied 180 place count 368 transition count 913
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 195 place count 353 transition count 628
Iterating global reduction 0 with 15 rules applied. Total rules applied 210 place count 353 transition count 628
Applied a total of 210 rules in 69 ms. Remains 353 /458 variables (removed 105) and now considering 628/1003 (removed 375) transitions.
// Phase 1: matrix 628 rows 353 cols
[2023-04-07 10:44:21] [INFO ] Computed 23 invariants in 7 ms
[2023-04-07 10:44:22] [INFO ] Implicit Places using invariants in 802 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 810 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 352/458 places, 628/1003 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 98 place count 352 transition count 530
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 196 place count 254 transition count 530
Applied a total of 196 rules in 15 ms. Remains 254 /352 variables (removed 98) and now considering 530/628 (removed 98) transitions.
// Phase 1: matrix 530 rows 254 cols
[2023-04-07 10:44:22] [INFO ] Computed 22 invariants in 9 ms
[2023-04-07 10:44:23] [INFO ] Implicit Places using invariants in 385 ms returned []
[2023-04-07 10:44:23] [INFO ] Invariant cache hit.
[2023-04-07 10:44:23] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 10:44:24] [INFO ] Implicit Places using invariants and state equation in 1227 ms returned []
Implicit Place search using SMT with State Equation took 1650 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 254/458 places, 530/1003 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2545 ms. Remains : 254/458 places, 530/1003 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 435 ms :[(NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : Anderson-PT-10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s10 1) (EQ s32 1)), p0:(AND (EQ s22 1) (EQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 442 ms.
Stack based approach found an accepted trace after 187 steps with 0 reset with depth 188 and stack size 188 in 10 ms.
FORMULA Anderson-PT-10-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-10-LTLFireability-02 finished in 3658 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)))))'
Support contains 6 out of 458 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 458/458 places, 1003/1003 transitions.
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 90 Pre rules applied. Total rules applied 0 place count 458 transition count 913
Deduced a syphon composed of 90 places in 0 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 0 with 180 rules applied. Total rules applied 180 place count 368 transition count 913
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 194 place count 354 transition count 647
Iterating global reduction 0 with 14 rules applied. Total rules applied 208 place count 354 transition count 647
Applied a total of 208 rules in 39 ms. Remains 354 /458 variables (removed 104) and now considering 647/1003 (removed 356) transitions.
// Phase 1: matrix 647 rows 354 cols
[2023-04-07 10:44:25] [INFO ] Computed 23 invariants in 6 ms
[2023-04-07 10:44:39] [INFO ] Implicit Places using invariants in 14438 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 14468 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 353/458 places, 647/1003 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 97 place count 353 transition count 550
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 194 place count 256 transition count 550
Applied a total of 194 rules in 24 ms. Remains 256 /353 variables (removed 97) and now considering 550/647 (removed 97) transitions.
// Phase 1: matrix 550 rows 256 cols
[2023-04-07 10:44:39] [INFO ] Computed 22 invariants in 10 ms
[2023-04-07 10:44:40] [INFO ] Implicit Places using invariants in 592 ms returned []
[2023-04-07 10:44:40] [INFO ] Invariant cache hit.
[2023-04-07 10:44:42] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 10:44:48] [INFO ] Implicit Places using invariants and state equation in 8436 ms returned []
Implicit Place search using SMT with State Equation took 9034 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 256/458 places, 550/1003 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 23565 ms. Remains : 256/458 places, 550/1003 transitions.
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Anderson-PT-10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s25 1) (EQ s38 1)), p1:(OR (NEQ s15 1) (NEQ s37 1) (AND (EQ s24 1) (EQ s35 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 374 ms.
Stack based approach found an accepted trace after 55 steps with 0 reset with depth 56 and stack size 56 in 2 ms.
FORMULA Anderson-PT-10-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-10-LTLFireability-04 finished in 24202 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))&&F(p1)))'
Support contains 4 out of 458 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 458/458 places, 1003/1003 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 443 transition count 718
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 443 transition count 718
Applied a total of 30 rules in 11 ms. Remains 443 /458 variables (removed 15) and now considering 718/1003 (removed 285) transitions.
// Phase 1: matrix 718 rows 443 cols
[2023-04-07 10:44:49] [INFO ] Computed 23 invariants in 5 ms
[2023-04-07 10:44:55] [INFO ] Implicit Places using invariants in 5870 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 5888 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 442/458 places, 718/1003 transitions.
Applied a total of 0 rules in 11 ms. Remains 442 /442 variables (removed 0) and now considering 718/718 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5912 ms. Remains : 442/458 places, 718/1003 transitions.
Stuttering acceptance computed with spot in 334 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(OR (EQ s13 0) (EQ s39 0)), p1:(OR (EQ s27 0) (EQ s31 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 169 ms.
Product exploration explored 100000 steps with 0 reset in 474 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 (NOT p1) p0))), (X (AND p1 p0)), (X p0), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 180 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Finished Best-First random walk after 5914 steps, including 1 resets, run visited all 1 properties in 4 ms. (steps per millisecond=1478 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), (X p0), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 8 factoid took 164 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-10-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-10-LTLFireability-05 finished in 7461 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) U !p1) U X((p2||X(p0)))))'
Support contains 5 out of 458 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 458/458 places, 1003/1003 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 443 transition count 718
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 443 transition count 718
Applied a total of 30 rules in 30 ms. Remains 443 /458 variables (removed 15) and now considering 718/1003 (removed 285) transitions.
// Phase 1: matrix 718 rows 443 cols
[2023-04-07 10:44:56] [INFO ] Computed 23 invariants in 11 ms
[2023-04-07 10:44:57] [INFO ] Implicit Places using invariants in 589 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 595 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 442/458 places, 718/1003 transitions.
Applied a total of 0 rules in 6 ms. Remains 442 /442 variables (removed 0) and now considering 718/718 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 631 ms. Remains : 442/458 places, 718/1003 transitions.
Stuttering acceptance computed with spot in 845 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), (NOT p0), true, (AND (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, (AND p1 (NOT p0)), p0, p1]
Running random walk in product with property : Anderson-PT-10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={} source=2 dest: 6}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 7}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=2 dest: 8}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 9}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 10}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 6}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 9}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=7 dest: 10}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=8 dest: 4}], [{ cond=(NOT p0), acceptance={} source=9 dest: 11}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=10 dest: 12}], [{ cond=p0, acceptance={} source=11 dest: 5}, { cond=(NOT p0), acceptance={} source=11 dest: 11}], [{ cond=(AND p1 p0), acceptance={0} source=12 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={0} source=12 dest: 11}, { cond=(AND p1 (NOT p0)), acceptance={0} source=12 dest: 12}]], initial=0, aps=[p1:(AND (EQ s28 1) (EQ s39 1)), p0:(AND (EQ s27 1) (EQ s33 1)), p2:(AND (EQ s12 1) (EQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 215 ms.
Stack based approach found an accepted trace after 100 steps with 0 reset with depth 101 and stack size 101 in 1 ms.
FORMULA Anderson-PT-10-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-10-LTLFireability-07 finished in 1741 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)||(!p0&&F(G(!p1)))))'
Support contains 6 out of 458 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 458/458 places, 1003/1003 transitions.
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 90 Pre rules applied. Total rules applied 0 place count 458 transition count 913
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 0 with 180 rules applied. Total rules applied 180 place count 368 transition count 913
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 195 place count 353 transition count 628
Iterating global reduction 0 with 15 rules applied. Total rules applied 210 place count 353 transition count 628
Applied a total of 210 rules in 33 ms. Remains 353 /458 variables (removed 105) and now considering 628/1003 (removed 375) transitions.
// Phase 1: matrix 628 rows 353 cols
[2023-04-07 10:44:58] [INFO ] Computed 23 invariants in 5 ms
[2023-04-07 10:44:59] [INFO ] Implicit Places using invariants in 724 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 726 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 352/458 places, 628/1003 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 98 place count 352 transition count 530
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 196 place count 254 transition count 530
Applied a total of 196 rules in 10 ms. Remains 254 /352 variables (removed 98) and now considering 530/628 (removed 98) transitions.
// Phase 1: matrix 530 rows 254 cols
[2023-04-07 10:44:59] [INFO ] Computed 22 invariants in 4 ms
[2023-04-07 10:44:59] [INFO ] Implicit Places using invariants in 334 ms returned []
[2023-04-07 10:44:59] [INFO ] Invariant cache hit.
[2023-04-07 10:45:00] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 10:45:00] [INFO ] Implicit Places using invariants and state equation in 878 ms returned []
Implicit Place search using SMT with State Equation took 1224 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 254/458 places, 530/1003 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2002 ms. Remains : 254/458 places, 530/1003 transitions.
Stuttering acceptance computed with spot in 214 ms :[p0, true, (AND p0 p1), p1]
Running random walk in product with property : Anderson-PT-10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (NOT (AND (EQ s18 1) (EQ s36 1))) (EQ s28 1) (EQ s41 1)), p1:(AND (EQ s26 1) (EQ s81 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 168 ms.
Product exploration explored 100000 steps with 0 reset in 251 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 p0) (NOT p1)), (X (NOT p0)), true, (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 151 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(AND p0 p1), p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) 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 2) seen :1
Running SMT prover for 1 properties.
[2023-04-07 10:45:01] [INFO ] Invariant cache hit.
[2023-04-07 10:45:01] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2023-04-07 10:45:01] [INFO ] [Real]Absence check using 12 positive and 10 generalized place invariants in 13 ms returned sat
[2023-04-07 10:45:02] [INFO ] After 390ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 10:45:02] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2023-04-07 10:45:02] [INFO ] [Nat]Absence check using 12 positive and 10 generalized place invariants in 13 ms returned sat
[2023-04-07 10:45:02] [INFO ] After 281ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 10:45:02] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 10:45:02] [INFO ] After 94ms SMT Verify possible using 90 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 10:45:02] [INFO ] After 145ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-04-07 10:45:02] [INFO ] After 560ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 254/254 places, 530/530 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 254 transition count 528
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 252 transition count 528
Applied a total of 4 rules in 25 ms. Remains 252 /254 variables (removed 2) and now considering 528/530 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 252/254 places, 528/530 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) 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
Interrupted probabilistic random walk after 913121 steps, run timeout after 3001 ms. (steps per millisecond=304 ) properties seen :{}
Probabilistic random walk after 913121 steps, saw 656121 distinct states, run finished after 3001 ms. (steps per millisecond=304 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 528 rows 252 cols
[2023-04-07 10:45:05] [INFO ] Computed 22 invariants in 5 ms
[2023-04-07 10:45:05] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-04-07 10:45:05] [INFO ] [Real]Absence check using 12 positive and 10 generalized place invariants in 9 ms returned sat
[2023-04-07 10:45:05] [INFO ] After 272ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 10:45:06] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-04-07 10:45:06] [INFO ] [Nat]Absence check using 12 positive and 10 generalized place invariants in 8 ms returned sat
[2023-04-07 10:45:06] [INFO ] After 158ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 10:45:06] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 10:45:06] [INFO ] After 90ms SMT Verify possible using 90 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 10:45:06] [INFO ] After 133ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 56 ms.
[2023-04-07 10:45:06] [INFO ] After 469ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 528/528 transitions.
Applied a total of 0 rules in 19 ms. Remains 252 /252 variables (removed 0) and now considering 528/528 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 252/252 places, 528/528 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 528/528 transitions.
Applied a total of 0 rules in 6 ms. Remains 252 /252 variables (removed 0) and now considering 528/528 (removed 0) transitions.
[2023-04-07 10:45:06] [INFO ] Invariant cache hit.
[2023-04-07 10:45:06] [INFO ] Implicit Places using invariants in 298 ms returned []
[2023-04-07 10:45:06] [INFO ] Invariant cache hit.
[2023-04-07 10:45:07] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 10:45:07] [INFO ] Implicit Places using invariants and state equation in 785 ms returned []
Implicit Place search using SMT with State Equation took 1088 ms to find 0 implicit places.
[2023-04-07 10:45:07] [INFO ] Redundant transitions in 9 ms returned []
[2023-04-07 10:45:07] [INFO ] Invariant cache hit.
[2023-04-07 10:45:07] [INFO ] Dead Transitions using invariants and state equation in 301 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1429 ms. Remains : 252/252 places, 528/528 transitions.
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 100 Pre rules applied. Total rules applied 0 place count 252 transition count 428
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 152 transition count 428
Applied a total of 200 rules in 13 ms. Remains 152 /252 variables (removed 100) and now considering 428/528 (removed 100) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 428 rows 152 cols
[2023-04-07 10:45:07] [INFO ] Computed 22 invariants in 2 ms
[2023-04-07 10:45:07] [INFO ] [Real]Absence check using 13 positive place invariants in 14 ms returned sat
[2023-04-07 10:45:08] [INFO ] [Real]Absence check using 13 positive and 9 generalized place invariants in 13 ms returned sat
[2023-04-07 10:45:08] [INFO ] After 255ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 10:45:08] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-04-07 10:45:08] [INFO ] [Nat]Absence check using 13 positive and 9 generalized place invariants in 7 ms returned sat
[2023-04-07 10:45:08] [INFO ] After 107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 10:45:08] [INFO ] After 137ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-04-07 10:45:08] [INFO ] After 256ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), true, (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 5 factoid took 203 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 160 ms :[(AND p0 p1), p1]
Stuttering acceptance computed with spot in 154 ms :[(AND p0 p1), p1]
Support contains 6 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 530/530 transitions.
Applied a total of 0 rules in 10 ms. Remains 254 /254 variables (removed 0) and now considering 530/530 (removed 0) transitions.
// Phase 1: matrix 530 rows 254 cols
[2023-04-07 10:45:09] [INFO ] Computed 22 invariants in 5 ms
[2023-04-07 10:45:09] [INFO ] Implicit Places using invariants in 345 ms returned []
[2023-04-07 10:45:09] [INFO ] Invariant cache hit.
[2023-04-07 10:45:09] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 10:45:10] [INFO ] Implicit Places using invariants and state equation in 1198 ms returned []
Implicit Place search using SMT with State Equation took 1566 ms to find 0 implicit places.
[2023-04-07 10:45:10] [INFO ] Redundant transitions in 19 ms returned []
[2023-04-07 10:45:10] [INFO ] Invariant cache hit.
[2023-04-07 10:45:10] [INFO ] Dead Transitions using invariants and state equation in 319 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1964 ms. Remains : 254/254 places, 530/530 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 162 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 129 ms :[(AND p0 p1), p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 2) 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 2) seen :1
Running SMT prover for 1 properties.
[2023-04-07 10:45:11] [INFO ] Invariant cache hit.
[2023-04-07 10:45:11] [INFO ] [Real]Absence check using 12 positive place invariants in 36 ms returned sat
[2023-04-07 10:45:11] [INFO ] [Real]Absence check using 12 positive and 10 generalized place invariants in 79 ms returned sat
[2023-04-07 10:45:13] [INFO ] After 1425ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 10:45:13] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-04-07 10:45:13] [INFO ] [Nat]Absence check using 12 positive and 10 generalized place invariants in 11 ms returned sat
[2023-04-07 10:45:13] [INFO ] After 254ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 10:45:13] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 10:45:13] [INFO ] After 124ms SMT Verify possible using 90 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 10:45:13] [INFO ] After 175ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-04-07 10:45:13] [INFO ] After 599ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 254/254 places, 530/530 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 254 transition count 528
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 252 transition count 528
Applied a total of 4 rules in 25 ms. Remains 252 /254 variables (removed 2) and now considering 528/530 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 252/254 places, 528/530 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 926141 steps, run timeout after 3028 ms. (steps per millisecond=305 ) properties seen :{}
Probabilistic random walk after 926141 steps, saw 665119 distinct states, run finished after 3028 ms. (steps per millisecond=305 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 528 rows 252 cols
[2023-04-07 10:45:16] [INFO ] Computed 22 invariants in 4 ms
[2023-04-07 10:45:16] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-04-07 10:45:16] [INFO ] [Real]Absence check using 12 positive and 10 generalized place invariants in 16 ms returned sat
[2023-04-07 10:45:17] [INFO ] After 390ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 10:45:17] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2023-04-07 10:45:17] [INFO ] [Nat]Absence check using 12 positive and 10 generalized place invariants in 13 ms returned sat
[2023-04-07 10:45:17] [INFO ] After 229ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 10:45:17] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 10:45:17] [INFO ] After 79ms SMT Verify possible using 90 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 10:45:17] [INFO ] After 124ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-04-07 10:45:17] [INFO ] After 529ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 528/528 transitions.
Applied a total of 0 rules in 9 ms. Remains 252 /252 variables (removed 0) and now considering 528/528 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 252/252 places, 528/528 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 528/528 transitions.
Applied a total of 0 rules in 14 ms. Remains 252 /252 variables (removed 0) and now considering 528/528 (removed 0) transitions.
[2023-04-07 10:45:17] [INFO ] Invariant cache hit.
[2023-04-07 10:45:17] [INFO ] Implicit Places using invariants in 292 ms returned []
[2023-04-07 10:45:17] [INFO ] Invariant cache hit.
[2023-04-07 10:45:18] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 10:45:19] [INFO ] Implicit Places using invariants and state equation in 1060 ms returned []
Implicit Place search using SMT with State Equation took 1373 ms to find 0 implicit places.
[2023-04-07 10:45:19] [INFO ] Redundant transitions in 3 ms returned []
[2023-04-07 10:45:19] [INFO ] Invariant cache hit.
[2023-04-07 10:45:19] [INFO ] Dead Transitions using invariants and state equation in 532 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1968 ms. Remains : 252/252 places, 528/528 transitions.
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 100 Pre rules applied. Total rules applied 0 place count 252 transition count 428
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 152 transition count 428
Applied a total of 200 rules in 9 ms. Remains 152 /252 variables (removed 100) and now considering 428/528 (removed 100) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 428 rows 152 cols
[2023-04-07 10:45:19] [INFO ] Computed 22 invariants in 2 ms
[2023-04-07 10:45:19] [INFO ] [Real]Absence check using 13 positive place invariants in 14 ms returned sat
[2023-04-07 10:45:19] [INFO ] [Real]Absence check using 13 positive and 9 generalized place invariants in 13 ms returned sat
[2023-04-07 10:45:19] [INFO ] After 313ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 10:45:20] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-04-07 10:45:20] [INFO ] [Nat]Absence check using 13 positive and 9 generalized place invariants in 14 ms returned sat
[2023-04-07 10:45:20] [INFO ] After 177ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 10:45:20] [INFO ] After 208ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-04-07 10:45:20] [INFO ] After 385ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 5 factoid took 221 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 131 ms :[(AND p0 p1), p1]
Stuttering acceptance computed with spot in 169 ms :[(AND p0 p1), p1]
Stuttering acceptance computed with spot in 138 ms :[(AND p0 p1), p1]
Product exploration explored 100000 steps with 0 reset in 312 ms.
Product exploration explored 100000 steps with 0 reset in 384 ms.
Support contains 6 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 530/530 transitions.
Applied a total of 0 rules in 7 ms. Remains 254 /254 variables (removed 0) and now considering 530/530 (removed 0) transitions.
// Phase 1: matrix 530 rows 254 cols
[2023-04-07 10:45:21] [INFO ] Computed 22 invariants in 8 ms
[2023-04-07 10:45:22] [INFO ] Implicit Places using invariants in 396 ms returned []
[2023-04-07 10:45:22] [INFO ] Invariant cache hit.
[2023-04-07 10:45:22] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 10:45:22] [INFO ] Implicit Places using invariants and state equation in 801 ms returned []
Implicit Place search using SMT with State Equation took 1221 ms to find 0 implicit places.
[2023-04-07 10:45:23] [INFO ] Redundant transitions in 19 ms returned []
[2023-04-07 10:45:23] [INFO ] Invariant cache hit.
[2023-04-07 10:45:23] [INFO ] Dead Transitions using invariants and state equation in 530 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1831 ms. Remains : 254/254 places, 530/530 transitions.
Treatment of property Anderson-PT-10-LTLFireability-08 finished in 25220 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(G((X(X(G(p0))) U (p1||F(p2)))))))'
Support contains 6 out of 458 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 458/458 places, 1003/1003 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 444 transition count 737
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 444 transition count 737
Applied a total of 28 rules in 10 ms. Remains 444 /458 variables (removed 14) and now considering 737/1003 (removed 266) transitions.
// Phase 1: matrix 737 rows 444 cols
[2023-04-07 10:45:23] [INFO ] Computed 23 invariants in 20 ms
[2023-04-07 10:45:24] [INFO ] Implicit Places using invariants in 503 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 505 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 443/458 places, 737/1003 transitions.
Applied a total of 0 rules in 4 ms. Remains 443 /443 variables (removed 0) and now considering 737/737 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 520 ms. Remains : 443/458 places, 737/1003 transitions.
Stuttering acceptance computed with spot in 435 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : Anderson-PT-10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s11 1) (EQ s36 1)), p2:(AND (EQ s13 1) (EQ s40 1)), p0:(AND (EQ s28 1) (EQ s32 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 155 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-10-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-10-LTLFireability-09 finished in 1205 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(G(p0))))'
Support contains 2 out of 458 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 458/458 places, 1003/1003 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 441 transition count 680
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 441 transition count 680
Applied a total of 34 rules in 15 ms. Remains 441 /458 variables (removed 17) and now considering 680/1003 (removed 323) transitions.
// Phase 1: matrix 680 rows 441 cols
[2023-04-07 10:45:25] [INFO ] Computed 23 invariants in 17 ms
[2023-04-07 10:45:25] [INFO ] Implicit Places using invariants in 379 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 396 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 440/458 places, 680/1003 transitions.
Applied a total of 0 rules in 5 ms. Remains 440 /440 variables (removed 0) and now considering 680/680 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 416 ms. Remains : 440/458 places, 680/1003 transitions.
Stuttering acceptance computed with spot in 281 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s3 1) (EQ s256 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-10-LTLFireability-10 finished in 731 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(G(p0)))'
Support contains 2 out of 458 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 458/458 places, 1003/1003 transitions.
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 90 Pre rules applied. Total rules applied 0 place count 458 transition count 913
Deduced a syphon composed of 90 places in 0 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 0 with 180 rules applied. Total rules applied 180 place count 368 transition count 913
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 197 place count 351 transition count 590
Iterating global reduction 0 with 17 rules applied. Total rules applied 214 place count 351 transition count 590
Applied a total of 214 rules in 39 ms. Remains 351 /458 variables (removed 107) and now considering 590/1003 (removed 413) transitions.
// Phase 1: matrix 590 rows 351 cols
[2023-04-07 10:45:25] [INFO ] Computed 23 invariants in 3 ms
[2023-04-07 10:45:26] [INFO ] Implicit Places using invariants in 522 ms returned []
[2023-04-07 10:45:26] [INFO ] Invariant cache hit.
[2023-04-07 10:45:26] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 10:45:27] [INFO ] Implicit Places using invariants and state equation in 1280 ms returned []
Implicit Place search using SMT with State Equation took 1823 ms to find 0 implicit places.
[2023-04-07 10:45:27] [INFO ] Redundant transitions in 36 ms returned []
[2023-04-07 10:45:27] [INFO ] Invariant cache hit.
[2023-04-07 10:45:28] [INFO ] Dead Transitions using invariants and state equation in 738 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 351/458 places, 590/1003 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2675 ms. Remains : 351/458 places, 590/1003 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-10-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s0 1) (EQ s257 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 210 ms.
Stack based approach found an accepted trace after 107 steps with 0 reset with depth 108 and stack size 108 in 0 ms.
FORMULA Anderson-PT-10-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-10-LTLFireability-11 finished in 3008 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)||(p1&&F(p2)))))'
Support contains 6 out of 458 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 458/458 places, 1003/1003 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 443 transition count 718
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 443 transition count 718
Applied a total of 30 rules in 24 ms. Remains 443 /458 variables (removed 15) and now considering 718/1003 (removed 285) transitions.
// Phase 1: matrix 718 rows 443 cols
[2023-04-07 10:45:28] [INFO ] Computed 23 invariants in 4 ms
[2023-04-07 10:45:29] [INFO ] Implicit Places using invariants in 687 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 700 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 442/458 places, 718/1003 transitions.
Applied a total of 0 rules in 5 ms. Remains 442 /442 variables (removed 0) and now considering 718/718 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 736 ms. Remains : 442/458 places, 718/1003 transitions.
Stuttering acceptance computed with spot in 275 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Anderson-PT-10-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s7 1) (EQ s274 1)), p1:(OR (EQ s18 0) (EQ s38 0)), p2:(AND (EQ s13 1) (EQ s35 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 23 reset in 266 ms.
Stack based approach found an accepted trace after 107 steps with 0 reset with depth 108 and stack size 108 in 0 ms.
FORMULA Anderson-PT-10-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-10-LTLFireability-14 finished in 1310 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)||(!p0&&F(G(!p1)))))'
[2023-04-07 10:45:30] [INFO ] Flatten gal took : 141 ms
[2023-04-07 10:45:30] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-04-07 10:45:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 458 places, 1003 transitions and 3832 arcs took 18 ms.
Total runtime 126175 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1018/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : Anderson-PT-10-LTLFireability-08

BK_STOP 1680864332777

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name Anderson-PT-10-LTLFireability-08
ltl formula formula --ltl=/tmp/1018/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 458 places, 1003 transitions and 3832 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1018/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1018/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.240 real 0.030 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1018/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1018/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size

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-10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is Anderson-PT-10, 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 r521-tall-167987246100052"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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