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.r295-tall-167873948300724.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 lolaxred
Input is PolyORBNT-PT-S05J30, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r295-tall-167873948300724
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 15K Feb 25 23:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 23:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 62K Feb 25 23:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 274K Feb 25 23:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 18K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 26K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 33K Feb 25 23:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 216K Feb 25 23:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 30K Feb 25 23:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 126K Feb 25 23:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.7K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.2M Mar 5 18:23 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 PolyORBNT-PT-S05J30-LTLFireability-00
FORMULA_NAME PolyORBNT-PT-S05J30-LTLFireability-01
FORMULA_NAME PolyORBNT-PT-S05J30-LTLFireability-02
FORMULA_NAME PolyORBNT-PT-S05J30-LTLFireability-03
FORMULA_NAME PolyORBNT-PT-S05J30-LTLFireability-04
FORMULA_NAME PolyORBNT-PT-S05J30-LTLFireability-05
FORMULA_NAME PolyORBNT-PT-S05J30-LTLFireability-06
FORMULA_NAME PolyORBNT-PT-S05J30-LTLFireability-07
FORMULA_NAME PolyORBNT-PT-S05J30-LTLFireability-08
FORMULA_NAME PolyORBNT-PT-S05J30-LTLFireability-09
FORMULA_NAME PolyORBNT-PT-S05J30-LTLFireability-10
FORMULA_NAME PolyORBNT-PT-S05J30-LTLFireability-11
FORMULA_NAME PolyORBNT-PT-S05J30-LTLFireability-12
FORMULA_NAME PolyORBNT-PT-S05J30-LTLFireability-13
FORMULA_NAME PolyORBNT-PT-S05J30-LTLFireability-14
FORMULA_NAME PolyORBNT-PT-S05J30-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678894983895

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S05J30
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-15 15:43:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-15 15:43:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 15:43:05] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2023-03-15 15:43:05] [INFO ] Transformed 489 places.
[2023-03-15 15:43:05] [INFO ] Transformed 1400 transitions.
[2023-03-15 15:43:05] [INFO ] Parsed PT model containing 489 places and 1400 transitions and 9764 arcs in 189 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
[2023-03-15 15:43:05] [INFO ] Reduced 90 identical enabling conditions.
[2023-03-15 15:43:05] [INFO ] Reduced 90 identical enabling conditions.
[2023-03-15 15:43:05] [INFO ] Reduced 555 identical enabling conditions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
FORMULA PolyORBNT-PT-S05J30-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J30-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 281 out of 489 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 745/745 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 484 transition count 745
Applied a total of 5 rules in 38 ms. Remains 484 /489 variables (removed 5) and now considering 745/745 (removed 0) transitions.
[2023-03-15 15:43:05] [INFO ] Flow matrix only has 741 transitions (discarded 4 similar events)
// Phase 1: matrix 741 rows 484 cols
[2023-03-15 15:43:05] [INFO ] Computed 77 place invariants in 48 ms
[2023-03-15 15:43:06] [INFO ] Dead Transitions using invariants and state equation in 867 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
[2023-03-15 15:43:06] [INFO ] Flow matrix only has 646 transitions (discarded 4 similar events)
// Phase 1: matrix 646 rows 484 cols
[2023-03-15 15:43:06] [INFO ] Computed 77 place invariants in 20 ms
[2023-03-15 15:43:07] [INFO ] Implicit Places using invariants in 337 ms returned []
[2023-03-15 15:43:07] [INFO ] Flow matrix only has 646 transitions (discarded 4 similar events)
[2023-03-15 15:43:07] [INFO ] Invariant cache hit.
[2023-03-15 15:43:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 15:43:10] [INFO ] Implicit Places using invariants and state equation in 3216 ms returned []
Implicit Place search using SMT with State Equation took 3554 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 484/489 places, 650/745 transitions.
Applied a total of 0 rules in 20 ms. Remains 484 /484 variables (removed 0) and now considering 650/650 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4503 ms. Remains : 484/489 places, 650/745 transitions.
Support contains 281 out of 484 places after structural reductions.
[2023-03-15 15:43:10] [INFO ] Flatten gal took : 84 ms
[2023-03-15 15:43:10] [INFO ] Flatten gal took : 58 ms
[2023-03-15 15:43:10] [INFO ] Input system was already deterministic with 650 transitions.
Incomplete random walk after 10000 steps, including 671 resets, run finished after 379 ms. (steps per millisecond=26 ) properties (out of 25) seen :18
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 177 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 161 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-15 15:43:11] [INFO ] Flow matrix only has 646 transitions (discarded 4 similar events)
[2023-03-15 15:43:11] [INFO ] Invariant cache hit.
[2023-03-15 15:43:11] [INFO ] [Real]Absence check using 59 positive place invariants in 9 ms returned sat
[2023-03-15 15:43:11] [INFO ] [Real]Absence check using 59 positive and 18 generalized place invariants in 16 ms returned sat
[2023-03-15 15:43:11] [INFO ] After 163ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:1
[2023-03-15 15:43:11] [INFO ] [Nat]Absence check using 59 positive place invariants in 18 ms returned sat
[2023-03-15 15:43:11] [INFO ] [Nat]Absence check using 59 positive and 18 generalized place invariants in 15 ms returned sat
[2023-03-15 15:43:12] [INFO ] After 420ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :1
[2023-03-15 15:43:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 15:43:12] [INFO ] After 52ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :3 sat :1
[2023-03-15 15:43:12] [INFO ] Deduced a trap composed of 213 places in 161 ms of which 3 ms to minimize.
[2023-03-15 15:43:12] [INFO ] Deduced a trap composed of 200 places in 186 ms of which 1 ms to minimize.
[2023-03-15 15:43:12] [INFO ] Deduced a trap composed of 205 places in 156 ms of which 1 ms to minimize.
[2023-03-15 15:43:13] [INFO ] Deduced a trap composed of 199 places in 146 ms of which 1 ms to minimize.
[2023-03-15 15:43:13] [INFO ] Deduced a trap composed of 212 places in 169 ms of which 2 ms to minimize.
[2023-03-15 15:43:13] [INFO ] Deduced a trap composed of 222 places in 154 ms of which 0 ms to minimize.
[2023-03-15 15:43:14] [INFO ] Deduced a trap composed of 206 places in 165 ms of which 0 ms to minimize.
[2023-03-15 15:43:14] [INFO ] Deduced a trap composed of 198 places in 139 ms of which 2 ms to minimize.
[2023-03-15 15:43:14] [INFO ] Deduced a trap composed of 191 places in 156 ms of which 1 ms to minimize.
[2023-03-15 15:43:14] [INFO ] Deduced a trap composed of 221 places in 130 ms of which 1 ms to minimize.
[2023-03-15 15:43:14] [INFO ] Deduced a trap composed of 203 places in 146 ms of which 0 ms to minimize.
[2023-03-15 15:43:15] [INFO ] Deduced a trap composed of 217 places in 153 ms of which 1 ms to minimize.
[2023-03-15 15:43:15] [INFO ] Deduced a trap composed of 210 places in 148 ms of which 1 ms to minimize.
[2023-03-15 15:43:15] [INFO ] Deduced a trap composed of 194 places in 151 ms of which 0 ms to minimize.
[2023-03-15 15:43:15] [INFO ] Deduced a trap composed of 216 places in 139 ms of which 0 ms to minimize.
[2023-03-15 15:43:15] [INFO ] Deduced a trap composed of 209 places in 151 ms of which 0 ms to minimize.
[2023-03-15 15:43:15] [INFO ] Deduced a trap composed of 194 places in 144 ms of which 0 ms to minimize.
[2023-03-15 15:43:16] [INFO ] Deduced a trap composed of 201 places in 145 ms of which 1 ms to minimize.
[2023-03-15 15:43:16] [INFO ] Deduced a trap composed of 195 places in 150 ms of which 0 ms to minimize.
[2023-03-15 15:43:16] [INFO ] Deduced a trap composed of 197 places in 145 ms of which 1 ms to minimize.
[2023-03-15 15:43:16] [INFO ] Deduced a trap composed of 191 places in 152 ms of which 1 ms to minimize.
[2023-03-15 15:43:17] [INFO ] Deduced a trap composed of 195 places in 147 ms of which 1 ms to minimize.
[2023-03-15 15:43:17] [INFO ] Deduced a trap composed of 215 places in 146 ms of which 0 ms to minimize.
[2023-03-15 15:43:17] [INFO ] Deduced a trap composed of 190 places in 143 ms of which 0 ms to minimize.
[2023-03-15 15:43:17] [INFO ] Deduced a trap composed of 207 places in 145 ms of which 0 ms to minimize.
[2023-03-15 15:43:17] [INFO ] Deduced a trap composed of 204 places in 144 ms of which 1 ms to minimize.
[2023-03-15 15:43:18] [INFO ] Deduced a trap composed of 203 places in 147 ms of which 1 ms to minimize.
[2023-03-15 15:43:18] [INFO ] Deduced a trap composed of 201 places in 145 ms of which 0 ms to minimize.
[2023-03-15 15:43:18] [INFO ] Deduced a trap composed of 203 places in 156 ms of which 0 ms to minimize.
[2023-03-15 15:43:18] [INFO ] Deduced a trap composed of 213 places in 148 ms of which 0 ms to minimize.
[2023-03-15 15:43:19] [INFO ] Deduced a trap composed of 213 places in 143 ms of which 1 ms to minimize.
[2023-03-15 15:43:19] [INFO ] Deduced a trap composed of 213 places in 145 ms of which 0 ms to minimize.
[2023-03-15 15:43:19] [INFO ] Deduced a trap composed of 192 places in 147 ms of which 0 ms to minimize.
[2023-03-15 15:43:20] [INFO ] Deduced a trap composed of 201 places in 150 ms of which 1 ms to minimize.
[2023-03-15 15:43:20] [INFO ] Deduced a trap composed of 206 places in 140 ms of which 1 ms to minimize.
[2023-03-15 15:43:20] [INFO ] Deduced a trap composed of 208 places in 136 ms of which 0 ms to minimize.
[2023-03-15 15:43:20] [INFO ] Deduced a trap composed of 192 places in 133 ms of which 1 ms to minimize.
[2023-03-15 15:43:20] [INFO ] Deduced a trap composed of 213 places in 134 ms of which 0 ms to minimize.
[2023-03-15 15:43:21] [INFO ] Deduced a trap composed of 201 places in 142 ms of which 1 ms to minimize.
[2023-03-15 15:43:30] [INFO ] Trap strengthening (SAT) tested/added 39/39 trap constraints in 18098 ms
[2023-03-15 15:43:30] [INFO ] After 18200ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :0
[2023-03-15 15:43:30] [INFO ] After 18737ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 484 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 484/484 places, 650/650 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 484 transition count 614
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 448 transition count 614
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 72 place count 448 transition count 579
Deduced a syphon composed of 35 places in 9 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 142 place count 413 transition count 579
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 143 place count 412 transition count 578
Iterating global reduction 2 with 1 rules applied. Total rules applied 144 place count 412 transition count 578
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 148 place count 410 transition count 576
Applied a total of 148 rules in 135 ms. Remains 410 /484 variables (removed 74) and now considering 576/650 (removed 74) transitions.
[2023-03-15 15:43:30] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
// Phase 1: matrix 572 rows 410 cols
[2023-03-15 15:43:30] [INFO ] Computed 77 place invariants in 10 ms
[2023-03-15 15:43:30] [INFO ] Dead Transitions using invariants and state equation in 396 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 532 ms. Remains : 410/484 places, 576/650 transitions.
Incomplete random walk after 10000 steps, including 527 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 331575 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :{}
Probabilistic random walk after 331575 steps, saw 99044 distinct states, run finished after 3003 ms. (steps per millisecond=110 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 15:43:34] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2023-03-15 15:43:34] [INFO ] Invariant cache hit.
[2023-03-15 15:43:34] [INFO ] [Real]Absence check using 58 positive place invariants in 15 ms returned sat
[2023-03-15 15:43:34] [INFO ] [Real]Absence check using 58 positive and 19 generalized place invariants in 19 ms returned sat
[2023-03-15 15:43:34] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 15:43:34] [INFO ] [Nat]Absence check using 58 positive place invariants in 9 ms returned sat
[2023-03-15 15:43:34] [INFO ] [Nat]Absence check using 58 positive and 19 generalized place invariants in 22 ms returned sat
[2023-03-15 15:43:34] [INFO ] After 233ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 15:43:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 15:43:34] [INFO ] After 23ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 15:43:34] [INFO ] Deduced a trap composed of 131 places in 119 ms of which 1 ms to minimize.
[2023-03-15 15:43:34] [INFO ] Deduced a trap composed of 140 places in 114 ms of which 0 ms to minimize.
[2023-03-15 15:43:34] [INFO ] Deduced a trap composed of 119 places in 117 ms of which 1 ms to minimize.
[2023-03-15 15:43:35] [INFO ] Deduced a trap composed of 128 places in 112 ms of which 0 ms to minimize.
[2023-03-15 15:43:35] [INFO ] Deduced a trap composed of 128 places in 118 ms of which 1 ms to minimize.
[2023-03-15 15:43:35] [INFO ] Deduced a trap composed of 116 places in 120 ms of which 0 ms to minimize.
[2023-03-15 15:43:35] [INFO ] Deduced a trap composed of 130 places in 119 ms of which 0 ms to minimize.
[2023-03-15 15:43:35] [INFO ] Deduced a trap composed of 120 places in 114 ms of which 1 ms to minimize.
[2023-03-15 15:43:35] [INFO ] Deduced a trap composed of 138 places in 118 ms of which 1 ms to minimize.
[2023-03-15 15:43:36] [INFO ] Deduced a trap composed of 137 places in 109 ms of which 1 ms to minimize.
[2023-03-15 15:43:36] [INFO ] Deduced a trap composed of 134 places in 114 ms of which 0 ms to minimize.
[2023-03-15 15:43:36] [INFO ] Deduced a trap composed of 135 places in 111 ms of which 2 ms to minimize.
[2023-03-15 15:43:36] [INFO ] Deduced a trap composed of 125 places in 121 ms of which 1 ms to minimize.
[2023-03-15 15:43:36] [INFO ] Deduced a trap composed of 137 places in 114 ms of which 1 ms to minimize.
[2023-03-15 15:43:37] [INFO ] Deduced a trap composed of 125 places in 117 ms of which 0 ms to minimize.
[2023-03-15 15:43:37] [INFO ] Deduced a trap composed of 131 places in 121 ms of which 0 ms to minimize.
[2023-03-15 15:43:37] [INFO ] Deduced a trap composed of 125 places in 118 ms of which 1 ms to minimize.
[2023-03-15 15:43:37] [INFO ] Deduced a trap composed of 128 places in 116 ms of which 3 ms to minimize.
[2023-03-15 15:43:37] [INFO ] Deduced a trap composed of 128 places in 119 ms of which 0 ms to minimize.
[2023-03-15 15:43:38] [INFO ] Deduced a trap composed of 134 places in 118 ms of which 1 ms to minimize.
[2023-03-15 15:43:38] [INFO ] Deduced a trap composed of 143 places in 124 ms of which 1 ms to minimize.
[2023-03-15 15:43:38] [INFO ] Deduced a trap composed of 145 places in 120 ms of which 1 ms to minimize.
[2023-03-15 15:43:38] [INFO ] Deduced a trap composed of 131 places in 111 ms of which 0 ms to minimize.
[2023-03-15 15:43:38] [INFO ] Deduced a trap composed of 134 places in 110 ms of which 0 ms to minimize.
[2023-03-15 15:43:38] [INFO ] Deduced a trap composed of 120 places in 116 ms of which 1 ms to minimize.
[2023-03-15 15:43:38] [INFO ] Deduced a trap composed of 135 places in 119 ms of which 1 ms to minimize.
[2023-03-15 15:43:39] [INFO ] Deduced a trap composed of 128 places in 109 ms of which 0 ms to minimize.
[2023-03-15 15:43:39] [INFO ] Deduced a trap composed of 134 places in 117 ms of which 1 ms to minimize.
[2023-03-15 15:43:39] [INFO ] Deduced a trap composed of 121 places in 125 ms of which 9 ms to minimize.
[2023-03-15 15:43:39] [INFO ] Deduced a trap composed of 119 places in 123 ms of which 0 ms to minimize.
[2023-03-15 15:43:39] [INFO ] Deduced a trap composed of 131 places in 120 ms of which 0 ms to minimize.
[2023-03-15 15:43:40] [INFO ] Deduced a trap composed of 128 places in 114 ms of which 0 ms to minimize.
[2023-03-15 15:43:40] [INFO ] Deduced a trap composed of 135 places in 119 ms of which 1 ms to minimize.
[2023-03-15 15:43:40] [INFO ] Deduced a trap composed of 131 places in 112 ms of which 1 ms to minimize.
[2023-03-15 15:43:40] [INFO ] Deduced a trap composed of 130 places in 118 ms of which 0 ms to minimize.
[2023-03-15 15:43:40] [INFO ] Deduced a trap composed of 128 places in 121 ms of which 0 ms to minimize.
[2023-03-15 15:43:40] [INFO ] Deduced a trap composed of 138 places in 120 ms of which 1 ms to minimize.
[2023-03-15 15:43:41] [INFO ] Deduced a trap composed of 126 places in 120 ms of which 0 ms to minimize.
[2023-03-15 15:43:41] [INFO ] Deduced a trap composed of 124 places in 121 ms of which 0 ms to minimize.
[2023-03-15 15:43:41] [INFO ] Deduced a trap composed of 128 places in 119 ms of which 0 ms to minimize.
[2023-03-15 15:43:41] [INFO ] Deduced a trap composed of 148 places in 119 ms of which 0 ms to minimize.
[2023-03-15 15:43:42] [INFO ] Deduced a trap composed of 119 places in 120 ms of which 1 ms to minimize.
[2023-03-15 15:43:42] [INFO ] Deduced a trap composed of 122 places in 120 ms of which 0 ms to minimize.
[2023-03-15 15:43:48] [INFO ] Deduced a trap composed of 138 places in 126 ms of which 1 ms to minimize.
[2023-03-15 15:43:53] [INFO ] Deduced a trap composed of 134 places in 116 ms of which 1 ms to minimize.
[2023-03-15 15:43:59] [INFO ] Trap strengthening (SAT) tested/added 45/45 trap constraints in 24642 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 15:43:59] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 15:43:59] [INFO ] After 25018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 576/576 transitions.
Applied a total of 0 rules in 26 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 410/410 places, 576/576 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 576/576 transitions.
Applied a total of 0 rules in 19 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
[2023-03-15 15:43:59] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2023-03-15 15:43:59] [INFO ] Invariant cache hit.
[2023-03-15 15:43:59] [INFO ] Implicit Places using invariants in 483 ms returned []
[2023-03-15 15:43:59] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2023-03-15 15:43:59] [INFO ] Invariant cache hit.
[2023-03-15 15:44:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 15:44:04] [INFO ] Implicit Places using invariants and state equation in 5204 ms returned []
Implicit Place search using SMT with State Equation took 5689 ms to find 0 implicit places.
[2023-03-15 15:44:05] [INFO ] Redundant transitions in 42 ms returned []
[2023-03-15 15:44:05] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2023-03-15 15:44:05] [INFO ] Invariant cache hit.
[2023-03-15 15:44:05] [INFO ] Dead Transitions using invariants and state equation in 375 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6141 ms. Remains : 410/410 places, 576/576 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 410 transition count 572
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 410 transition count 571
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 409 transition count 571
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 409 transition count 570
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 408 transition count 570
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 408 transition count 565
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 403 transition count 565
Applied a total of 18 rules in 69 ms. Remains 403 /410 variables (removed 7) and now considering 565/576 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 565 rows 403 cols
[2023-03-15 15:44:05] [INFO ] Computed 77 place invariants in 14 ms
[2023-03-15 15:44:05] [INFO ] [Real]Absence check using 59 positive place invariants in 9 ms returned sat
[2023-03-15 15:44:05] [INFO ] [Real]Absence check using 59 positive and 18 generalized place invariants in 17 ms returned sat
[2023-03-15 15:44:05] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 15:44:05] [INFO ] [Nat]Absence check using 59 positive place invariants in 9 ms returned sat
[2023-03-15 15:44:05] [INFO ] [Nat]Absence check using 59 positive and 18 generalized place invariants in 19 ms returned sat
[2023-03-15 15:44:06] [INFO ] After 440ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 15:44:06] [INFO ] Deduced a trap composed of 137 places in 125 ms of which 0 ms to minimize.
[2023-03-15 15:44:06] [INFO ] Deduced a trap composed of 134 places in 109 ms of which 1 ms to minimize.
[2023-03-15 15:44:06] [INFO ] Deduced a trap composed of 111 places in 111 ms of which 0 ms to minimize.
[2023-03-15 15:44:06] [INFO ] Deduced a trap composed of 134 places in 108 ms of which 0 ms to minimize.
[2023-03-15 15:44:06] [INFO ] Deduced a trap composed of 126 places in 106 ms of which 0 ms to minimize.
[2023-03-15 15:44:06] [INFO ] Deduced a trap composed of 136 places in 109 ms of which 0 ms to minimize.
[2023-03-15 15:44:07] [INFO ] Deduced a trap composed of 120 places in 106 ms of which 1 ms to minimize.
[2023-03-15 15:44:07] [INFO ] Deduced a trap composed of 123 places in 107 ms of which 1 ms to minimize.
[2023-03-15 15:44:07] [INFO ] Deduced a trap composed of 126 places in 107 ms of which 0 ms to minimize.
[2023-03-15 15:44:07] [INFO ] Deduced a trap composed of 111 places in 106 ms of which 1 ms to minimize.
[2023-03-15 15:44:07] [INFO ] Deduced a trap composed of 114 places in 107 ms of which 1 ms to minimize.
[2023-03-15 15:44:07] [INFO ] Deduced a trap composed of 141 places in 112 ms of which 1 ms to minimize.
[2023-03-15 15:44:07] [INFO ] Deduced a trap composed of 126 places in 113 ms of which 1 ms to minimize.
[2023-03-15 15:44:08] [INFO ] Deduced a trap composed of 128 places in 109 ms of which 1 ms to minimize.
[2023-03-15 15:44:08] [INFO ] Deduced a trap composed of 139 places in 110 ms of which 0 ms to minimize.
[2023-03-15 15:44:08] [INFO ] Deduced a trap composed of 126 places in 117 ms of which 1 ms to minimize.
[2023-03-15 15:44:08] [INFO ] Deduced a trap composed of 132 places in 120 ms of which 0 ms to minimize.
[2023-03-15 15:44:08] [INFO ] Deduced a trap composed of 133 places in 113 ms of which 1 ms to minimize.
[2023-03-15 15:44:09] [INFO ] Deduced a trap composed of 120 places in 116 ms of which 1 ms to minimize.
[2023-03-15 15:44:09] [INFO ] Deduced a trap composed of 134 places in 109 ms of which 0 ms to minimize.
[2023-03-15 15:44:09] [INFO ] Deduced a trap composed of 122 places in 109 ms of which 1 ms to minimize.
[2023-03-15 15:44:09] [INFO ] Deduced a trap composed of 136 places in 115 ms of which 0 ms to minimize.
[2023-03-15 15:44:10] [INFO ] Deduced a trap composed of 145 places in 112 ms of which 0 ms to minimize.
[2023-03-15 15:44:10] [INFO ] Deduced a trap composed of 122 places in 107 ms of which 1 ms to minimize.
[2023-03-15 15:44:10] [INFO ] Deduced a trap composed of 118 places in 108 ms of which 0 ms to minimize.
[2023-03-15 15:44:10] [INFO ] Deduced a trap composed of 116 places in 109 ms of which 0 ms to minimize.
[2023-03-15 15:44:10] [INFO ] Deduced a trap composed of 124 places in 105 ms of which 0 ms to minimize.
[2023-03-15 15:44:10] [INFO ] Deduced a trap composed of 144 places in 106 ms of which 0 ms to minimize.
[2023-03-15 15:44:11] [INFO ] Deduced a trap composed of 142 places in 109 ms of which 0 ms to minimize.
[2023-03-15 15:44:11] [INFO ] Deduced a trap composed of 116 places in 124 ms of which 0 ms to minimize.
[2023-03-15 15:44:11] [INFO ] Deduced a trap composed of 132 places in 119 ms of which 1 ms to minimize.
[2023-03-15 15:44:11] [INFO ] Deduced a trap composed of 138 places in 108 ms of which 0 ms to minimize.
[2023-03-15 15:44:11] [INFO ] Deduced a trap composed of 126 places in 114 ms of which 0 ms to minimize.
[2023-03-15 15:44:11] [INFO ] Deduced a trap composed of 135 places in 113 ms of which 0 ms to minimize.
[2023-03-15 15:44:12] [INFO ] Deduced a trap composed of 126 places in 119 ms of which 1 ms to minimize.
[2023-03-15 15:44:12] [INFO ] Deduced a trap composed of 117 places in 116 ms of which 0 ms to minimize.
[2023-03-15 15:44:12] [INFO ] Deduced a trap composed of 117 places in 122 ms of which 1 ms to minimize.
[2023-03-15 15:44:12] [INFO ] Deduced a trap composed of 129 places in 122 ms of which 0 ms to minimize.
[2023-03-15 15:44:12] [INFO ] Deduced a trap composed of 117 places in 122 ms of which 1 ms to minimize.
[2023-03-15 15:44:12] [INFO ] Deduced a trap composed of 132 places in 126 ms of which 0 ms to minimize.
[2023-03-15 15:44:12] [INFO ] Deduced a trap composed of 120 places in 124 ms of which 1 ms to minimize.
[2023-03-15 15:44:13] [INFO ] Deduced a trap composed of 126 places in 119 ms of which 1 ms to minimize.
[2023-03-15 15:44:13] [INFO ] Deduced a trap composed of 123 places in 115 ms of which 0 ms to minimize.
[2023-03-15 15:44:13] [INFO ] Deduced a trap composed of 144 places in 115 ms of which 1 ms to minimize.
[2023-03-15 15:44:13] [INFO ] Deduced a trap composed of 120 places in 112 ms of which 0 ms to minimize.
[2023-03-15 15:44:13] [INFO ] Deduced a trap composed of 120 places in 111 ms of which 0 ms to minimize.
[2023-03-15 15:44:14] [INFO ] Deduced a trap composed of 114 places in 119 ms of which 0 ms to minimize.
[2023-03-15 15:44:14] [INFO ] Deduced a trap composed of 129 places in 109 ms of which 0 ms to minimize.
[2023-03-15 15:44:14] [INFO ] Deduced a trap composed of 120 places in 109 ms of which 1 ms to minimize.
[2023-03-15 15:44:14] [INFO ] Deduced a trap composed of 123 places in 115 ms of which 0 ms to minimize.
[2023-03-15 15:44:14] [INFO ] Deduced a trap composed of 114 places in 116 ms of which 0 ms to minimize.
[2023-03-15 15:44:14] [INFO ] Deduced a trap composed of 126 places in 123 ms of which 0 ms to minimize.
[2023-03-15 15:44:15] [INFO ] Deduced a trap composed of 141 places in 126 ms of which 0 ms to minimize.
[2023-03-15 15:44:15] [INFO ] Deduced a trap composed of 125 places in 120 ms of which 0 ms to minimize.
[2023-03-15 15:44:15] [INFO ] Deduced a trap composed of 123 places in 109 ms of which 0 ms to minimize.
[2023-03-15 15:44:15] [INFO ] Deduced a trap composed of 132 places in 109 ms of which 0 ms to minimize.
[2023-03-15 15:44:15] [INFO ] Deduced a trap composed of 130 places in 106 ms of which 0 ms to minimize.
[2023-03-15 15:44:16] [INFO ] Deduced a trap composed of 120 places in 130 ms of which 0 ms to minimize.
[2023-03-15 15:44:16] [INFO ] Deduced a trap composed of 121 places in 128 ms of which 2 ms to minimize.
[2023-03-15 15:44:16] [INFO ] Deduced a trap composed of 115 places in 116 ms of which 0 ms to minimize.
[2023-03-15 15:44:16] [INFO ] Deduced a trap composed of 121 places in 110 ms of which 0 ms to minimize.
[2023-03-15 15:44:16] [INFO ] Deduced a trap composed of 111 places in 111 ms of which 0 ms to minimize.
[2023-03-15 15:44:16] [INFO ] Deduced a trap composed of 129 places in 109 ms of which 0 ms to minimize.
[2023-03-15 15:44:16] [INFO ] Deduced a trap composed of 135 places in 114 ms of which 0 ms to minimize.
[2023-03-15 15:44:17] [INFO ] Deduced a trap composed of 114 places in 113 ms of which 0 ms to minimize.
[2023-03-15 15:44:17] [INFO ] Deduced a trap composed of 129 places in 126 ms of which 0 ms to minimize.
[2023-03-15 15:44:17] [INFO ] Deduced a trap composed of 120 places in 114 ms of which 0 ms to minimize.
[2023-03-15 15:44:17] [INFO ] Deduced a trap composed of 117 places in 110 ms of which 0 ms to minimize.
[2023-03-15 15:44:17] [INFO ] Deduced a trap composed of 120 places in 107 ms of which 0 ms to minimize.
[2023-03-15 15:44:17] [INFO ] Deduced a trap composed of 140 places in 116 ms of which 0 ms to minimize.
[2023-03-15 15:44:18] [INFO ] Deduced a trap composed of 117 places in 117 ms of which 0 ms to minimize.
[2023-03-15 15:44:18] [INFO ] Deduced a trap composed of 126 places in 114 ms of which 0 ms to minimize.
[2023-03-15 15:44:18] [INFO ] Deduced a trap composed of 138 places in 115 ms of which 0 ms to minimize.
[2023-03-15 15:44:18] [INFO ] Deduced a trap composed of 132 places in 109 ms of which 0 ms to minimize.
[2023-03-15 15:44:18] [INFO ] Deduced a trap composed of 117 places in 114 ms of which 1 ms to minimize.
[2023-03-15 15:44:18] [INFO ] Deduced a trap composed of 123 places in 108 ms of which 0 ms to minimize.
[2023-03-15 15:44:18] [INFO ] Deduced a trap composed of 120 places in 113 ms of which 0 ms to minimize.
[2023-03-15 15:44:19] [INFO ] Deduced a trap composed of 132 places in 118 ms of which 1 ms to minimize.
[2023-03-15 15:44:19] [INFO ] Deduced a trap composed of 120 places in 108 ms of which 0 ms to minimize.
[2023-03-15 15:44:19] [INFO ] Deduced a trap composed of 117 places in 118 ms of which 1 ms to minimize.
[2023-03-15 15:44:19] [INFO ] Deduced a trap composed of 126 places in 113 ms of which 1 ms to minimize.
[2023-03-15 15:44:19] [INFO ] Deduced a trap composed of 123 places in 118 ms of which 1 ms to minimize.
[2023-03-15 15:44:19] [INFO ] Deduced a trap composed of 126 places in 121 ms of which 1 ms to minimize.
[2023-03-15 15:44:20] [INFO ] Deduced a trap composed of 129 places in 117 ms of which 1 ms to minimize.
[2023-03-15 15:44:20] [INFO ] Deduced a trap composed of 132 places in 115 ms of which 0 ms to minimize.
[2023-03-15 15:44:20] [INFO ] Deduced a trap composed of 123 places in 111 ms of which 0 ms to minimize.
[2023-03-15 15:44:20] [INFO ] Deduced a trap composed of 126 places in 118 ms of which 0 ms to minimize.
[2023-03-15 15:44:21] [INFO ] Deduced a trap composed of 121 places in 132 ms of which 0 ms to minimize.
[2023-03-15 15:44:21] [INFO ] Deduced a trap composed of 126 places in 132 ms of which 1 ms to minimize.
[2023-03-15 15:44:22] [INFO ] Deduced a trap composed of 129 places in 114 ms of which 0 ms to minimize.
[2023-03-15 15:44:22] [INFO ] Deduced a trap composed of 120 places in 110 ms of which 0 ms to minimize.
[2023-03-15 15:44:31] [INFO ] Trap strengthening (SAT) tested/added 91/91 trap constraints in 25583 ms
[2023-03-15 15:44:31] [INFO ] After 26049ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 15:44:31] [INFO ] After 26136ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
FORMULA PolyORBNT-PT-S05J30-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA PolyORBNT-PT-S05J30-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J30-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(p1)&&F(p2))))'
Support contains 65 out of 484 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 650/650 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 483 transition count 649
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 483 transition count 649
Applied a total of 2 rules in 16 ms. Remains 483 /484 variables (removed 1) and now considering 649/650 (removed 1) transitions.
[2023-03-15 15:44:32] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2023-03-15 15:44:32] [INFO ] Computed 77 place invariants in 6 ms
[2023-03-15 15:44:32] [INFO ] Dead Transitions using invariants and state equation in 601 ms found 0 transitions.
[2023-03-15 15:44:32] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-15 15:44:32] [INFO ] Invariant cache hit.
[2023-03-15 15:44:33] [INFO ] Implicit Places using invariants in 506 ms returned []
[2023-03-15 15:44:33] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-15 15:44:33] [INFO ] Invariant cache hit.
[2023-03-15 15:44:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 15:44:37] [INFO ] Implicit Places using invariants and state equation in 4307 ms returned []
Implicit Place search using SMT with State Equation took 4815 ms to find 0 implicit places.
[2023-03-15 15:44:37] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-15 15:44:37] [INFO ] Invariant cache hit.
[2023-03-15 15:44:38] [INFO ] Dead Transitions using invariants and state equation in 677 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 483/484 places, 649/650 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6118 ms. Remains : 483/484 places, 649/650 transitions.
Stuttering acceptance computed with spot in 324 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : PolyORBNT-PT-S05J30-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 p2), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(AND p0 p1 p2), acceptance={0} source=5 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=5 dest: 2}, { cond=(NOT p1), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=4, aps=[p1:(AND (LT s255 1) (LT s256 1) (LT s447 1) (LT s446 1) (LT s67 1) (LT s133 1) (LT s12 1) (LT s323 1) (LT s401 1) (LT s141 1) (LT s205 1) (LT s267 1) (LT ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 374 steps with 22 reset in 9 ms.
FORMULA PolyORBNT-PT-S05J30-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-01 finished in 6508 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0)||(F(!p0) U p1)||(p2&&F(p1)))))'
Support contains 35 out of 484 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 650/650 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 483 transition count 649
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 483 transition count 649
Applied a total of 2 rules in 22 ms. Remains 483 /484 variables (removed 1) and now considering 649/650 (removed 1) transitions.
[2023-03-15 15:44:38] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-15 15:44:38] [INFO ] Invariant cache hit.
[2023-03-15 15:44:39] [INFO ] Dead Transitions using invariants and state equation in 630 ms found 0 transitions.
[2023-03-15 15:44:39] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-15 15:44:39] [INFO ] Invariant cache hit.
[2023-03-15 15:44:39] [INFO ] Implicit Places using invariants in 506 ms returned []
[2023-03-15 15:44:39] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-15 15:44:39] [INFO ] Invariant cache hit.
[2023-03-15 15:44:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 15:44:44] [INFO ] Implicit Places using invariants and state equation in 4880 ms returned []
Implicit Place search using SMT with State Equation took 5387 ms to find 0 implicit places.
[2023-03-15 15:44:44] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-15 15:44:44] [INFO ] Invariant cache hit.
[2023-03-15 15:44:45] [INFO ] Dead Transitions using invariants and state equation in 679 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 483/484 places, 649/650 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6723 ms. Remains : 483/484 places, 649/650 transitions.
Stuttering acceptance computed with spot in 275 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, (NOT p1), (AND p0 (NOT p1)), (AND (NOT p1) p0), (NOT p1)]
Running random walk in product with property : PolyORBNT-PT-S05J30-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 5}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 6}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (OR (LT s104 1) (LT s181 1) (LT s301 1)) (OR (LT s104 1) (LT s162 1) (LT s181 1)) (OR (LT s104 1) (LT s181 1) (LT s305 1)) (OR (LT s104 1) (LT s18...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 2 ms.
FORMULA PolyORBNT-PT-S05J30-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-02 finished in 7023 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 193 out of 484 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 484/484 places, 650/650 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 484 transition count 646
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 480 transition count 646
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 8 place count 480 transition count 612
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 76 place count 446 transition count 612
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 445 transition count 611
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 445 transition count 611
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 82 place count 443 transition count 609
Applied a total of 82 rules in 49 ms. Remains 443 /484 variables (removed 41) and now considering 609/650 (removed 41) transitions.
[2023-03-15 15:44:45] [INFO ] Flow matrix only has 605 transitions (discarded 4 similar events)
// Phase 1: matrix 605 rows 443 cols
[2023-03-15 15:44:45] [INFO ] Computed 77 place invariants in 8 ms
[2023-03-15 15:44:46] [INFO ] Dead Transitions using invariants and state equation in 477 ms found 0 transitions.
[2023-03-15 15:44:46] [INFO ] Flow matrix only has 605 transitions (discarded 4 similar events)
[2023-03-15 15:44:46] [INFO ] Invariant cache hit.
[2023-03-15 15:44:46] [INFO ] Implicit Places using invariants in 351 ms returned []
[2023-03-15 15:44:46] [INFO ] Flow matrix only has 605 transitions (discarded 4 similar events)
[2023-03-15 15:44:46] [INFO ] Invariant cache hit.
[2023-03-15 15:44:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 15:44:48] [INFO ] Implicit Places using invariants and state equation in 2408 ms returned []
Implicit Place search using SMT with State Equation took 2761 ms to find 0 implicit places.
[2023-03-15 15:44:48] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-15 15:44:48] [INFO ] Flow matrix only has 605 transitions (discarded 4 similar events)
[2023-03-15 15:44:48] [INFO ] Invariant cache hit.
[2023-03-15 15:44:49] [INFO ] Dead Transitions using invariants and state equation in 498 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 443/484 places, 609/650 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3811 ms. Remains : 443/484 places, 609/650 transitions.
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PolyORBNT-PT-S05J30-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s389 1) (LT s396 1)) (OR (LT s176 1) (LT s269 1)) (OR (LT s284 1) (LT s399 1)) (OR (LT s76 1) (LT s301 1)) (OR (LT s223 1) (LT s408 1)) (O...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J30-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-03 finished in 3930 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 3 out of 484 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 484/484 places, 650/650 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 484 transition count 615
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 71 place count 449 transition count 614
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 448 transition count 614
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 72 place count 448 transition count 580
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 140 place count 414 transition count 580
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 141 place count 413 transition count 579
Iterating global reduction 3 with 1 rules applied. Total rules applied 142 place count 413 transition count 579
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 146 place count 411 transition count 577
Applied a total of 146 rules in 49 ms. Remains 411 /484 variables (removed 73) and now considering 577/650 (removed 73) transitions.
[2023-03-15 15:44:49] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2023-03-15 15:44:49] [INFO ] Computed 77 place invariants in 14 ms
[2023-03-15 15:44:49] [INFO ] Dead Transitions using invariants and state equation in 410 ms found 0 transitions.
[2023-03-15 15:44:49] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-15 15:44:49] [INFO ] Invariant cache hit.
[2023-03-15 15:44:50] [INFO ] Implicit Places using invariants in 441 ms returned []
[2023-03-15 15:44:50] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-15 15:44:50] [INFO ] Invariant cache hit.
[2023-03-15 15:44:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 15:44:53] [INFO ] Implicit Places using invariants and state equation in 3056 ms returned []
Implicit Place search using SMT with State Equation took 3499 ms to find 0 implicit places.
[2023-03-15 15:44:53] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-15 15:44:53] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-15 15:44:53] [INFO ] Invariant cache hit.
[2023-03-15 15:44:53] [INFO ] Dead Transitions using invariants and state equation in 393 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 411/484 places, 577/650 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4370 ms. Remains : 411/484 places, 577/650 transitions.
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PolyORBNT-PT-S05J30-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s139 1) (LT s181 1)), p1:(OR (LT s16 1) (LT s181 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 5330 reset in 486 ms.
Product exploration explored 100000 steps with 5247 reset in 448 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 184 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 190 steps, including 8 resets, run visited all 2 properties in 5 ms. (steps per millisecond=38 )
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 195 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 92 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 411 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 411/411 places, 577/577 transitions.
Applied a total of 0 rules in 16 ms. Remains 411 /411 variables (removed 0) and now considering 577/577 (removed 0) transitions.
[2023-03-15 15:44:55] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-15 15:44:55] [INFO ] Invariant cache hit.
[2023-03-15 15:44:55] [INFO ] Dead Transitions using invariants and state equation in 363 ms found 0 transitions.
[2023-03-15 15:44:55] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-15 15:44:55] [INFO ] Invariant cache hit.
[2023-03-15 15:44:56] [INFO ] Implicit Places using invariants in 425 ms returned []
[2023-03-15 15:44:56] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-15 15:44:56] [INFO ] Invariant cache hit.
[2023-03-15 15:44:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 15:45:00] [INFO ] Implicit Places using invariants and state equation in 3970 ms returned []
Implicit Place search using SMT with State Equation took 4399 ms to find 0 implicit places.
[2023-03-15 15:45:00] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-15 15:45:00] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-15 15:45:00] [INFO ] Invariant cache hit.
[2023-03-15 15:45:00] [INFO ] Dead Transitions using invariants and state equation in 408 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5210 ms. Remains : 411/411 places, 577/577 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 p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 276 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 518 steps, including 19 resets, run visited all 2 properties in 8 ms. (steps per millisecond=64 )
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 216 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 5263 reset in 410 ms.
Product exploration explored 100000 steps with 5250 reset in 424 ms.
Support contains 3 out of 411 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 411/411 places, 577/577 transitions.
Applied a total of 0 rules in 19 ms. Remains 411 /411 variables (removed 0) and now considering 577/577 (removed 0) transitions.
[2023-03-15 15:45:02] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-15 15:45:02] [INFO ] Invariant cache hit.
[2023-03-15 15:45:03] [INFO ] Dead Transitions using invariants and state equation in 409 ms found 0 transitions.
[2023-03-15 15:45:03] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-15 15:45:03] [INFO ] Invariant cache hit.
[2023-03-15 15:45:03] [INFO ] Implicit Places using invariants in 442 ms returned []
[2023-03-15 15:45:03] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-15 15:45:03] [INFO ] Invariant cache hit.
[2023-03-15 15:45:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 15:45:07] [INFO ] Implicit Places using invariants and state equation in 3667 ms returned []
Implicit Place search using SMT with State Equation took 4112 ms to find 0 implicit places.
[2023-03-15 15:45:07] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-15 15:45:07] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-15 15:45:07] [INFO ] Invariant cache hit.
[2023-03-15 15:45:07] [INFO ] Dead Transitions using invariants and state equation in 390 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4945 ms. Remains : 411/411 places, 577/577 transitions.
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-04 finished in 18208 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(!p0))'
Support contains 2 out of 484 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 650/650 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 483 transition count 649
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 483 transition count 649
Applied a total of 2 rules in 14 ms. Remains 483 /484 variables (removed 1) and now considering 649/650 (removed 1) transitions.
[2023-03-15 15:45:07] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2023-03-15 15:45:07] [INFO ] Computed 77 place invariants in 12 ms
[2023-03-15 15:45:08] [INFO ] Dead Transitions using invariants and state equation in 603 ms found 0 transitions.
[2023-03-15 15:45:08] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-15 15:45:08] [INFO ] Invariant cache hit.
[2023-03-15 15:45:08] [INFO ] Implicit Places using invariants in 537 ms returned []
[2023-03-15 15:45:08] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-15 15:45:08] [INFO ] Invariant cache hit.
[2023-03-15 15:45:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 15:45:13] [INFO ] Implicit Places using invariants and state equation in 4709 ms returned []
Implicit Place search using SMT with State Equation took 5250 ms to find 0 implicit places.
[2023-03-15 15:45:13] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-15 15:45:13] [INFO ] Invariant cache hit.
[2023-03-15 15:45:14] [INFO ] Dead Transitions using invariants and state equation in 666 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 483/484 places, 649/650 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6537 ms. Remains : 483/484 places, 649/650 transitions.
Stuttering acceptance computed with spot in 88 ms :[p0, p0, true]
Running random walk in product with property : PolyORBNT-PT-S05J30-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s19 1) (LT s210 1))], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S05J30-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-05 finished in 6639 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(F(p1))||p0)))'
Support contains 8 out of 484 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 484/484 places, 650/650 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 484 transition count 615
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 449 transition count 615
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 70 place count 449 transition count 581
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 138 place count 415 transition count 581
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 139 place count 414 transition count 580
Iterating global reduction 2 with 1 rules applied. Total rules applied 140 place count 414 transition count 580
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 144 place count 412 transition count 578
Applied a total of 144 rules in 36 ms. Remains 412 /484 variables (removed 72) and now considering 578/650 (removed 72) transitions.
[2023-03-15 15:45:14] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
// Phase 1: matrix 574 rows 412 cols
[2023-03-15 15:45:14] [INFO ] Computed 77 place invariants in 12 ms
[2023-03-15 15:45:14] [INFO ] Dead Transitions using invariants and state equation in 424 ms found 0 transitions.
[2023-03-15 15:45:14] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2023-03-15 15:45:14] [INFO ] Invariant cache hit.
[2023-03-15 15:45:15] [INFO ] Implicit Places using invariants in 432 ms returned []
[2023-03-15 15:45:15] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2023-03-15 15:45:15] [INFO ] Invariant cache hit.
[2023-03-15 15:45:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 15:45:18] [INFO ] Implicit Places using invariants and state equation in 3411 ms returned []
Implicit Place search using SMT with State Equation took 3844 ms to find 0 implicit places.
[2023-03-15 15:45:18] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-15 15:45:18] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2023-03-15 15:45:18] [INFO ] Invariant cache hit.
[2023-03-15 15:45:19] [INFO ] Dead Transitions using invariants and state equation in 409 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 412/484 places, 578/650 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4738 ms. Remains : 412/484 places, 578/650 transitions.
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : PolyORBNT-PT-S05J30-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s7 4) (AND (GEQ s68 6) (GEQ s130 2) (GEQ s288 2) (GEQ s359 1)) (AND (GEQ s68 6) (GEQ s288 4) (GEQ s359 1)) (AND (GEQ s68 6) (GEQ s73 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J30-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-07 finished in 4808 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G((p1||X(X(X(G(p2))))))))'
Support contains 3 out of 484 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 650/650 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 483 transition count 649
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 483 transition count 649
Applied a total of 2 rules in 19 ms. Remains 483 /484 variables (removed 1) and now considering 649/650 (removed 1) transitions.
[2023-03-15 15:45:19] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2023-03-15 15:45:19] [INFO ] Computed 77 place invariants in 7 ms
[2023-03-15 15:45:19] [INFO ] Dead Transitions using invariants and state equation in 609 ms found 0 transitions.
[2023-03-15 15:45:19] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-15 15:45:19] [INFO ] Invariant cache hit.
[2023-03-15 15:45:20] [INFO ] Implicit Places using invariants in 502 ms returned []
[2023-03-15 15:45:20] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-15 15:45:20] [INFO ] Invariant cache hit.
[2023-03-15 15:45:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 15:45:25] [INFO ] Implicit Places using invariants and state equation in 4884 ms returned []
Implicit Place search using SMT with State Equation took 5387 ms to find 0 implicit places.
[2023-03-15 15:45:25] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-15 15:45:25] [INFO ] Invariant cache hit.
[2023-03-15 15:45:25] [INFO ] Dead Transitions using invariants and state equation in 680 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 483/484 places, 649/650 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6699 ms. Remains : 483/484 places, 649/650 transitions.
Stuttering acceptance computed with spot in 312 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2), (NOT p2), true]
Running random walk in product with property : PolyORBNT-PT-S05J30-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=p2, acceptance={} source=5 dest: 5}, { cond=(NOT p2), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(LT s8 4), p1:(LT s371 1), p2:(GEQ s449 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S05J30-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-09 finished in 7036 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(!p1)&&p0)))'
Support contains 3 out of 484 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 650/650 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 483 transition count 649
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 483 transition count 649
Applied a total of 2 rules in 18 ms. Remains 483 /484 variables (removed 1) and now considering 649/650 (removed 1) transitions.
[2023-03-15 15:45:26] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-15 15:45:26] [INFO ] Invariant cache hit.
[2023-03-15 15:45:26] [INFO ] Dead Transitions using invariants and state equation in 669 ms found 0 transitions.
[2023-03-15 15:45:26] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-15 15:45:26] [INFO ] Invariant cache hit.
[2023-03-15 15:45:27] [INFO ] Implicit Places using invariants in 517 ms returned []
[2023-03-15 15:45:27] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-15 15:45:27] [INFO ] Invariant cache hit.
[2023-03-15 15:45:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 15:45:31] [INFO ] Implicit Places using invariants and state equation in 4149 ms returned []
Implicit Place search using SMT with State Equation took 4670 ms to find 0 implicit places.
[2023-03-15 15:45:31] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-15 15:45:31] [INFO ] Invariant cache hit.
[2023-03-15 15:45:32] [INFO ] Dead Transitions using invariants and state equation in 676 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 483/484 places, 649/650 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6036 ms. Remains : 483/484 places, 649/650 transitions.
Stuttering acceptance computed with spot in 59 ms :[(OR (NOT p0) p1), p1]
Running random walk in product with property : PolyORBNT-PT-S05J30-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s337 1) (GEQ s477 1)), p1:(LT s233 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S05J30-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-10 finished in 6112 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((!p0&&G(p1)))||G(p0))))'
Support contains 3 out of 484 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 650/650 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 483 transition count 649
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 483 transition count 649
Applied a total of 2 rules in 16 ms. Remains 483 /484 variables (removed 1) and now considering 649/650 (removed 1) transitions.
[2023-03-15 15:45:32] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-15 15:45:32] [INFO ] Invariant cache hit.
[2023-03-15 15:45:32] [INFO ] Dead Transitions using invariants and state equation in 674 ms found 0 transitions.
[2023-03-15 15:45:32] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-15 15:45:32] [INFO ] Invariant cache hit.
[2023-03-15 15:45:33] [INFO ] Implicit Places using invariants in 537 ms returned []
[2023-03-15 15:45:33] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-15 15:45:33] [INFO ] Invariant cache hit.
[2023-03-15 15:45:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 15:45:37] [INFO ] Implicit Places using invariants and state equation in 4123 ms returned []
Implicit Place search using SMT with State Equation took 4662 ms to find 0 implicit places.
[2023-03-15 15:45:37] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-15 15:45:37] [INFO ] Invariant cache hit.
[2023-03-15 15:45:38] [INFO ] Dead Transitions using invariants and state equation in 676 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 483/484 places, 649/650 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6035 ms. Remains : 483/484 places, 649/650 transitions.
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (OR (NOT p1) p0), (NOT p1)]
Running random walk in product with property : PolyORBNT-PT-S05J30-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=(OR p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LT s371 1), p1:(AND (GEQ s3 1) (GEQ s464 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J30-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-11 finished in 6211 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 484 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 484/484 places, 650/650 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 484 transition count 615
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 71 place count 449 transition count 614
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 448 transition count 614
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 72 place count 448 transition count 580
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 140 place count 414 transition count 580
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 141 place count 413 transition count 579
Iterating global reduction 3 with 1 rules applied. Total rules applied 142 place count 413 transition count 579
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 146 place count 411 transition count 577
Applied a total of 146 rules in 44 ms. Remains 411 /484 variables (removed 73) and now considering 577/650 (removed 73) transitions.
[2023-03-15 15:45:38] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2023-03-15 15:45:38] [INFO ] Computed 77 place invariants in 13 ms
[2023-03-15 15:45:38] [INFO ] Dead Transitions using invariants and state equation in 400 ms found 0 transitions.
[2023-03-15 15:45:38] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-15 15:45:38] [INFO ] Invariant cache hit.
[2023-03-15 15:45:39] [INFO ] Implicit Places using invariants in 416 ms returned []
[2023-03-15 15:45:39] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-15 15:45:39] [INFO ] Invariant cache hit.
[2023-03-15 15:45:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 15:45:43] [INFO ] Implicit Places using invariants and state equation in 3791 ms returned []
Implicit Place search using SMT with State Equation took 4211 ms to find 0 implicit places.
[2023-03-15 15:45:43] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-15 15:45:43] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-15 15:45:43] [INFO ] Invariant cache hit.
[2023-03-15 15:45:43] [INFO ] Dead Transitions using invariants and state equation in 412 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 411/484 places, 577/650 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5087 ms. Remains : 411/484 places, 577/650 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J30-LTLFireability-12 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 (LT s16 1) (LT s181 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 4891 reset in 398 ms.
Product exploration explored 100000 steps with 4881 reset in 417 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 112 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 31 ms :[(NOT p0)]
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 95 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 23 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Support contains 2 out of 411 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 411/411 places, 577/577 transitions.
Applied a total of 0 rules in 10 ms. Remains 411 /411 variables (removed 0) and now considering 577/577 (removed 0) transitions.
[2023-03-15 15:45:44] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-15 15:45:44] [INFO ] Invariant cache hit.
[2023-03-15 15:45:45] [INFO ] Dead Transitions using invariants and state equation in 397 ms found 0 transitions.
[2023-03-15 15:45:45] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-15 15:45:45] [INFO ] Invariant cache hit.
[2023-03-15 15:45:45] [INFO ] Implicit Places using invariants in 439 ms returned []
[2023-03-15 15:45:45] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-15 15:45:45] [INFO ] Invariant cache hit.
[2023-03-15 15:45:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 15:45:49] [INFO ] Implicit Places using invariants and state equation in 3486 ms returned []
Implicit Place search using SMT with State Equation took 3927 ms to find 0 implicit places.
[2023-03-15 15:45:49] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-15 15:45:49] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-15 15:45:49] [INFO ] Invariant cache hit.
[2023-03-15 15:45:49] [INFO ] Dead Transitions using invariants and state equation in 404 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4754 ms. Remains : 411/411 places, 577/577 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 91 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 36 ms :[(NOT p0)]
Finished random walk after 31 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=31 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 86 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 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4928 reset in 410 ms.
Product exploration explored 100000 steps with 4887 reset in 414 ms.
Support contains 2 out of 411 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 411/411 places, 577/577 transitions.
Applied a total of 0 rules in 9 ms. Remains 411 /411 variables (removed 0) and now considering 577/577 (removed 0) transitions.
[2023-03-15 15:45:50] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-15 15:45:50] [INFO ] Invariant cache hit.
[2023-03-15 15:45:51] [INFO ] Dead Transitions using invariants and state equation in 412 ms found 0 transitions.
[2023-03-15 15:45:51] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-15 15:45:51] [INFO ] Invariant cache hit.
[2023-03-15 15:45:51] [INFO ] Implicit Places using invariants in 437 ms returned []
[2023-03-15 15:45:51] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-15 15:45:51] [INFO ] Invariant cache hit.
[2023-03-15 15:45:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 15:45:55] [INFO ] Implicit Places using invariants and state equation in 4040 ms returned []
Implicit Place search using SMT with State Equation took 4479 ms to find 0 implicit places.
[2023-03-15 15:45:55] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-15 15:45:55] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-15 15:45:55] [INFO ] Invariant cache hit.
[2023-03-15 15:45:55] [INFO ] Dead Transitions using invariants and state equation in 396 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5318 ms. Remains : 411/411 places, 577/577 transitions.
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-12 finished in 17556 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(G((p0&&(p1 U (G(p1)||(X(p1)&&p2)))))))))'
Support contains 6 out of 484 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 650/650 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 483 transition count 649
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 483 transition count 649
Applied a total of 2 rules in 11 ms. Remains 483 /484 variables (removed 1) and now considering 649/650 (removed 1) transitions.
[2023-03-15 15:45:56] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2023-03-15 15:45:56] [INFO ] Computed 77 place invariants in 17 ms
[2023-03-15 15:45:56] [INFO ] Dead Transitions using invariants and state equation in 614 ms found 0 transitions.
[2023-03-15 15:45:56] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-15 15:45:56] [INFO ] Invariant cache hit.
[2023-03-15 15:45:57] [INFO ] Implicit Places using invariants in 488 ms returned []
[2023-03-15 15:45:57] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-15 15:45:57] [INFO ] Invariant cache hit.
[2023-03-15 15:45:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 15:46:01] [INFO ] Implicit Places using invariants and state equation in 3938 ms returned []
Implicit Place search using SMT with State Equation took 4432 ms to find 0 implicit places.
[2023-03-15 15:46:01] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-15 15:46:01] [INFO ] Invariant cache hit.
[2023-03-15 15:46:01] [INFO ] Dead Transitions using invariants and state equation in 665 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 483/484 places, 649/650 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5724 ms. Remains : 483/484 places, 649/650 transitions.
Stuttering acceptance computed with spot in 289 ms :[true, (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J30-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=4 dest: 0}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(OR (LT s332 1) (LT s439 1) (LT s440 1)), p1:(OR (LT s19 1) (LT s210 1)), p2:(AND (OR (LT s19 1) (LT s210 1)) (NOT (AND (GEQ s200 1) (GEQ s210 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S05J30-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-14 finished in 6036 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2023-03-15 15:46:02] [INFO ] Flatten gal took : 43 ms
[2023-03-15 15:46:02] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-15 15:46:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 484 places, 650 transitions and 3104 arcs took 6 ms.
Total runtime 177056 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT PolyORBNT-PT-S05J30
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLFireability

BK_STOP 1678895323407

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:544
lola: rewrite Frontend/Parser/formula_rewrite.k:373
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 8 (type EXCL) for 7 PolyORBNT-PT-S05J30-LTLFireability-12
lola: time limit : 1200 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S05J30-LTLFireability-04: CONJ 0 2 0 0 2 0 0 0
PolyORBNT-PT-S05J30-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 5/1200 4/32 PolyORBNT-PT-S05J30-LTLFireability-12 381326 m, 76265 m/sec, 1005718 t fired, .

Time elapsed: 5 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S05J30-LTLFireability-04: CONJ 0 2 0 0 2 0 0 0
PolyORBNT-PT-S05J30-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 10/1200 8/32 PolyORBNT-PT-S05J30-LTLFireability-12 731138 m, 69962 m/sec, 2045024 t fired, .

Time elapsed: 10 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S05J30-LTLFireability-04: CONJ 0 2 0 0 2 0 0 0
PolyORBNT-PT-S05J30-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 15/1200 12/32 PolyORBNT-PT-S05J30-LTLFireability-12 1125760 m, 78924 m/sec, 3091212 t fired, .

Time elapsed: 15 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S05J30-LTLFireability-04: CONJ 0 2 0 0 2 0 0 0
PolyORBNT-PT-S05J30-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 20/1200 15/32 PolyORBNT-PT-S05J30-LTLFireability-12 1453303 m, 65508 m/sec, 4066200 t fired, .

Time elapsed: 20 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S05J30-LTLFireability-04: CONJ 0 2 0 0 2 0 0 0
PolyORBNT-PT-S05J30-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 25/1200 19/32 PolyORBNT-PT-S05J30-LTLFireability-12 1824425 m, 74224 m/sec, 5047114 t fired, .

Time elapsed: 25 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S05J30-LTLFireability-04: CONJ 0 2 0 0 2 0 0 0
PolyORBNT-PT-S05J30-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 30/1200 22/32 PolyORBNT-PT-S05J30-LTLFireability-12 2166469 m, 68408 m/sec, 6062180 t fired, .

Time elapsed: 30 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S05J30-LTLFireability-04: CONJ 0 2 0 0 2 0 0 0
PolyORBNT-PT-S05J30-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 35/1200 26/32 PolyORBNT-PT-S05J30-LTLFireability-12 2536311 m, 73968 m/sec, 7063527 t fired, .

Time elapsed: 35 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S05J30-LTLFireability-04: CONJ 0 2 0 0 2 0 0 0
PolyORBNT-PT-S05J30-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 40/1200 29/32 PolyORBNT-PT-S05J30-LTLFireability-12 2862396 m, 65217 m/sec, 8018538 t fired, .

Time elapsed: 40 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 8 (type EXCL) for PolyORBNT-PT-S05J30-LTLFireability-12 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S05J30-LTLFireability-04: CONJ 0 2 0 0 2 0 0 0
PolyORBNT-PT-S05J30-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 45 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 5 (type EXCL) for 0 PolyORBNT-PT-S05J30-LTLFireability-04
lola: time limit : 1777 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S05J30-LTLFireability-04: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-PT-S05J30-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 5/1777 4/32 PolyORBNT-PT-S05J30-LTLFireability-04 390669 m, 78133 m/sec, 1029118 t fired, .

Time elapsed: 50 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S05J30-LTLFireability-04: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-PT-S05J30-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 10/1777 8/32 PolyORBNT-PT-S05J30-LTLFireability-04 745643 m, 70994 m/sec, 2082518 t fired, .

Time elapsed: 55 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S05J30-LTLFireability-04: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-PT-S05J30-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 15/1777 12/32 PolyORBNT-PT-S05J30-LTLFireability-04 1148163 m, 80504 m/sec, 3147319 t fired, .

Time elapsed: 60 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S05J30-LTLFireability-04: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-PT-S05J30-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 20/1777 15/32 PolyORBNT-PT-S05J30-LTLFireability-04 1477272 m, 65821 m/sec, 4128330 t fired, .

Time elapsed: 65 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S05J30-LTLFireability-04: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-PT-S05J30-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 25/1777 19/32 PolyORBNT-PT-S05J30-LTLFireability-04 1851749 m, 74895 m/sec, 5122464 t fired, .

Time elapsed: 70 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S05J30-LTLFireability-04: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-PT-S05J30-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 30/1777 22/32 PolyORBNT-PT-S05J30-LTLFireability-04 2197352 m, 69120 m/sec, 6145339 t fired, .

Time elapsed: 75 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S05J30-LTLFireability-04: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-PT-S05J30-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 35/1777 26/32 PolyORBNT-PT-S05J30-LTLFireability-04 2574636 m, 75456 m/sec, 7160146 t fired, .

Time elapsed: 80 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S05J30-LTLFireability-04: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-PT-S05J30-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 40/1777 29/32 PolyORBNT-PT-S05J30-LTLFireability-04 2902153 m, 65503 m/sec, 8126207 t fired, .

Time elapsed: 85 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 5 (type EXCL) for PolyORBNT-PT-S05J30-LTLFireability-04 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S05J30-LTLFireability-04: CONJ 0 1 0 0 2 0 1 0
PolyORBNT-PT-S05J30-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 90 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 3 (type EXCL) for 0 PolyORBNT-PT-S05J30-LTLFireability-04
lola: time limit : 3510 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S05J30-LTLFireability-04: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-PT-S05J30-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 5/3510 3/32 PolyORBNT-PT-S05J30-LTLFireability-04 321564 m, 64312 m/sec, 1329172 t fired, .

Time elapsed: 95 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S05J30-LTLFireability-04: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-PT-S05J30-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 10/3510 6/32 PolyORBNT-PT-S05J30-LTLFireability-04 635674 m, 62822 m/sec, 2646182 t fired, .

Time elapsed: 100 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S05J30-LTLFireability-04: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-PT-S05J30-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 15/3510 8/32 PolyORBNT-PT-S05J30-LTLFireability-04 946361 m, 62137 m/sec, 3981077 t fired, .

Time elapsed: 105 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S05J30-LTLFireability-04: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-PT-S05J30-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 20/3510 11/32 PolyORBNT-PT-S05J30-LTLFireability-04 1243128 m, 59353 m/sec, 5376546 t fired, .

Time elapsed: 110 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S05J30-LTLFireability-04: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-PT-S05J30-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 25/3510 13/32 PolyORBNT-PT-S05J30-LTLFireability-04 1519646 m, 55303 m/sec, 6684789 t fired, .

Time elapsed: 115 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S05J30-LTLFireability-04: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-PT-S05J30-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 30/3510 16/32 PolyORBNT-PT-S05J30-LTLFireability-04 1830160 m, 62102 m/sec, 8046224 t fired, .

Time elapsed: 120 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S05J30-LTLFireability-04: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-PT-S05J30-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 35/3510 18/32 PolyORBNT-PT-S05J30-LTLFireability-04 2169618 m, 67891 m/sec, 9405139 t fired, .

Time elapsed: 125 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S05J30-LTLFireability-04: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-PT-S05J30-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 40/3510 21/32 PolyORBNT-PT-S05J30-LTLFireability-04 2449384 m, 55953 m/sec, 10721993 t fired, .

Time elapsed: 130 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S05J30-LTLFireability-04: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-PT-S05J30-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 45/3510 23/32 PolyORBNT-PT-S05J30-LTLFireability-04 2706302 m, 51383 m/sec, 11929708 t fired, .

Time elapsed: 135 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S05J30-LTLFireability-04: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-PT-S05J30-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 50/3510 25/32 PolyORBNT-PT-S05J30-LTLFireability-04 3015661 m, 61871 m/sec, 13208032 t fired, .

Time elapsed: 140 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S05J30-LTLFireability-04: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-PT-S05J30-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 55/3510 28/32 PolyORBNT-PT-S05J30-LTLFireability-04 3321740 m, 61215 m/sec, 14506268 t fired, .

Time elapsed: 145 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S05J30-LTLFireability-04: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-PT-S05J30-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 60/3510 30/32 PolyORBNT-PT-S05J30-LTLFireability-04 3616377 m, 58927 m/sec, 15789217 t fired, .

Time elapsed: 150 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S05J30-LTLFireability-04: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-PT-S05J30-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 65/3510 32/32 PolyORBNT-PT-S05J30-LTLFireability-04 3890128 m, 54750 m/sec, 17135523 t fired, .

Time elapsed: 155 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 3 (type EXCL) for PolyORBNT-PT-S05J30-LTLFireability-04 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S05J30-LTLFireability-04: CONJ 0 0 0 0 2 0 2 0
PolyORBNT-PT-S05J30-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 160 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: Portfolio finished: no open tasks 2

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBNT-PT-S05J30-LTLFireability-04: CONJ unknown CONJ
PolyORBNT-PT-S05J30-LTLFireability-12: LTL unknown AGGR


Time elapsed: 160 secs. Pages in use: 32

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="PolyORBNT-PT-S05J30"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is PolyORBNT-PT-S05J30, 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 r295-tall-167873948300724"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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