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-167987246400228.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 EisenbergMcGuire-PT-04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r521-tall-167987246400228
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 7.3K Mar 23 15:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Mar 23 15:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 11K Mar 23 15:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Mar 23 15:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Mar 23 15:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 23 15:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 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 255K 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 EisenbergMcGuire-PT-04-LTLFireability-00
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-01
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-02
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-03
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-04
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-05
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-06
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-07
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-08
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-09
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-10
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-11
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-12
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-13
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-14
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1680837885000

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=EisenbergMcGuire-PT-04
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 03:24:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 03:24:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 03:24:47] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2023-04-07 03:24:47] [INFO ] Transformed 196 places.
[2023-04-07 03:24:47] [INFO ] Transformed 448 transitions.
[2023-04-07 03:24:47] [INFO ] Found NUPN structural information;
[2023-04-07 03:24:47] [INFO ] Parsed PT model containing 196 places and 448 transitions and 1952 arcs in 147 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 3 formulas.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-04-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-04-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 448/448 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 188 transition count 416
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 188 transition count 416
Applied a total of 16 rules in 34 ms. Remains 188 /196 variables (removed 8) and now considering 416/448 (removed 32) transitions.
[2023-04-07 03:24:47] [INFO ] Flow matrix only has 252 transitions (discarded 164 similar events)
// Phase 1: matrix 252 rows 188 cols
[2023-04-07 03:24:47] [INFO ] Computed 13 invariants in 13 ms
[2023-04-07 03:24:47] [INFO ] Implicit Places using invariants in 370 ms returned []
[2023-04-07 03:24:47] [INFO ] Flow matrix only has 252 transitions (discarded 164 similar events)
[2023-04-07 03:24:47] [INFO ] Invariant cache hit.
[2023-04-07 03:24:47] [INFO ] State equation strengthened by 88 read => feed constraints.
[2023-04-07 03:24:48] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 794 ms to find 0 implicit places.
[2023-04-07 03:24:48] [INFO ] Flow matrix only has 252 transitions (discarded 164 similar events)
[2023-04-07 03:24:48] [INFO ] Invariant cache hit.
[2023-04-07 03:24:48] [INFO ] Dead Transitions using invariants and state equation in 295 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 188/196 places, 416/448 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1131 ms. Remains : 188/196 places, 416/448 transitions.
Support contains 41 out of 188 places after structural reductions.
[2023-04-07 03:24:48] [INFO ] Flatten gal took : 64 ms
[2023-04-07 03:24:48] [INFO ] Flatten gal took : 25 ms
[2023-04-07 03:24:48] [INFO ] Input system was already deterministic with 416 transitions.
Support contains 40 out of 188 places (down from 41) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 395 ms. (steps per millisecond=25 ) properties (out of 30) seen :8
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) 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 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) 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 21) 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 21) 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 21) 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 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) 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 21) 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 20) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
[2023-04-07 03:24:49] [INFO ] Flow matrix only has 252 transitions (discarded 164 similar events)
[2023-04-07 03:24:49] [INFO ] Invariant cache hit.
[2023-04-07 03:24:49] [INFO ] After 175ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-04-07 03:24:49] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-04-07 03:24:49] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 14 ms returned sat
[2023-04-07 03:24:50] [INFO ] After 332ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2023-04-07 03:24:50] [INFO ] State equation strengthened by 88 read => feed constraints.
[2023-04-07 03:24:50] [INFO ] After 258ms SMT Verify possible using 88 Read/Feed constraints in natural domain returned unsat :0 sat :19
[2023-04-07 03:24:50] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 8 ms to minimize.
[2023-04-07 03:24:50] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 1 ms to minimize.
[2023-04-07 03:24:50] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
[2023-04-07 03:24:50] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2023-04-07 03:24:50] [INFO ] Deduced a trap composed of 53 places in 76 ms of which 1 ms to minimize.
[2023-04-07 03:24:51] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 1 ms to minimize.
[2023-04-07 03:24:51] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 605 ms
[2023-04-07 03:24:51] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 0 ms to minimize.
[2023-04-07 03:24:51] [INFO ] Deduced a trap composed of 53 places in 62 ms of which 1 ms to minimize.
[2023-04-07 03:24:51] [INFO ] Deduced a trap composed of 52 places in 63 ms of which 1 ms to minimize.
[2023-04-07 03:24:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 258 ms
[2023-04-07 03:24:51] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
[2023-04-07 03:24:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2023-04-07 03:24:51] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 1 ms to minimize.
[2023-04-07 03:24:51] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2023-04-07 03:24:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 122 ms
[2023-04-07 03:24:51] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-04-07 03:24:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2023-04-07 03:24:51] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2023-04-07 03:24:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2023-04-07 03:24:51] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 0 ms to minimize.
[2023-04-07 03:24:51] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 0 ms to minimize.
[2023-04-07 03:24:52] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 0 ms to minimize.
[2023-04-07 03:24:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 254 ms
[2023-04-07 03:24:52] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2023-04-07 03:24:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2023-04-07 03:24:52] [INFO ] After 2167ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 296 ms.
[2023-04-07 03:24:52] [INFO ] After 3022ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Fused 19 Parikh solutions to 18 different solutions.
Parikh walk visited 0 properties in 375 ms.
Support contains 27 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 416/416 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 188 transition count 414
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 186 transition count 414
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 4 place count 186 transition count 367
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 98 place count 139 transition count 367
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 99 place count 138 transition count 363
Iterating global reduction 2 with 1 rules applied. Total rules applied 100 place count 138 transition count 363
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 124 place count 126 transition count 351
Applied a total of 124 rules in 62 ms. Remains 126 /188 variables (removed 62) and now considering 351/416 (removed 65) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 126/188 places, 351/416 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 273 ms. (steps per millisecond=36 ) properties (out of 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) 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 19) 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 19) 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 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) 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 19) 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 19) 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 19) seen :0
Interrupted probabilistic random walk after 491560 steps, run timeout after 3001 ms. (steps per millisecond=163 ) properties seen :{1=1, 2=1, 3=1, 4=1, 5=1, 6=1, 7=1, 8=1, 9=1, 10=1, 11=1, 12=1, 13=1, 14=1, 15=1, 17=1, 18=1}
Probabilistic random walk after 491560 steps, saw 100381 distinct states, run finished after 3001 ms. (steps per millisecond=163 ) properties seen :17
Running SMT prover for 2 properties.
[2023-04-07 03:24:56] [INFO ] Flow matrix only has 187 transitions (discarded 164 similar events)
// Phase 1: matrix 187 rows 126 cols
[2023-04-07 03:24:56] [INFO ] Computed 13 invariants in 3 ms
[2023-04-07 03:24:56] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 03:24:56] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-04-07 03:24:56] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 03:24:56] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 03:24:56] [INFO ] State equation strengthened by 85 read => feed constraints.
[2023-04-07 03:24:56] [INFO ] After 27ms SMT Verify possible using 85 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 03:24:56] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2023-04-07 03:24:56] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2023-04-07 03:24:56] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2023-04-07 03:24:56] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2023-04-07 03:24:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 238 ms
[2023-04-07 03:24:56] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2023-04-07 03:24:57] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 0 ms to minimize.
[2023-04-07 03:24:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 149 ms
[2023-04-07 03:24:57] [INFO ] After 439ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-04-07 03:24:57] [INFO ] After 584ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 14 ms.
Support contains 5 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 351/351 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 126 transition count 344
Deduced a syphon composed of 7 places in 8 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 119 transition count 344
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 116 transition count 332
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 116 transition count 332
Applied a total of 20 rules in 33 ms. Remains 116 /126 variables (removed 10) and now considering 332/351 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 116/126 places, 332/351 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Finished probabilistic random walk after 669718 steps, run visited all 2 properties in 2185 ms. (steps per millisecond=306 )
Probabilistic random walk after 669718 steps, saw 135261 distinct states, run finished after 2185 ms. (steps per millisecond=306 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA EisenbergMcGuire-PT-04-LTLFireability-15 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' '!(X((X(p0)||G(p1)||G(!p0))))'
Support contains 4 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 416/416 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 184 transition count 400
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 184 transition count 400
Applied a total of 8 rules in 17 ms. Remains 184 /188 variables (removed 4) and now considering 400/416 (removed 16) transitions.
[2023-04-07 03:24:59] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
// Phase 1: matrix 236 rows 184 cols
[2023-04-07 03:24:59] [INFO ] Computed 13 invariants in 2 ms
[2023-04-07 03:25:00] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-04-07 03:25:00] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2023-04-07 03:25:00] [INFO ] Invariant cache hit.
[2023-04-07 03:25:00] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-04-07 03:25:00] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
[2023-04-07 03:25:00] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2023-04-07 03:25:00] [INFO ] Invariant cache hit.
[2023-04-07 03:25:00] [INFO ] Dead Transitions using invariants and state equation in 170 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 184/188 places, 400/416 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 578 ms. Remains : 184/188 places, 400/416 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 498 ms :[true, (NOT p0), false, false, (AND (NOT p1) (NOT p0)), p0, (AND p0 (NOT p1)), (NOT p1), false, false]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 1}, { cond=(AND p1 p0), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 8}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 7}], [{ cond=p0, acceptance={} source=5 dest: 0}, { cond=(NOT p0), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 6}, { cond=(AND p1 p0), acceptance={} source=6 dest: 7}], [{ cond=(NOT p1), acceptance={} source=7 dest: 0}, { cond=p1, acceptance={} source=7 dest: 7}], [{ cond=(NOT p0), acceptance={} source=8 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=9 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=9 dest: 6}]], initial=2, aps=[p0:(AND (EQ s6 1) (EQ s84 1)), p1:(OR (EQ s0 0) (EQ s6 0) (EQ s134 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 289 ms.
Product exploration explored 100000 steps with 0 reset in 205 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 131 ms. Reduced automaton from 10 states, 20 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p1), (AND (NOT p1) p0), p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-04-07 03:25:02] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2023-04-07 03:25:02] [INFO ] Invariant cache hit.
[2023-04-07 03:25:02] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 03:25:02] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-04-07 03:25:02] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 03:25:02] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 03:25:02] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-04-07 03:25:02] [INFO ] After 45ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 03:25:02] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2023-04-07 03:25:02] [INFO ] Deduced a trap composed of 51 places in 65 ms of which 0 ms to minimize.
[2023-04-07 03:25:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 178 ms
[2023-04-07 03:25:02] [INFO ] After 281ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-04-07 03:25:02] [INFO ] After 476ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 18 ms.
Support contains 4 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 400/400 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 184 transition count 396
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 180 transition count 396
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 8 place count 180 transition count 345
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 110 place count 129 transition count 345
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 134 place count 117 transition count 333
Applied a total of 134 rules in 19 ms. Remains 117 /184 variables (removed 67) and now considering 333/400 (removed 67) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 117/184 places, 333/400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 671815 steps, run timeout after 3001 ms. (steps per millisecond=223 ) properties seen :{}
Probabilistic random walk after 671815 steps, saw 135622 distinct states, run finished after 3002 ms. (steps per millisecond=223 ) properties seen :0
Running SMT prover for 3 properties.
[2023-04-07 03:25:05] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
// Phase 1: matrix 169 rows 117 cols
[2023-04-07 03:25:05] [INFO ] Computed 13 invariants in 2 ms
[2023-04-07 03:25:05] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 03:25:05] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2023-04-07 03:25:05] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 03:25:06] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 03:25:06] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-04-07 03:25:06] [INFO ] After 34ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 03:25:06] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-04-07 03:25:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2023-04-07 03:25:06] [INFO ] After 115ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-04-07 03:25:06] [INFO ] After 266ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 333/333 transitions.
Applied a total of 0 rules in 9 ms. Remains 117 /117 variables (removed 0) and now considering 333/333 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 117/117 places, 333/333 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 333/333 transitions.
Applied a total of 0 rules in 8 ms. Remains 117 /117 variables (removed 0) and now considering 333/333 (removed 0) transitions.
[2023-04-07 03:25:06] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
[2023-04-07 03:25:06] [INFO ] Invariant cache hit.
[2023-04-07 03:25:06] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-04-07 03:25:06] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
[2023-04-07 03:25:06] [INFO ] Invariant cache hit.
[2023-04-07 03:25:06] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-04-07 03:25:06] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
[2023-04-07 03:25:06] [INFO ] Redundant transitions in 25 ms returned []
[2023-04-07 03:25:06] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
[2023-04-07 03:25:06] [INFO ] Invariant cache hit.
[2023-04-07 03:25:06] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 475 ms. Remains : 117/117 places, 333/333 transitions.
Graph (trivial) has 281 edges and 117 vertex of which 16 / 117 are part of one of the 4 SCC in 4 ms
Free SCC test removed 12 places
Drop transitions removed 44 transitions
Ensure Unique test removed 156 transitions
Reduce isomorphic transitions removed 200 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 105 transition count 111
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 45 place count 83 transition count 111
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 45 place count 83 transition count 103
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 65 place count 71 transition count 103
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 111 place count 48 transition count 80
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 121 place count 48 transition count 70
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 135 place count 41 transition count 102
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 138 place count 41 transition count 99
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 142 place count 41 transition count 95
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 143 place count 41 transition count 94
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 144 place count 40 transition count 94
Partial Free-agglomeration rule applied 17 times.
Drop transitions removed 17 transitions
Iterating global reduction 5 with 17 rules applied. Total rules applied 161 place count 40 transition count 94
Applied a total of 161 rules in 33 ms. Remains 40 /117 variables (removed 77) and now considering 94/333 (removed 239) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 94 rows 40 cols
[2023-04-07 03:25:06] [INFO ] Computed 9 invariants in 0 ms
[2023-04-07 03:25:06] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 03:25:06] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-04-07 03:25:06] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 03:25:06] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 03:25:06] [INFO ] After 15ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 03:25:06] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2023-04-07 03:25:06] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
[2023-04-07 03:25:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 47 ms
[2023-04-07 03:25:06] [INFO ] After 85ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-04-07 03:25:06] [INFO ] After 167ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND (NOT p0) p1), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F p0), (F (AND p0 p1))]
Knowledge based reduction with 8 factoid took 206 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 150 ms :[true, (NOT p1), (AND (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p1), (AND (NOT p1) p0), p0]
Support contains 4 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 400/400 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 184 transition count 396
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 180 transition count 396
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 8 place count 180 transition count 345
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 110 place count 129 transition count 345
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 134 place count 117 transition count 333
Applied a total of 134 rules in 30 ms. Remains 117 /184 variables (removed 67) and now considering 333/400 (removed 67) transitions.
[2023-04-07 03:25:07] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
// Phase 1: matrix 169 rows 117 cols
[2023-04-07 03:25:07] [INFO ] Computed 13 invariants in 1 ms
[2023-04-07 03:25:07] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-04-07 03:25:07] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
[2023-04-07 03:25:07] [INFO ] Invariant cache hit.
[2023-04-07 03:25:07] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-04-07 03:25:07] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
[2023-04-07 03:25:07] [INFO ] Redundant transitions in 6 ms returned []
[2023-04-07 03:25:07] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
[2023-04-07 03:25:07] [INFO ] Invariant cache hit.
[2023-04-07 03:25:07] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 117/184 places, 333/400 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 514 ms. Remains : 117/184 places, 333/400 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 p1 (NOT p0)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), true, (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 124 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p1), (AND (NOT p1) p0), p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-04-07 03:25:08] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
[2023-04-07 03:25:08] [INFO ] Invariant cache hit.
[2023-04-07 03:25:08] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 03:25:08] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-04-07 03:25:08] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 2 ms returned sat
[2023-04-07 03:25:08] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 03:25:08] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-04-07 03:25:08] [INFO ] After 31ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 03:25:08] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 4 ms to minimize.
[2023-04-07 03:25:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2023-04-07 03:25:08] [INFO ] After 119ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-04-07 03:25:08] [INFO ] After 242ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 333/333 transitions.
Applied a total of 0 rules in 7 ms. Remains 117 /117 variables (removed 0) and now considering 333/333 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 117/117 places, 333/333 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Finished probabilistic random walk after 728431 steps, run visited all 3 properties in 2382 ms. (steps per millisecond=305 )
Probabilistic random walk after 728431 steps, saw 146957 distinct states, run finished after 2383 ms. (steps per millisecond=305 ) properties seen :3
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), true, (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT p1)), (F (AND p0 p1)), (F (AND p0 (NOT p1)))]
Property proved to be false thanks to negative knowledge :(F (AND p0 (NOT p1)))
Knowledge based reduction with 14 factoid took 392 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-04-LTLFireability-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-02 finished in 11798 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 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 416/416 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 188 transition count 412
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 184 transition count 412
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 8 place count 184 transition count 360
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 112 place count 132 transition count 360
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 115 place count 129 transition count 348
Iterating global reduction 2 with 3 rules applied. Total rules applied 118 place count 129 transition count 348
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 142 place count 117 transition count 336
Applied a total of 142 rules in 25 ms. Remains 117 /188 variables (removed 71) and now considering 336/416 (removed 80) transitions.
[2023-04-07 03:25:11] [INFO ] Flow matrix only has 172 transitions (discarded 164 similar events)
// Phase 1: matrix 172 rows 117 cols
[2023-04-07 03:25:11] [INFO ] Computed 13 invariants in 3 ms
[2023-04-07 03:25:11] [INFO ] Implicit Places using invariants in 184 ms returned []
[2023-04-07 03:25:11] [INFO ] Flow matrix only has 172 transitions (discarded 164 similar events)
[2023-04-07 03:25:11] [INFO ] Invariant cache hit.
[2023-04-07 03:25:11] [INFO ] State equation strengthened by 79 read => feed constraints.
[2023-04-07 03:25:12] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
[2023-04-07 03:25:12] [INFO ] Redundant transitions in 9 ms returned []
[2023-04-07 03:25:12] [INFO ] Flow matrix only has 172 transitions (discarded 164 similar events)
[2023-04-07 03:25:12] [INFO ] Invariant cache hit.
[2023-04-07 03:25:12] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 117/188 places, 336/416 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 619 ms. Remains : 117/188 places, 336/416 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s2 0) (EQ s40 0))], 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 132 ms.
Product exploration explored 100000 steps with 0 reset in 233 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 246678 steps, run visited all 1 properties in 504 ms. (steps per millisecond=489 )
Probabilistic random walk after 246678 steps, saw 52317 distinct states, run finished after 504 ms. (steps per millisecond=489 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Support contains 2 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 336/336 transitions.
Applied a total of 0 rules in 11 ms. Remains 117 /117 variables (removed 0) and now considering 336/336 (removed 0) transitions.
[2023-04-07 03:25:13] [INFO ] Flow matrix only has 172 transitions (discarded 164 similar events)
[2023-04-07 03:25:13] [INFO ] Invariant cache hit.
[2023-04-07 03:25:13] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-04-07 03:25:13] [INFO ] Flow matrix only has 172 transitions (discarded 164 similar events)
[2023-04-07 03:25:13] [INFO ] Invariant cache hit.
[2023-04-07 03:25:13] [INFO ] State equation strengthened by 79 read => feed constraints.
[2023-04-07 03:25:13] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
[2023-04-07 03:25:13] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 03:25:13] [INFO ] Flow matrix only has 172 transitions (discarded 164 similar events)
[2023-04-07 03:25:13] [INFO ] Invariant cache hit.
[2023-04-07 03:25:13] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 475 ms. Remains : 117/117 places, 336/336 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 61 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 246678 steps, run visited all 1 properties in 478 ms. (steps per millisecond=516 )
Probabilistic random walk after 246678 steps, saw 52317 distinct states, run finished after 478 ms. (steps per millisecond=516 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 303 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 130 ms.
Product exploration explored 100000 steps with 0 reset in 133 ms.
Support contains 2 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 336/336 transitions.
Applied a total of 0 rules in 7 ms. Remains 117 /117 variables (removed 0) and now considering 336/336 (removed 0) transitions.
[2023-04-07 03:25:15] [INFO ] Flow matrix only has 172 transitions (discarded 164 similar events)
[2023-04-07 03:25:15] [INFO ] Invariant cache hit.
[2023-04-07 03:25:15] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-04-07 03:25:15] [INFO ] Flow matrix only has 172 transitions (discarded 164 similar events)
[2023-04-07 03:25:15] [INFO ] Invariant cache hit.
[2023-04-07 03:25:15] [INFO ] State equation strengthened by 79 read => feed constraints.
[2023-04-07 03:25:15] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2023-04-07 03:25:15] [INFO ] Redundant transitions in 2 ms returned []
[2023-04-07 03:25:15] [INFO ] Flow matrix only has 172 transitions (discarded 164 similar events)
[2023-04-07 03:25:15] [INFO ] Invariant cache hit.
[2023-04-07 03:25:15] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 459 ms. Remains : 117/117 places, 336/336 transitions.
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-03 finished in 4173 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) U G(p1)) U X((G((p3 U p4))&&p2))))'
Support contains 9 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 416/416 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 184 transition count 400
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 184 transition count 400
Applied a total of 8 rules in 3 ms. Remains 184 /188 variables (removed 4) and now considering 400/416 (removed 16) transitions.
[2023-04-07 03:25:15] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
// Phase 1: matrix 236 rows 184 cols
[2023-04-07 03:25:15] [INFO ] Computed 13 invariants in 1 ms
[2023-04-07 03:25:15] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-04-07 03:25:15] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2023-04-07 03:25:15] [INFO ] Invariant cache hit.
[2023-04-07 03:25:16] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-04-07 03:25:16] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
[2023-04-07 03:25:16] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2023-04-07 03:25:16] [INFO ] Invariant cache hit.
[2023-04-07 03:25:16] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 184/188 places, 400/416 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 576 ms. Remains : 184/188 places, 400/416 transitions.
Stuttering acceptance computed with spot in 1213 ms :[(OR (NOT p4) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p4))), (OR (NOT p2) (NOT p4)), (OR (AND (NOT p0) (NOT p1) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p2))), true, (NOT p4), (NOT p4), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p4)), (AND (NOT p0) (NOT p4)), (AND (NOT p1) (NOT p3) (NOT p4)), (NOT p4), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p4)), (AND (NOT p0) (NOT p1) (NOT p4)), (NOT p4), (AND (NOT p1) p0), (AND p0 (NOT p1) (NOT p4)), (AND p0 (NOT p1) (NOT p4))]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p4) (NOT p3))), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) p2 (NOT p4) p3), acceptance={} source=1 dest: 5}, { cond=(OR (AND (NOT p0) p2 p4) (AND (NOT p0) p2 p3)), acceptance={} source=1 dest: 6}], [{ cond=(OR (NOT p2) (AND (NOT p4) (NOT p3))), acceptance={0} source=2 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p4) (NOT p3))), acceptance={} source=2 dest: 7}, { cond=(OR (NOT p2) (AND (NOT p4) (NOT p3))), acceptance={} source=2 dest: 8}, { cond=(OR (AND (NOT p1) p2 p4) (AND (NOT p1) p2 p3)), acceptance={} source=2 dest: 10}, { cond=(OR (AND p2 p4) (AND p2 p3)), acceptance={} source=2 dest: 12}, { cond=(OR (AND p1 (NOT p2)) (AND p1 (NOT p4) (NOT p3))), acceptance={} source=2 dest: 13}, { cond=(OR (AND p1 p2 p4) (AND p1 p2 p3)), acceptance={} source=2 dest: 15}, { cond=(AND p2 (NOT p4) p3), acceptance={0} source=2 dest: 16}], [{ cond=(OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0) (NOT p4) (NOT p3))), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p0) p2 (NOT p4) p3), acceptance={} source=3 dest: 5}, { cond=(OR (AND (NOT p1) (NOT p0) p2 p4) (AND (NOT p1) (NOT p0) p2 p3)), acceptance={} source=3 dest: 6}, { cond=(OR (AND p1 (NOT p0) (NOT p2)) (AND p1 (NOT p0) (NOT p4) (NOT p3))), acceptance={} source=3 dest: 17}, { cond=(OR (AND p1 (NOT p0) p2 p4) (AND p1 (NOT p0) p2 p3)), acceptance={} source=3 dest: 19}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p4) (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p4) p3), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p4) (NOT p3)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p4) p3), acceptance={} source=6 dest: 5}, { cond=(OR p4 p3), acceptance={} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 4}], [{ cond=(NOT p1), acceptance={} source=8 dest: 7}, { cond=p1, acceptance={} source=8 dest: 8}, { cond=(NOT p1), acceptance={0} source=8 dest: 8}, { cond=p1, acceptance={} source=8 dest: 13}], [{ cond=(AND (NOT p0) (NOT p4) (NOT p3)), acceptance={} source=9 dest: 4}, { cond=(AND (NOT p0) (NOT p4) p3), acceptance={} source=9 dest: 5}], [{ cond=(AND (NOT p0) (NOT p4) (NOT p3)), acceptance={} source=10 dest: 4}, { cond=(AND (NOT p0) (NOT p4) p3), acceptance={} source=10 dest: 5}, { cond=(OR (AND (NOT p0) p4) (AND (NOT p0) p3)), acceptance={} source=10 dest: 6}], [{ cond=(AND (NOT p1) (NOT p4) (NOT p3)), acceptance={} source=11 dest: 7}, { cond=(AND (NOT p4) (NOT p3)), acceptance={} source=11 dest: 8}, { cond=(AND p1 (NOT p4) (NOT p3)), acceptance={} source=11 dest: 13}], [{ cond=(AND (NOT p4) (NOT p3)), acceptance={0} source=12 dest: 2}, { cond=(AND (NOT p1) (NOT p4) (NOT p3)), acceptance={} source=12 dest: 7}, { cond=(AND (NOT p4) (NOT p3)), acceptance={} source=12 dest: 8}, { cond=(OR (AND (NOT p1) p4) (AND (NOT p1) p3)), acceptance={} source=12 dest: 10}, { cond=(OR p4 p3), acceptance={} source=12 dest: 12}, { cond=(AND p1 (NOT p4) (NOT p3)), acceptance={} source=12 dest: 13}, { cond=(OR (AND p1 p4) (AND p1 p3)), acceptance={} source=12 dest: 15}, { cond=(AND (NOT p4) p3), acceptance={0} source=12 dest: 16}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=13 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=13 dest: 17}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p4) (NOT p3)), acceptance={} source=14 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p4) p3), acceptance={} source=14 dest: 5}, { cond=(AND p1 (NOT p0) (NOT p4) (NOT p3)), acceptance={} source=14 dest: 17}, { cond=(AND p1 (NOT p0) (NOT p4) p3), acceptance={} source=14 dest: 18}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p4) (NOT p3)), acceptance={} source=15 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p4) p3), acceptance={} source=15 dest: 5}, { cond=(OR (AND (NOT p1) (NOT p0) p4) (AND (NOT p1) (NOT p0) p3)), acceptance={} source=15 dest: 6}, { cond=(AND p1 (NOT p0) (NOT p4) (NOT p3)), acceptance={} source=15 dest: 17}, { cond=(OR (AND p1 (NOT p0) p4) (AND p1 (NOT p0) p3)), acceptance={} source=15 dest: 19}], [{ cond=(AND (NOT p1) (NOT p4) (NOT p3)), acceptance={} source=16 dest: 1}, { cond=(AND (NOT p4) (NOT p3)), acceptance={0} source=16 dest: 2}, { cond=(AND p1 (NOT p4) (NOT p3)), acceptance={} source=16 dest: 3}, { cond=(AND (NOT p1) (NOT p4) p3), acceptance={} source=16 dest: 9}, { cond=(AND (NOT p4) p3), acceptance={} source=16 dest: 11}, { cond=(AND p1 (NOT p4) p3), acceptance={} source=16 dest: 14}, { cond=(AND (NOT p4) p3), acceptance={0} source=16 dest: 16}], [{ cond=(AND (NOT p1) p0), acceptance={} source=17 dest: 4}, { cond=(AND p1 p0), acceptance={} source=17 dest: 17}], [{ cond=(AND (NOT p1) p0 (NOT p4) (NOT p3)), acceptance={} source=18 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p4) p3), acceptance={} source=18 dest: 5}, { cond=(AND p1 p0 (NOT p4) (NOT p3)), acceptance={} source=18 dest: 17}, { cond=(AND p1 p0 (NOT p4) p3), acceptance={} source=18 dest: 18}], [{ cond=(AND (NOT p1) p0 (NOT p4) (NOT p3)), acceptance={} source=19 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p4) p3), acceptance={} source=19 dest: 5}, { cond=(OR (AND (NOT p1) p0 p4) (AND (NOT p1) p0 p3)), acceptance={} source=19 dest: 6}, { cond=(AND p1 p0 (NOT p4) (NOT p3)), acceptance={} source=19 dest: 17}, { cond=(OR (AND p1 p0 p4) (AND p1 p0 p3)), acceptance={} source=19 dest: 19}]], initial=0, aps=[p1:(AND (EQ s3 1) (EQ s15 1) (EQ s124 1)), p0:(AND (EQ s13 1) (EQ s147 1)), p2:(AND (EQ s3 1) (EQ s15 1) (EQ s124 1)), p4:(AND (EQ s0 1) (EQ s6 1) (EQ s12...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, 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, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-04 finished in 1827 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0 U (G(!p0) U (X(F(p2))&&p1))))))'
Support contains 5 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 416/416 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 184 transition count 400
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 184 transition count 400
Applied a total of 8 rules in 9 ms. Remains 184 /188 variables (removed 4) and now considering 400/416 (removed 16) transitions.
[2023-04-07 03:25:17] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2023-04-07 03:25:17] [INFO ] Invariant cache hit.
[2023-04-07 03:25:17] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-04-07 03:25:17] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2023-04-07 03:25:17] [INFO ] Invariant cache hit.
[2023-04-07 03:25:17] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-04-07 03:25:18] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
[2023-04-07 03:25:18] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2023-04-07 03:25:18] [INFO ] Invariant cache hit.
[2023-04-07 03:25:18] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 184/188 places, 400/416 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 522 ms. Remains : 184/188 places, 400/416 transitions.
Stuttering acceptance computed with spot in 269 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), p0, (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2), true]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}, { cond=p1, acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s0 1) (EQ s5 1) (EQ s129 1)), p0:(AND (EQ s0 1) (EQ s5 1) (EQ s129 1)), p2:(AND (EQ s11 1) (EQ s78 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 158 ms.
Product exploration explored 100000 steps with 0 reset in 154 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (NOT p0))), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 146 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter sensitive) to 11 states, 35 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 451 ms :[(OR (NOT p1) (NOT p2) p0), (OR (NOT p1) (NOT p2)), p0, (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2), true, false, false, (AND (NOT p0) p1 (NOT p2)), false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) 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 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) 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 8) 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 8) 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 8) seen :0
Running SMT prover for 8 properties.
[2023-04-07 03:25:19] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2023-04-07 03:25:19] [INFO ] Invariant cache hit.
[2023-04-07 03:25:19] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-04-07 03:25:19] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 2 ms returned sat
[2023-04-07 03:25:20] [INFO ] After 183ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:4
[2023-04-07 03:25:20] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-04-07 03:25:20] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 2 ms returned sat
[2023-04-07 03:25:20] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :4
[2023-04-07 03:25:20] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-04-07 03:25:20] [INFO ] After 72ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :4 sat :4
[2023-04-07 03:25:20] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 0 ms to minimize.
[2023-04-07 03:25:20] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-04-07 03:25:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 139 ms
[2023-04-07 03:25:20] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2023-04-07 03:25:20] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2023-04-07 03:25:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 139 ms
[2023-04-07 03:25:20] [INFO ] After 421ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :4
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-04-07 03:25:20] [INFO ] After 639ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :4
Fused 8 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 12 ms.
Support contains 5 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 400/400 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 184 transition count 396
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 180 transition count 396
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 8 place count 180 transition count 345
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 110 place count 129 transition count 345
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 134 place count 117 transition count 333
Applied a total of 134 rules in 14 ms. Remains 117 /184 variables (removed 67) and now considering 333/400 (removed 67) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 117/184 places, 333/400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) 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 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) 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 4) seen :0
Finished probabilistic random walk after 286415 steps, run visited all 4 properties in 1331 ms. (steps per millisecond=215 )
Probabilistic random walk after 286415 steps, saw 59455 distinct states, run finished after 1334 ms. (steps per millisecond=214 ) properties seen :4
Parikh walk visited 0 properties in 0 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (NOT p0))), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (G (NOT (AND p0 (NOT p1)))), (G (NOT (AND (NOT p0) p1 p2))), (G (NOT (AND (NOT p0) p1 (NOT p2)))), (G (NOT (AND p0 p1 p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (AND p1 (NOT p2))), (F p0), (F p2)]
Property proved to be false thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 32 ms. Reduced automaton from 11 states, 35 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-04-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-05 finished in 4633 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)))'
Support contains 2 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 416/416 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 184 transition count 400
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 184 transition count 400
Applied a total of 8 rules in 6 ms. Remains 184 /188 variables (removed 4) and now considering 400/416 (removed 16) transitions.
[2023-04-07 03:25:22] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2023-04-07 03:25:22] [INFO ] Invariant cache hit.
[2023-04-07 03:25:22] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-04-07 03:25:22] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2023-04-07 03:25:22] [INFO ] Invariant cache hit.
[2023-04-07 03:25:22] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-04-07 03:25:22] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
[2023-04-07 03:25:22] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2023-04-07 03:25:22] [INFO ] Invariant cache hit.
[2023-04-07 03:25:22] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 184/188 places, 400/416 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 550 ms. Remains : 184/188 places, 400/416 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s13 1) (EQ s87 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][false, false]]
Product exploration explored 100000 steps with 1 reset in 134 ms.
Stack based approach found an accepted trace after 35 steps with 0 reset with depth 36 and stack size 36 in 0 ms.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-06 finished in 771 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 4 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 416/416 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 188 transition count 412
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 184 transition count 412
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 8 place count 184 transition count 361
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 110 place count 133 transition count 361
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 114 place count 129 transition count 345
Iterating global reduction 2 with 4 rules applied. Total rules applied 118 place count 129 transition count 345
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 142 place count 117 transition count 333
Applied a total of 142 rules in 20 ms. Remains 117 /188 variables (removed 71) and now considering 333/416 (removed 83) transitions.
[2023-04-07 03:25:23] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
// Phase 1: matrix 169 rows 117 cols
[2023-04-07 03:25:23] [INFO ] Computed 13 invariants in 2 ms
[2023-04-07 03:25:23] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-04-07 03:25:23] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
[2023-04-07 03:25:23] [INFO ] Invariant cache hit.
[2023-04-07 03:25:23] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-04-07 03:25:23] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
[2023-04-07 03:25:23] [INFO ] Redundant transitions in 3 ms returned []
[2023-04-07 03:25:23] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
[2023-04-07 03:25:23] [INFO ] Invariant cache hit.
[2023-04-07 03:25:23] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 117/188 places, 333/416 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 509 ms. Remains : 117/188 places, 333/416 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s1 1) (EQ s84 1)), p1:(AND (EQ s6 1) (EQ s89 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 134 ms.
Stack based approach found an accepted trace after 32 steps with 0 reset with depth 33 and stack size 33 in 1 ms.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-07 finished in 770 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 U p1)&&(p1 U p2))))'
Support contains 6 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 416/416 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 188 transition count 412
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 184 transition count 412
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 8 place count 184 transition count 360
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 112 place count 132 transition count 360
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 114 place count 130 transition count 352
Iterating global reduction 2 with 2 rules applied. Total rules applied 116 place count 130 transition count 352
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 140 place count 118 transition count 340
Applied a total of 140 rules in 24 ms. Remains 118 /188 variables (removed 70) and now considering 340/416 (removed 76) transitions.
[2023-04-07 03:25:23] [INFO ] Flow matrix only has 176 transitions (discarded 164 similar events)
// Phase 1: matrix 176 rows 118 cols
[2023-04-07 03:25:23] [INFO ] Computed 13 invariants in 1 ms
[2023-04-07 03:25:23] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-04-07 03:25:23] [INFO ] Flow matrix only has 176 transitions (discarded 164 similar events)
[2023-04-07 03:25:23] [INFO ] Invariant cache hit.
[2023-04-07 03:25:24] [INFO ] State equation strengthened by 82 read => feed constraints.
[2023-04-07 03:25:24] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2023-04-07 03:25:24] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 03:25:24] [INFO ] Flow matrix only has 176 transitions (discarded 164 similar events)
[2023-04-07 03:25:24] [INFO ] Invariant cache hit.
[2023-04-07 03:25:24] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 118/188 places, 340/416 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 506 ms. Remains : 118/188 places, 340/416 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p2), (NOT p1), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2))), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(AND (EQ s1 1) (EQ s21 1)), p2:(AND (EQ s0 1) (EQ s41 1)), p0:(AND (EQ s10 1) (EQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 147 ms.
Stack based approach found an accepted trace after 14 steps with 0 reset with depth 15 and stack size 15 in 0 ms.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-08 finished in 794 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((X(p0) U (!p1&&F(p2)))))'
Support contains 5 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 416/416 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 185 transition count 404
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 185 transition count 404
Applied a total of 6 rules in 7 ms. Remains 185 /188 variables (removed 3) and now considering 404/416 (removed 12) transitions.
[2023-04-07 03:25:24] [INFO ] Flow matrix only has 240 transitions (discarded 164 similar events)
// Phase 1: matrix 240 rows 185 cols
[2023-04-07 03:25:24] [INFO ] Computed 13 invariants in 1 ms
[2023-04-07 03:25:24] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-04-07 03:25:24] [INFO ] Flow matrix only has 240 transitions (discarded 164 similar events)
[2023-04-07 03:25:24] [INFO ] Invariant cache hit.
[2023-04-07 03:25:24] [INFO ] State equation strengthened by 79 read => feed constraints.
[2023-04-07 03:25:25] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
[2023-04-07 03:25:25] [INFO ] Flow matrix only has 240 transitions (discarded 164 similar events)
[2023-04-07 03:25:25] [INFO ] Invariant cache hit.
[2023-04-07 03:25:25] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 185/188 places, 404/416 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 546 ms. Remains : 185/188 places, 404/416 transitions.
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p2) p1), (OR (NOT p0) (NOT p2) p1), (NOT p2), true]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=1 dest: 2}, { cond=(NOT p0), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s11 1) (EQ s92 1)), p2:(OR (AND (EQ s2 1) (EQ s11 1) (EQ s136 1)) (AND (EQ s2 1) (EQ s52 1))), p0:(AND (EQ s2 1) (EQ s11 1) (EQ s136 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 126 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 1 ms.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-09 finished in 865 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 1 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 416/416 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 188 transition count 412
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 184 transition count 412
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 8 place count 184 transition count 361
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 110 place count 133 transition count 361
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 114 place count 129 transition count 345
Iterating global reduction 2 with 4 rules applied. Total rules applied 118 place count 129 transition count 345
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 142 place count 117 transition count 333
Applied a total of 142 rules in 18 ms. Remains 117 /188 variables (removed 71) and now considering 333/416 (removed 83) transitions.
[2023-04-07 03:25:25] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
// Phase 1: matrix 169 rows 117 cols
[2023-04-07 03:25:25] [INFO ] Computed 13 invariants in 1 ms
[2023-04-07 03:25:25] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-04-07 03:25:25] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
[2023-04-07 03:25:25] [INFO ] Invariant cache hit.
[2023-04-07 03:25:25] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-04-07 03:25:25] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
[2023-04-07 03:25:25] [INFO ] Redundant transitions in 2 ms returned []
[2023-04-07 03:25:25] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
[2023-04-07 03:25:25] [INFO ] Invariant cache hit.
[2023-04-07 03:25:25] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 117/188 places, 333/416 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 471 ms. Remains : 117/188 places, 333/416 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s48 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 0 reset in 129 ms.
Stack based approach found an accepted trace after 14 steps with 0 reset with depth 15 and stack size 15 in 0 ms.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-10 finished in 656 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||X(p1)))) U G(!p2)))'
Support contains 5 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 416/416 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 184 transition count 400
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 184 transition count 400
Applied a total of 8 rules in 3 ms. Remains 184 /188 variables (removed 4) and now considering 400/416 (removed 16) transitions.
[2023-04-07 03:25:26] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
// Phase 1: matrix 236 rows 184 cols
[2023-04-07 03:25:26] [INFO ] Computed 13 invariants in 2 ms
[2023-04-07 03:25:26] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-04-07 03:25:26] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2023-04-07 03:25:26] [INFO ] Invariant cache hit.
[2023-04-07 03:25:26] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-04-07 03:25:26] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
[2023-04-07 03:25:26] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2023-04-07 03:25:26] [INFO ] Invariant cache hit.
[2023-04-07 03:25:26] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 184/188 places, 400/416 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 574 ms. Remains : 184/188 places, 400/416 transitions.
Stuttering acceptance computed with spot in 253 ms :[p2, (AND (NOT p0) (NOT p1)), (AND (NOT p1) p2 (NOT p0)), (NOT p1), true, (AND p2 (NOT p1)), p2]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=p2, acceptance={0} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=p2, acceptance={} source=6 dest: 4}, { cond=(NOT p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(AND (EQ s9 1) (EQ s17 1)), p0:(AND (EQ s9 1) (EQ s153 1)), p1:(AND (EQ s15 1) (EQ s48 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 25380 steps with 0 reset in 37 ms.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-13 finished in 891 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)||X(F(p1))))'
Support contains 3 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 416/416 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 184 transition count 400
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 184 transition count 400
Applied a total of 8 rules in 4 ms. Remains 184 /188 variables (removed 4) and now considering 400/416 (removed 16) transitions.
[2023-04-07 03:25:27] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2023-04-07 03:25:27] [INFO ] Invariant cache hit.
[2023-04-07 03:25:27] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-04-07 03:25:27] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2023-04-07 03:25:27] [INFO ] Invariant cache hit.
[2023-04-07 03:25:27] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-04-07 03:25:27] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
[2023-04-07 03:25:27] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2023-04-07 03:25:27] [INFO ] Invariant cache hit.
[2023-04-07 03:25:27] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 184/188 places, 400/416 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 554 ms. Remains : 184/188 places, 400/416 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s2 0) (EQ s137 0)), p0:(EQ s57 0)], 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 50000 reset in 278 ms.
Product exploration explored 100000 steps with 50000 reset in 259 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 19 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-04-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-14 finished in 1241 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)))'
[2023-04-07 03:25:28] [INFO ] Flatten gal took : 24 ms
[2023-04-07 03:25:28] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-04-07 03:25:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 188 places, 416 transitions and 1824 arcs took 3 ms.
Total runtime 41504 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1298/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : EisenbergMcGuire-PT-04-LTLFireability-03

BK_STOP 1680837929829

--------------------
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 EisenbergMcGuire-PT-04-LTLFireability-03
ltl formula formula --ltl=/tmp/1298/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 188 places, 416 transitions and 1824 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.130 real 0.010 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1298/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1298/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1298/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1298/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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="EisenbergMcGuire-PT-04"
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 EisenbergMcGuire-PT-04, 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-167987246400228"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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