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.r297-tall-167873950800724.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is PolyORBNT-PT-S05J30, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873950800724
=====================================================================

--------------------
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 1679623584968

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S05J30
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-24 02:06:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-24 02:06:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 02:06:26] [INFO ] Load time of PNML (sax parser for PT used): 136 ms
[2023-03-24 02:06:26] [INFO ] Transformed 489 places.
[2023-03-24 02:06:26] [INFO ] Transformed 1400 transitions.
[2023-03-24 02:06:27] [INFO ] Parsed PT model containing 489 places and 1400 transitions and 9764 arcs in 358 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
[2023-03-24 02:06:27] [INFO ] Reduced 90 identical enabling conditions.
[2023-03-24 02:06:27] [INFO ] Reduced 90 identical enabling conditions.
[2023-03-24 02:06:27] [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 43 ms. Remains 484 /489 variables (removed 5) and now considering 745/745 (removed 0) transitions.
[2023-03-24 02:06:27] [INFO ] Flow matrix only has 741 transitions (discarded 4 similar events)
// Phase 1: matrix 741 rows 484 cols
[2023-03-24 02:06:27] [INFO ] Computed 77 place invariants in 62 ms
[2023-03-24 02:06:28] [INFO ] Dead Transitions using invariants and state equation in 1169 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-24 02:06:28] [INFO ] Flow matrix only has 646 transitions (discarded 4 similar events)
// Phase 1: matrix 646 rows 484 cols
[2023-03-24 02:06:28] [INFO ] Computed 77 place invariants in 22 ms
[2023-03-24 02:06:28] [INFO ] Implicit Places using invariants in 375 ms returned []
[2023-03-24 02:06:28] [INFO ] Flow matrix only has 646 transitions (discarded 4 similar events)
[2023-03-24 02:06:28] [INFO ] Invariant cache hit.
[2023-03-24 02:06:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 02:06:31] [INFO ] Implicit Places using invariants and state equation in 3071 ms returned []
Implicit Place search using SMT with State Equation took 3453 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 18 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 4724 ms. Remains : 484/489 places, 650/745 transitions.
Support contains 281 out of 484 places after structural reductions.
[2023-03-24 02:06:32] [INFO ] Flatten gal took : 91 ms
[2023-03-24 02:06:32] [INFO ] Flatten gal took : 61 ms
[2023-03-24 02:06:32] [INFO ] Input system was already deterministic with 650 transitions.
Incomplete random walk after 10000 steps, including 696 resets, run finished after 447 ms. (steps per millisecond=22 ) properties (out of 25) seen :16
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 9) seen :3
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 188 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 164 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 169 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 158 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-24 02:06:33] [INFO ] Flow matrix only has 646 transitions (discarded 4 similar events)
[2023-03-24 02:06:33] [INFO ] Invariant cache hit.
[2023-03-24 02:06:33] [INFO ] [Real]Absence check using 59 positive place invariants in 11 ms returned sat
[2023-03-24 02:06:33] [INFO ] [Real]Absence check using 59 positive and 18 generalized place invariants in 18 ms returned sat
[2023-03-24 02:06:33] [INFO ] After 218ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:3
[2023-03-24 02:06:33] [INFO ] [Nat]Absence check using 59 positive place invariants in 12 ms returned sat
[2023-03-24 02:06:33] [INFO ] [Nat]Absence check using 59 positive and 18 generalized place invariants in 18 ms returned sat
[2023-03-24 02:06:34] [INFO ] After 641ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :3
[2023-03-24 02:06:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 02:06:34] [INFO ] After 337ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :3 sat :3
[2023-03-24 02:06:35] [INFO ] Deduced a trap composed of 261 places in 209 ms of which 6 ms to minimize.
[2023-03-24 02:06:35] [INFO ] Deduced a trap composed of 269 places in 196 ms of which 1 ms to minimize.
[2023-03-24 02:06:35] [INFO ] Deduced a trap composed of 247 places in 182 ms of which 1 ms to minimize.
[2023-03-24 02:06:35] [INFO ] Deduced a trap composed of 265 places in 179 ms of which 2 ms to minimize.
[2023-03-24 02:06:35] [INFO ] Deduced a trap composed of 268 places in 193 ms of which 0 ms to minimize.
[2023-03-24 02:06:36] [INFO ] Deduced a trap composed of 172 places in 187 ms of which 1 ms to minimize.
[2023-03-24 02:06:36] [INFO ] Deduced a trap composed of 253 places in 177 ms of which 0 ms to minimize.
[2023-03-24 02:06:36] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1715 ms
[2023-03-24 02:06:37] [INFO ] Deduced a trap composed of 200 places in 161 ms of which 1 ms to minimize.
[2023-03-24 02:06:37] [INFO ] Deduced a trap composed of 202 places in 175 ms of which 1 ms to minimize.
[2023-03-24 02:06:37] [INFO ] Deduced a trap composed of 217 places in 166 ms of which 1 ms to minimize.
[2023-03-24 02:06:37] [INFO ] Deduced a trap composed of 202 places in 168 ms of which 1 ms to minimize.
[2023-03-24 02:06:37] [INFO ] Deduced a trap composed of 210 places in 167 ms of which 1 ms to minimize.
[2023-03-24 02:06:38] [INFO ] Deduced a trap composed of 204 places in 165 ms of which 1 ms to minimize.
[2023-03-24 02:06:38] [INFO ] Deduced a trap composed of 198 places in 162 ms of which 1 ms to minimize.
[2023-03-24 02:06:38] [INFO ] Deduced a trap composed of 207 places in 162 ms of which 1 ms to minimize.
[2023-03-24 02:06:38] [INFO ] Deduced a trap composed of 207 places in 165 ms of which 1 ms to minimize.
[2023-03-24 02:06:38] [INFO ] Deduced a trap composed of 218 places in 167 ms of which 0 ms to minimize.
[2023-03-24 02:06:39] [INFO ] Deduced a trap composed of 215 places in 167 ms of which 1 ms to minimize.
[2023-03-24 02:06:39] [INFO ] Deduced a trap composed of 205 places in 176 ms of which 0 ms to minimize.
[2023-03-24 02:06:39] [INFO ] Deduced a trap composed of 199 places in 165 ms of which 1 ms to minimize.
[2023-03-24 02:06:39] [INFO ] Deduced a trap composed of 211 places in 167 ms of which 0 ms to minimize.
[2023-03-24 02:06:40] [INFO ] Deduced a trap composed of 204 places in 165 ms of which 1 ms to minimize.
[2023-03-24 02:06:40] [INFO ] Deduced a trap composed of 214 places in 165 ms of which 0 ms to minimize.
[2023-03-24 02:06:40] [INFO ] Deduced a trap composed of 201 places in 161 ms of which 1 ms to minimize.
[2023-03-24 02:06:40] [INFO ] Deduced a trap composed of 194 places in 166 ms of which 1 ms to minimize.
[2023-03-24 02:06:41] [INFO ] Deduced a trap composed of 190 places in 159 ms of which 1 ms to minimize.
[2023-03-24 02:06:41] [INFO ] Deduced a trap composed of 197 places in 163 ms of which 0 ms to minimize.
[2023-03-24 02:06:41] [INFO ] Deduced a trap composed of 203 places in 173 ms of which 0 ms to minimize.
[2023-03-24 02:06:41] [INFO ] Deduced a trap composed of 206 places in 159 ms of which 0 ms to minimize.
[2023-03-24 02:06:41] [INFO ] Deduced a trap composed of 219 places in 160 ms of which 1 ms to minimize.
[2023-03-24 02:06:42] [INFO ] Deduced a trap composed of 186 places in 176 ms of which 0 ms to minimize.
[2023-03-24 02:06:42] [INFO ] Deduced a trap composed of 191 places in 170 ms of which 1 ms to minimize.
[2023-03-24 02:06:42] [INFO ] Deduced a trap composed of 208 places in 161 ms of which 1 ms to minimize.
[2023-03-24 02:06:43] [INFO ] Deduced a trap composed of 217 places in 170 ms of which 1 ms to minimize.
[2023-03-24 02:06:43] [INFO ] Deduced a trap composed of 200 places in 171 ms of which 0 ms to minimize.
[2023-03-24 02:06:43] [INFO ] Deduced a trap composed of 194 places in 164 ms of which 0 ms to minimize.
[2023-03-24 02:06:43] [INFO ] Deduced a trap composed of 222 places in 166 ms of which 1 ms to minimize.
[2023-03-24 02:06:44] [INFO ] Deduced a trap composed of 203 places in 168 ms of which 1 ms to minimize.
[2023-03-24 02:06:44] [INFO ] Deduced a trap composed of 199 places in 175 ms of which 0 ms to minimize.
[2023-03-24 02:06:45] [INFO ] Deduced a trap composed of 212 places in 169 ms of which 0 ms to minimize.
[2023-03-24 02:06:45] [INFO ] Deduced a trap composed of 201 places in 165 ms of which 0 ms to minimize.
[2023-03-24 02:06:46] [INFO ] Deduced a trap composed of 196 places in 158 ms of which 0 ms to minimize.
[2023-03-24 02:06:47] [INFO ] Deduced a trap composed of 201 places in 172 ms of which 0 ms to minimize.
[2023-03-24 02:06:49] [INFO ] Deduced a trap composed of 197 places in 166 ms of which 1 ms to minimize.
[2023-03-24 02:06:58] [INFO ] Trap strengthening (SAT) tested/added 37/37 trap constraints in 21328 ms
[2023-03-24 02:06:58] [INFO ] After 23805ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :2
Attempting to minimize the solution found.
Minimization took 386 ms.
[2023-03-24 02:06:58] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :1
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 4 out of 484 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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 1 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 113 ms. Remains 411 /484 variables (removed 73) and now considering 577/650 (removed 73) transitions.
[2023-03-24 02:06:58] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2023-03-24 02:06:58] [INFO ] Computed 77 place invariants in 20 ms
[2023-03-24 02:06:59] [INFO ] Dead Transitions using invariants and state equation in 491 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 606 ms. Remains : 411/484 places, 577/650 transitions.
Incomplete random walk after 10001 steps, including 459 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-24 02:06:59] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-24 02:06:59] [INFO ] Invariant cache hit.
[2023-03-24 02:06:59] [INFO ] [Real]Absence check using 59 positive place invariants in 11 ms returned sat
[2023-03-24 02:06:59] [INFO ] [Real]Absence check using 59 positive and 18 generalized place invariants in 20 ms returned sat
[2023-03-24 02:06:59] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 02:06:59] [INFO ] [Nat]Absence check using 59 positive place invariants in 12 ms returned sat
[2023-03-24 02:06:59] [INFO ] [Nat]Absence check using 59 positive and 18 generalized place invariants in 21 ms returned sat
[2023-03-24 02:07:00] [INFO ] After 603ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 02:07:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 02:07:00] [INFO ] After 74ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-24 02:07:00] [INFO ] Deduced a trap composed of 134 places in 141 ms of which 1 ms to minimize.
[2023-03-24 02:07:00] [INFO ] Deduced a trap composed of 129 places in 138 ms of which 0 ms to minimize.
[2023-03-24 02:07:00] [INFO ] Deduced a trap composed of 125 places in 140 ms of which 1 ms to minimize.
[2023-03-24 02:07:00] [INFO ] Deduced a trap composed of 137 places in 148 ms of which 0 ms to minimize.
[2023-03-24 02:07:01] [INFO ] Deduced a trap composed of 125 places in 151 ms of which 0 ms to minimize.
[2023-03-24 02:07:01] [INFO ] Deduced a trap composed of 125 places in 155 ms of which 0 ms to minimize.
[2023-03-24 02:07:01] [INFO ] Deduced a trap composed of 116 places in 145 ms of which 1 ms to minimize.
[2023-03-24 02:07:01] [INFO ] Deduced a trap composed of 134 places in 153 ms of which 0 ms to minimize.
[2023-03-24 02:07:01] [INFO ] Deduced a trap composed of 119 places in 139 ms of which 1 ms to minimize.
[2023-03-24 02:07:01] [INFO ] Deduced a trap composed of 145 places in 143 ms of which 0 ms to minimize.
[2023-03-24 02:07:02] [INFO ] Deduced a trap composed of 139 places in 143 ms of which 0 ms to minimize.
[2023-03-24 02:07:02] [INFO ] Deduced a trap composed of 136 places in 149 ms of which 2 ms to minimize.
[2023-03-24 02:07:02] [INFO ] Deduced a trap composed of 115 places in 139 ms of which 0 ms to minimize.
[2023-03-24 02:07:02] [INFO ] Deduced a trap composed of 119 places in 143 ms of which 0 ms to minimize.
[2023-03-24 02:07:03] [INFO ] Deduced a trap composed of 126 places in 146 ms of which 0 ms to minimize.
[2023-03-24 02:07:03] [INFO ] Deduced a trap composed of 126 places in 146 ms of which 1 ms to minimize.
[2023-03-24 02:07:03] [INFO ] Deduced a trap composed of 132 places in 148 ms of which 0 ms to minimize.
[2023-03-24 02:07:04] [INFO ] Deduced a trap composed of 134 places in 142 ms of which 0 ms to minimize.
[2023-03-24 02:07:04] [INFO ] Deduced a trap composed of 125 places in 141 ms of which 1 ms to minimize.
[2023-03-24 02:07:04] [INFO ] Deduced a trap composed of 131 places in 141 ms of which 1 ms to minimize.
[2023-03-24 02:07:04] [INFO ] Deduced a trap composed of 116 places in 151 ms of which 1 ms to minimize.
[2023-03-24 02:07:05] [INFO ] Deduced a trap composed of 131 places in 147 ms of which 1 ms to minimize.
[2023-03-24 02:07:06] [INFO ] Deduced a trap composed of 128 places in 143 ms of which 4 ms to minimize.
[2023-03-24 02:07:07] [INFO ] Deduced a trap composed of 136 places in 149 ms of which 1 ms to minimize.
[2023-03-24 02:07:07] [INFO ] Deduced a trap composed of 125 places in 134 ms of which 0 ms to minimize.
[2023-03-24 02:07:08] [INFO ] Deduced a trap composed of 122 places in 139 ms of which 0 ms to minimize.
[2023-03-24 02:07:08] [INFO ] Deduced a trap composed of 132 places in 139 ms of which 0 ms to minimize.
[2023-03-24 02:07:09] [INFO ] Deduced a trap composed of 129 places in 139 ms of which 0 ms to minimize.
[2023-03-24 02:07:09] [INFO ] Deduced a trap composed of 119 places in 142 ms of which 0 ms to minimize.
[2023-03-24 02:07:09] [INFO ] Deduced a trap composed of 128 places in 137 ms of which 1 ms to minimize.
[2023-03-24 02:07:09] [INFO ] Deduced a trap composed of 133 places in 148 ms of which 1 ms to minimize.
[2023-03-24 02:07:09] [INFO ] Deduced a trap composed of 155 places in 146 ms of which 0 ms to minimize.
[2023-03-24 02:07:10] [INFO ] Deduced a trap composed of 132 places in 131 ms of which 1 ms to minimize.
[2023-03-24 02:07:10] [INFO ] Deduced a trap composed of 137 places in 143 ms of which 0 ms to minimize.
[2023-03-24 02:07:10] [INFO ] Deduced a trap composed of 129 places in 141 ms of which 1 ms to minimize.
[2023-03-24 02:07:10] [INFO ] Deduced a trap composed of 132 places in 136 ms of which 0 ms to minimize.
[2023-03-24 02:07:11] [INFO ] Deduced a trap composed of 126 places in 146 ms of which 0 ms to minimize.
[2023-03-24 02:07:11] [INFO ] Deduced a trap composed of 137 places in 137 ms of which 1 ms to minimize.
[2023-03-24 02:07:11] [INFO ] Deduced a trap composed of 137 places in 144 ms of which 0 ms to minimize.
[2023-03-24 02:07:12] [INFO ] Deduced a trap composed of 141 places in 142 ms of which 1 ms to minimize.
[2023-03-24 02:07:13] [INFO ] Deduced a trap composed of 136 places in 137 ms of which 1 ms to minimize.
[2023-03-24 02:07:13] [INFO ] Deduced a trap composed of 134 places in 141 ms of which 0 ms to minimize.
[2023-03-24 02:07:14] [INFO ] Deduced a trap composed of 134 places in 138 ms of which 0 ms to minimize.
[2023-03-24 02:07:14] [INFO ] Deduced a trap composed of 119 places in 150 ms of which 0 ms to minimize.
[2023-03-24 02:07:15] [INFO ] Deduced a trap composed of 128 places in 145 ms of which 1 ms to minimize.
[2023-03-24 02:07:15] [INFO ] Deduced a trap composed of 122 places in 141 ms of which 0 ms to minimize.
[2023-03-24 02:07:16] [INFO ] Deduced a trap composed of 141 places in 138 ms of which 0 ms to minimize.
[2023-03-24 02:07:24] [INFO ] Trap strengthening (SAT) tested/added 47/47 trap constraints in 24215 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
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-24 02:07:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 02:07:24] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 577/577 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 411 transition count 576
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 410 transition count 576
Applied a total of 2 rules in 36 ms. Remains 410 /411 variables (removed 1) and now considering 576/577 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 410/411 places, 576/577 transitions.
Incomplete random walk after 10000 steps, including 521 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 261710 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :{}
Probabilistic random walk after 261710 steps, saw 78474 distinct states, run finished after 3003 ms. (steps per millisecond=87 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-24 02:07:27] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
// Phase 1: matrix 572 rows 410 cols
[2023-03-24 02:07:27] [INFO ] Computed 77 place invariants in 21 ms
[2023-03-24 02:07:27] [INFO ] [Real]Absence check using 58 positive place invariants in 11 ms returned sat
[2023-03-24 02:07:27] [INFO ] [Real]Absence check using 58 positive and 19 generalized place invariants in 20 ms returned sat
[2023-03-24 02:07:27] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 02:07:27] [INFO ] [Nat]Absence check using 58 positive place invariants in 11 ms returned sat
[2023-03-24 02:07:27] [INFO ] [Nat]Absence check using 58 positive and 19 generalized place invariants in 22 ms returned sat
[2023-03-24 02:07:28] [INFO ] After 707ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 02:07:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 02:07:28] [INFO ] After 51ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-24 02:07:28] [INFO ] Deduced a trap composed of 135 places in 149 ms of which 1 ms to minimize.
[2023-03-24 02:07:28] [INFO ] Deduced a trap composed of 138 places in 143 ms of which 0 ms to minimize.
[2023-03-24 02:07:29] [INFO ] Deduced a trap composed of 125 places in 144 ms of which 1 ms to minimize.
[2023-03-24 02:07:29] [INFO ] Deduced a trap composed of 126 places in 149 ms of which 1 ms to minimize.
[2023-03-24 02:07:29] [INFO ] Deduced a trap composed of 140 places in 152 ms of which 0 ms to minimize.
[2023-03-24 02:07:29] [INFO ] Deduced a trap composed of 138 places in 142 ms of which 1 ms to minimize.
[2023-03-24 02:07:29] [INFO ] Deduced a trap composed of 110 places in 144 ms of which 1 ms to minimize.
[2023-03-24 02:07:29] [INFO ] Deduced a trap composed of 123 places in 134 ms of which 0 ms to minimize.
[2023-03-24 02:07:30] [INFO ] Deduced a trap composed of 122 places in 152 ms of which 0 ms to minimize.
[2023-03-24 02:07:30] [INFO ] Deduced a trap composed of 132 places in 142 ms of which 1 ms to minimize.
[2023-03-24 02:07:30] [INFO ] Deduced a trap composed of 137 places in 135 ms of which 0 ms to minimize.
[2023-03-24 02:07:31] [INFO ] Deduced a trap composed of 125 places in 143 ms of which 0 ms to minimize.
[2023-03-24 02:07:31] [INFO ] Deduced a trap composed of 142 places in 139 ms of which 1 ms to minimize.
[2023-03-24 02:07:31] [INFO ] Deduced a trap composed of 121 places in 151 ms of which 1 ms to minimize.
[2023-03-24 02:07:31] [INFO ] Deduced a trap composed of 131 places in 144 ms of which 0 ms to minimize.
[2023-03-24 02:07:31] [INFO ] Deduced a trap composed of 132 places in 147 ms of which 0 ms to minimize.
[2023-03-24 02:07:31] [INFO ] Deduced a trap composed of 125 places in 147 ms of which 1 ms to minimize.
[2023-03-24 02:07:32] [INFO ] Deduced a trap composed of 128 places in 141 ms of which 0 ms to minimize.
[2023-03-24 02:07:32] [INFO ] Deduced a trap composed of 136 places in 146 ms of which 0 ms to minimize.
[2023-03-24 02:07:32] [INFO ] Deduced a trap composed of 138 places in 144 ms of which 0 ms to minimize.
[2023-03-24 02:07:32] [INFO ] Deduced a trap composed of 128 places in 143 ms of which 0 ms to minimize.
[2023-03-24 02:07:32] [INFO ] Deduced a trap composed of 137 places in 148 ms of which 1 ms to minimize.
[2023-03-24 02:07:33] [INFO ] Deduced a trap composed of 130 places in 141 ms of which 1 ms to minimize.
[2023-03-24 02:07:33] [INFO ] Deduced a trap composed of 119 places in 147 ms of which 0 ms to minimize.
[2023-03-24 02:07:33] [INFO ] Deduced a trap composed of 119 places in 139 ms of which 0 ms to minimize.
[2023-03-24 02:07:33] [INFO ] Deduced a trap composed of 120 places in 144 ms of which 0 ms to minimize.
[2023-03-24 02:07:34] [INFO ] Deduced a trap composed of 132 places in 141 ms of which 1 ms to minimize.
[2023-03-24 02:07:43] [INFO ] Trap strengthening (SAT) tested/added 27/27 trap constraints in 14601 ms
[2023-03-24 02:07:43] [INFO ] After 14745ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-24 02:07:43] [INFO ] After 15553ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 1 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 28 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 28 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 25 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
[2023-03-24 02:07:43] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2023-03-24 02:07:43] [INFO ] Invariant cache hit.
[2023-03-24 02:07:43] [INFO ] Implicit Places using invariants in 542 ms returned []
[2023-03-24 02:07:43] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2023-03-24 02:07:43] [INFO ] Invariant cache hit.
[2023-03-24 02:07:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 02:07:47] [INFO ] Implicit Places using invariants and state equation in 3733 ms returned []
Implicit Place search using SMT with State Equation took 4277 ms to find 0 implicit places.
[2023-03-24 02:07:47] [INFO ] Redundant transitions in 38 ms returned []
[2023-03-24 02:07:47] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2023-03-24 02:07:47] [INFO ] Invariant cache hit.
[2023-03-24 02:07:48] [INFO ] Dead Transitions using invariants and state equation in 454 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4809 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 63 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-24 02:07:48] [INFO ] Computed 77 place invariants in 7 ms
[2023-03-24 02:07:48] [INFO ] [Real]Absence check using 59 positive place invariants in 11 ms returned sat
[2023-03-24 02:07:48] [INFO ] [Real]Absence check using 59 positive and 18 generalized place invariants in 19 ms returned sat
[2023-03-24 02:07:48] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 02:07:48] [INFO ] [Nat]Absence check using 59 positive place invariants in 11 ms returned sat
[2023-03-24 02:07:48] [INFO ] [Nat]Absence check using 59 positive and 18 generalized place invariants in 21 ms returned sat
[2023-03-24 02:07:48] [INFO ] After 558ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 02:07:49] [INFO ] Deduced a trap composed of 126 places in 137 ms of which 1 ms to minimize.
[2023-03-24 02:07:49] [INFO ] Deduced a trap composed of 132 places in 137 ms of which 0 ms to minimize.
[2023-03-24 02:07:49] [INFO ] Deduced a trap composed of 124 places in 140 ms of which 1 ms to minimize.
[2023-03-24 02:07:49] [INFO ] Deduced a trap composed of 129 places in 140 ms of which 0 ms to minimize.
[2023-03-24 02:07:49] [INFO ] Deduced a trap composed of 125 places in 135 ms of which 1 ms to minimize.
[2023-03-24 02:07:49] [INFO ] Deduced a trap composed of 132 places in 136 ms of which 1 ms to minimize.
[2023-03-24 02:07:50] [INFO ] Deduced a trap composed of 132 places in 134 ms of which 1 ms to minimize.
[2023-03-24 02:07:50] [INFO ] Deduced a trap composed of 123 places in 142 ms of which 0 ms to minimize.
[2023-03-24 02:07:50] [INFO ] Deduced a trap composed of 117 places in 133 ms of which 0 ms to minimize.
[2023-03-24 02:07:50] [INFO ] Deduced a trap composed of 135 places in 132 ms of which 1 ms to minimize.
[2023-03-24 02:07:50] [INFO ] Deduced a trap composed of 114 places in 135 ms of which 0 ms to minimize.
[2023-03-24 02:07:51] [INFO ] Deduced a trap composed of 135 places in 136 ms of which 0 ms to minimize.
[2023-03-24 02:07:51] [INFO ] Deduced a trap composed of 139 places in 131 ms of which 1 ms to minimize.
[2023-03-24 02:07:51] [INFO ] Deduced a trap composed of 138 places in 137 ms of which 0 ms to minimize.
[2023-03-24 02:07:51] [INFO ] Deduced a trap composed of 126 places in 136 ms of which 1 ms to minimize.
[2023-03-24 02:07:51] [INFO ] Deduced a trap composed of 132 places in 138 ms of which 0 ms to minimize.
[2023-03-24 02:07:51] [INFO ] Deduced a trap composed of 123 places in 137 ms of which 0 ms to minimize.
[2023-03-24 02:07:52] [INFO ] Deduced a trap composed of 126 places in 143 ms of which 0 ms to minimize.
[2023-03-24 02:07:52] [INFO ] Deduced a trap composed of 138 places in 138 ms of which 0 ms to minimize.
[2023-03-24 02:07:52] [INFO ] Deduced a trap composed of 123 places in 139 ms of which 0 ms to minimize.
[2023-03-24 02:07:52] [INFO ] Deduced a trap composed of 137 places in 144 ms of which 1 ms to minimize.
[2023-03-24 02:07:52] [INFO ] Deduced a trap composed of 130 places in 137 ms of which 1 ms to minimize.
[2023-03-24 02:07:53] [INFO ] Deduced a trap composed of 129 places in 130 ms of which 1 ms to minimize.
[2023-03-24 02:07:53] [INFO ] Deduced a trap composed of 121 places in 139 ms of which 2 ms to minimize.
[2023-03-24 02:07:53] [INFO ] Deduced a trap composed of 135 places in 141 ms of which 0 ms to minimize.
[2023-03-24 02:07:53] [INFO ] Deduced a trap composed of 135 places in 147 ms of which 1 ms to minimize.
[2023-03-24 02:07:53] [INFO ] Deduced a trap composed of 122 places in 143 ms of which 1 ms to minimize.
[2023-03-24 02:07:54] [INFO ] Deduced a trap composed of 124 places in 144 ms of which 0 ms to minimize.
[2023-03-24 02:07:54] [INFO ] Deduced a trap composed of 117 places in 137 ms of which 0 ms to minimize.
[2023-03-24 02:07:54] [INFO ] Deduced a trap composed of 123 places in 144 ms of which 0 ms to minimize.
[2023-03-24 02:07:54] [INFO ] Deduced a trap composed of 129 places in 134 ms of which 0 ms to minimize.
[2023-03-24 02:07:54] [INFO ] Deduced a trap composed of 123 places in 131 ms of which 0 ms to minimize.
[2023-03-24 02:07:55] [INFO ] Deduced a trap composed of 126 places in 140 ms of which 0 ms to minimize.
[2023-03-24 02:07:55] [INFO ] Deduced a trap composed of 129 places in 135 ms of which 0 ms to minimize.
[2023-03-24 02:07:55] [INFO ] Deduced a trap composed of 117 places in 139 ms of which 0 ms to minimize.
[2023-03-24 02:07:55] [INFO ] Deduced a trap composed of 138 places in 134 ms of which 1 ms to minimize.
[2023-03-24 02:07:55] [INFO ] Deduced a trap composed of 126 places in 137 ms of which 0 ms to minimize.
[2023-03-24 02:07:56] [INFO ] Deduced a trap composed of 117 places in 140 ms of which 1 ms to minimize.
[2023-03-24 02:07:56] [INFO ] Deduced a trap composed of 120 places in 140 ms of which 0 ms to minimize.
[2023-03-24 02:07:56] [INFO ] Deduced a trap composed of 119 places in 132 ms of which 0 ms to minimize.
[2023-03-24 02:07:56] [INFO ] Deduced a trap composed of 137 places in 129 ms of which 0 ms to minimize.
[2023-03-24 02:07:57] [INFO ] Deduced a trap composed of 135 places in 134 ms of which 1 ms to minimize.
[2023-03-24 02:07:57] [INFO ] Deduced a trap composed of 117 places in 142 ms of which 0 ms to minimize.
[2023-03-24 02:07:57] [INFO ] Deduced a trap composed of 120 places in 139 ms of which 0 ms to minimize.
[2023-03-24 02:07:57] [INFO ] Deduced a trap composed of 146 places in 139 ms of which 0 ms to minimize.
[2023-03-24 02:07:57] [INFO ] Deduced a trap composed of 123 places in 138 ms of which 1 ms to minimize.
[2023-03-24 02:07:57] [INFO ] Deduced a trap composed of 129 places in 139 ms of which 0 ms to minimize.
[2023-03-24 02:07:58] [INFO ] Deduced a trap composed of 138 places in 135 ms of which 1 ms to minimize.
[2023-03-24 02:07:58] [INFO ] Deduced a trap composed of 122 places in 140 ms of which 0 ms to minimize.
[2023-03-24 02:07:58] [INFO ] Deduced a trap composed of 114 places in 142 ms of which 1 ms to minimize.
[2023-03-24 02:07:59] [INFO ] Deduced a trap composed of 141 places in 139 ms of which 1 ms to minimize.
[2023-03-24 02:07:59] [INFO ] Deduced a trap composed of 124 places in 134 ms of which 0 ms to minimize.
[2023-03-24 02:07:59] [INFO ] Deduced a trap composed of 131 places in 140 ms of which 0 ms to minimize.
[2023-03-24 02:07:59] [INFO ] Deduced a trap composed of 120 places in 138 ms of which 1 ms to minimize.
[2023-03-24 02:08:00] [INFO ] Deduced a trap composed of 123 places in 136 ms of which 0 ms to minimize.
[2023-03-24 02:08:00] [INFO ] Deduced a trap composed of 124 places in 140 ms of which 0 ms to minimize.
[2023-03-24 02:08:00] [INFO ] Deduced a trap composed of 112 places in 141 ms of which 0 ms to minimize.
[2023-03-24 02:08:00] [INFO ] Deduced a trap composed of 126 places in 138 ms of which 1 ms to minimize.
[2023-03-24 02:08:00] [INFO ] Deduced a trap composed of 144 places in 142 ms of which 0 ms to minimize.
[2023-03-24 02:08:00] [INFO ] Deduced a trap composed of 138 places in 133 ms of which 1 ms to minimize.
[2023-03-24 02:08:01] [INFO ] Deduced a trap composed of 132 places in 137 ms of which 1 ms to minimize.
[2023-03-24 02:08:01] [INFO ] Deduced a trap composed of 115 places in 138 ms of which 1 ms to minimize.
[2023-03-24 02:08:01] [INFO ] Deduced a trap composed of 135 places in 135 ms of which 1 ms to minimize.
[2023-03-24 02:08:01] [INFO ] Deduced a trap composed of 122 places in 133 ms of which 1 ms to minimize.
[2023-03-24 02:08:01] [INFO ] Deduced a trap composed of 125 places in 137 ms of which 0 ms to minimize.
[2023-03-24 02:08:02] [INFO ] Deduced a trap composed of 126 places in 132 ms of which 1 ms to minimize.
[2023-03-24 02:08:02] [INFO ] Deduced a trap composed of 134 places in 132 ms of which 0 ms to minimize.
[2023-03-24 02:08:02] [INFO ] Deduced a trap composed of 134 places in 134 ms of which 0 ms to minimize.
[2023-03-24 02:08:02] [INFO ] Deduced a trap composed of 126 places in 129 ms of which 0 ms to minimize.
[2023-03-24 02:08:03] [INFO ] Deduced a trap composed of 126 places in 131 ms of which 1 ms to minimize.
[2023-03-24 02:08:03] [INFO ] Deduced a trap composed of 134 places in 136 ms of which 1 ms to minimize.
[2023-03-24 02:08:03] [INFO ] Deduced a trap composed of 125 places in 138 ms of which 1 ms to minimize.
[2023-03-24 02:08:03] [INFO ] Deduced a trap composed of 141 places in 134 ms of which 0 ms to minimize.
[2023-03-24 02:08:04] [INFO ] Deduced a trap composed of 123 places in 137 ms of which 0 ms to minimize.
[2023-03-24 02:08:04] [INFO ] Deduced a trap composed of 126 places in 137 ms of which 1 ms to minimize.
[2023-03-24 02:08:04] [INFO ] Deduced a trap composed of 120 places in 135 ms of which 1 ms to minimize.
[2023-03-24 02:08:04] [INFO ] Deduced a trap composed of 126 places in 140 ms of which 0 ms to minimize.
[2023-03-24 02:08:04] [INFO ] Deduced a trap composed of 129 places in 140 ms of which 1 ms to minimize.
[2023-03-24 02:08:05] [INFO ] Deduced a trap composed of 111 places in 139 ms of which 1 ms to minimize.
[2023-03-24 02:08:05] [INFO ] Deduced a trap composed of 123 places in 139 ms of which 1 ms to minimize.
[2023-03-24 02:08:05] [INFO ] Deduced a trap composed of 126 places in 139 ms of which 0 ms to minimize.
[2023-03-24 02:08:05] [INFO ] Deduced a trap composed of 127 places in 138 ms of which 0 ms to minimize.
[2023-03-24 02:08:06] [INFO ] Deduced a trap composed of 126 places in 138 ms of which 0 ms to minimize.
[2023-03-24 02:08:07] [INFO ] Deduced a trap composed of 117 places in 139 ms of which 0 ms to minimize.
[2023-03-24 02:08:07] [INFO ] Deduced a trap composed of 129 places in 144 ms of which 0 ms to minimize.
[2023-03-24 02:08:07] [INFO ] Deduced a trap composed of 123 places in 131 ms of which 1 ms to minimize.
[2023-03-24 02:08:07] [INFO ] Deduced a trap composed of 126 places in 130 ms of which 1 ms to minimize.
[2023-03-24 02:08:08] [INFO ] Deduced a trap composed of 129 places in 152 ms of which 0 ms to minimize.
[2023-03-24 02:08:17] [INFO ] Trap strengthening (SAT) tested/added 88/88 trap constraints in 28388 ms
[2023-03-24 02:08:17] [INFO ] After 29012ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-24 02:08:17] [INFO ] After 29115ms 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-24 02:08:17] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2023-03-24 02:08:17] [INFO ] Computed 77 place invariants in 8 ms
[2023-03-24 02:08:18] [INFO ] Dead Transitions using invariants and state equation in 681 ms found 0 transitions.
[2023-03-24 02:08:18] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-24 02:08:18] [INFO ] Invariant cache hit.
[2023-03-24 02:08:19] [INFO ] Implicit Places using invariants in 569 ms returned []
[2023-03-24 02:08:19] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-24 02:08:19] [INFO ] Invariant cache hit.
[2023-03-24 02:08:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 02:08:23] [INFO ] Implicit Places using invariants and state equation in 4722 ms returned []
Implicit Place search using SMT with State Equation took 5295 ms to find 0 implicit places.
[2023-03-24 02:08:23] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-24 02:08:23] [INFO ] Invariant cache hit.
[2023-03-24 02:08:24] [INFO ] Dead Transitions using invariants and state equation in 802 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 6797 ms. Remains : 483/484 places, 649/650 transitions.
Stuttering acceptance computed with spot in 432 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 301 steps with 19 reset in 8 ms.
FORMULA PolyORBNT-PT-S05J30-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-01 finished in 7310 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 15 ms. Remains 483 /484 variables (removed 1) and now considering 649/650 (removed 1) transitions.
[2023-03-24 02:08:25] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-24 02:08:25] [INFO ] Invariant cache hit.
[2023-03-24 02:08:25] [INFO ] Dead Transitions using invariants and state equation in 660 ms found 0 transitions.
[2023-03-24 02:08:25] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-24 02:08:25] [INFO ] Invariant cache hit.
[2023-03-24 02:08:26] [INFO ] Implicit Places using invariants in 540 ms returned []
[2023-03-24 02:08:26] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-24 02:08:26] [INFO ] Invariant cache hit.
[2023-03-24 02:08:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 02:08:31] [INFO ] Implicit Places using invariants and state equation in 5241 ms returned []
Implicit Place search using SMT with State Equation took 5782 ms to find 0 implicit places.
[2023-03-24 02:08:31] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-24 02:08:31] [INFO ] Invariant cache hit.
[2023-03-24 02:08:32] [INFO ] Dead Transitions using invariants and state equation in 755 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 7214 ms. Remains : 483/484 places, 649/650 transitions.
Stuttering acceptance computed with spot in 268 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 0 ms.
FORMULA PolyORBNT-PT-S05J30-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-02 finished in 7506 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 0 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 51 ms. Remains 443 /484 variables (removed 41) and now considering 609/650 (removed 41) transitions.
[2023-03-24 02:08:32] [INFO ] Flow matrix only has 605 transitions (discarded 4 similar events)
// Phase 1: matrix 605 rows 443 cols
[2023-03-24 02:08:32] [INFO ] Computed 77 place invariants in 7 ms
[2023-03-24 02:08:33] [INFO ] Dead Transitions using invariants and state equation in 568 ms found 0 transitions.
[2023-03-24 02:08:33] [INFO ] Flow matrix only has 605 transitions (discarded 4 similar events)
[2023-03-24 02:08:33] [INFO ] Invariant cache hit.
[2023-03-24 02:08:33] [INFO ] Implicit Places using invariants in 383 ms returned []
[2023-03-24 02:08:33] [INFO ] Flow matrix only has 605 transitions (discarded 4 similar events)
[2023-03-24 02:08:33] [INFO ] Invariant cache hit.
[2023-03-24 02:08:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 02:08:36] [INFO ] Implicit Places using invariants and state equation in 2589 ms returned []
Implicit Place search using SMT with State Equation took 2974 ms to find 0 implicit places.
[2023-03-24 02:08:36] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-24 02:08:36] [INFO ] Flow matrix only has 605 transitions (discarded 4 similar events)
[2023-03-24 02:08:36] [INFO ] Invariant cache hit.
[2023-03-24 02:08:36] [INFO ] Dead Transitions using invariants and state equation in 570 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 4187 ms. Remains : 443/484 places, 609/650 transitions.
Stuttering acceptance computed with spot in 107 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 15 steps with 1 reset in 3 ms.
FORMULA PolyORBNT-PT-S05J30-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-03 finished in 4319 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 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 42 ms. Remains 411 /484 variables (removed 73) and now considering 577/650 (removed 73) transitions.
[2023-03-24 02:08:36] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2023-03-24 02:08:36] [INFO ] Computed 77 place invariants in 14 ms
[2023-03-24 02:08:37] [INFO ] Dead Transitions using invariants and state equation in 444 ms found 0 transitions.
[2023-03-24 02:08:37] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-24 02:08:37] [INFO ] Invariant cache hit.
[2023-03-24 02:08:37] [INFO ] Implicit Places using invariants in 501 ms returned []
[2023-03-24 02:08:37] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-24 02:08:37] [INFO ] Invariant cache hit.
[2023-03-24 02:08:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 02:08:41] [INFO ] Implicit Places using invariants and state equation in 3979 ms returned []
Implicit Place search using SMT with State Equation took 4482 ms to find 0 implicit places.
[2023-03-24 02:08:41] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-24 02:08:41] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-24 02:08:41] [INFO ] Invariant cache hit.
[2023-03-24 02:08:42] [INFO ] Dead Transitions using invariants and state equation in 454 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 5438 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 5227 reset in 581 ms.
Product exploration explored 100000 steps with 5227 reset in 508 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 196 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 100 steps, including 5 resets, run visited all 2 properties in 5 ms. (steps per millisecond=20 )
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 251 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 100 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 121 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 15 ms. Remains 411 /411 variables (removed 0) and now considering 577/577 (removed 0) transitions.
[2023-03-24 02:08:44] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-24 02:08:44] [INFO ] Invariant cache hit.
[2023-03-24 02:08:44] [INFO ] Dead Transitions using invariants and state equation in 484 ms found 0 transitions.
[2023-03-24 02:08:44] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-24 02:08:44] [INFO ] Invariant cache hit.
[2023-03-24 02:08:45] [INFO ] Implicit Places using invariants in 504 ms returned []
[2023-03-24 02:08:45] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-24 02:08:45] [INFO ] Invariant cache hit.
[2023-03-24 02:08:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 02:08:48] [INFO ] Implicit Places using invariants and state equation in 3394 ms returned []
Implicit Place search using SMT with State Equation took 3900 ms to find 0 implicit places.
[2023-03-24 02:08:48] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-24 02:08:48] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-24 02:08:48] [INFO ] Invariant cache hit.
[2023-03-24 02:08:49] [INFO ] Dead Transitions using invariants and state equation in 461 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4884 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 179 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 136 steps, including 5 resets, run visited all 2 properties in 4 ms. (steps per millisecond=34 )
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 217 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 117 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)]
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 5287 reset in 449 ms.
Product exploration explored 100000 steps with 5300 reset in 483 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 12 ms. Remains 411 /411 variables (removed 0) and now considering 577/577 (removed 0) transitions.
[2023-03-24 02:08:51] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-24 02:08:51] [INFO ] Invariant cache hit.
[2023-03-24 02:08:51] [INFO ] Dead Transitions using invariants and state equation in 463 ms found 0 transitions.
[2023-03-24 02:08:51] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-24 02:08:51] [INFO ] Invariant cache hit.
[2023-03-24 02:08:52] [INFO ] Implicit Places using invariants in 496 ms returned []
[2023-03-24 02:08:52] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-24 02:08:52] [INFO ] Invariant cache hit.
[2023-03-24 02:08:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 02:08:55] [INFO ] Implicit Places using invariants and state equation in 3789 ms returned []
Implicit Place search using SMT with State Equation took 4287 ms to find 0 implicit places.
[2023-03-24 02:08:55] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-24 02:08:55] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-24 02:08:55] [INFO ] Invariant cache hit.
[2023-03-24 02:08:56] [INFO ] Dead Transitions using invariants and state equation in 471 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5250 ms. Remains : 411/411 places, 577/577 transitions.
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-04 finished in 19531 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 17 ms. Remains 483 /484 variables (removed 1) and now considering 649/650 (removed 1) transitions.
[2023-03-24 02:08:56] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2023-03-24 02:08:56] [INFO ] Computed 77 place invariants in 11 ms
[2023-03-24 02:08:57] [INFO ] Dead Transitions using invariants and state equation in 701 ms found 0 transitions.
[2023-03-24 02:08:57] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-24 02:08:57] [INFO ] Invariant cache hit.
[2023-03-24 02:08:57] [INFO ] Implicit Places using invariants in 600 ms returned []
[2023-03-24 02:08:57] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-24 02:08:57] [INFO ] Invariant cache hit.
[2023-03-24 02:08:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 02:09:03] [INFO ] Implicit Places using invariants and state equation in 5571 ms returned []
Implicit Place search using SMT with State Equation took 6174 ms to find 0 implicit places.
[2023-03-24 02:09:03] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-24 02:09:03] [INFO ] Invariant cache hit.
[2023-03-24 02:09:03] [INFO ] Dead Transitions using invariants and state equation in 646 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 7541 ms. Remains : 483/484 places, 649/650 transitions.
Stuttering acceptance computed with spot in 86 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 7644 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 0 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 44 ms. Remains 412 /484 variables (removed 72) and now considering 578/650 (removed 72) transitions.
[2023-03-24 02:09:04] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
// Phase 1: matrix 574 rows 412 cols
[2023-03-24 02:09:04] [INFO ] Computed 77 place invariants in 13 ms
[2023-03-24 02:09:04] [INFO ] Dead Transitions using invariants and state equation in 458 ms found 0 transitions.
[2023-03-24 02:09:04] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2023-03-24 02:09:04] [INFO ] Invariant cache hit.
[2023-03-24 02:09:05] [INFO ] Implicit Places using invariants in 460 ms returned []
[2023-03-24 02:09:05] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2023-03-24 02:09:05] [INFO ] Invariant cache hit.
[2023-03-24 02:09:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 02:09:08] [INFO ] Implicit Places using invariants and state equation in 3864 ms returned []
Implicit Place search using SMT with State Equation took 4327 ms to find 0 implicit places.
[2023-03-24 02:09:08] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-24 02:09:08] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
[2023-03-24 02:09:08] [INFO ] Invariant cache hit.
[2023-03-24 02:09:09] [INFO ] Dead Transitions using invariants and state equation in 490 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 5340 ms. Remains : 412/484 places, 578/650 transitions.
Stuttering acceptance computed with spot in 92 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 0 ms.
FORMULA PolyORBNT-PT-S05J30-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-07 finished in 5464 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 11 ms. Remains 483 /484 variables (removed 1) and now considering 649/650 (removed 1) transitions.
[2023-03-24 02:09:09] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2023-03-24 02:09:09] [INFO ] Computed 77 place invariants in 11 ms
[2023-03-24 02:09:10] [INFO ] Dead Transitions using invariants and state equation in 745 ms found 0 transitions.
[2023-03-24 02:09:10] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-24 02:09:10] [INFO ] Invariant cache hit.
[2023-03-24 02:09:10] [INFO ] Implicit Places using invariants in 587 ms returned []
[2023-03-24 02:09:10] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-24 02:09:10] [INFO ] Invariant cache hit.
[2023-03-24 02:09:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 02:09:15] [INFO ] Implicit Places using invariants and state equation in 4797 ms returned []
Implicit Place search using SMT with State Equation took 5391 ms to find 0 implicit places.
[2023-03-24 02:09:15] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-24 02:09:15] [INFO ] Invariant cache hit.
[2023-03-24 02:09:16] [INFO ] Dead Transitions using invariants and state equation in 772 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 6923 ms. Remains : 483/484 places, 649/650 transitions.
Stuttering acceptance computed with spot in 242 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 7186 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 13 ms. Remains 483 /484 variables (removed 1) and now considering 649/650 (removed 1) transitions.
[2023-03-24 02:09:16] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-24 02:09:16] [INFO ] Invariant cache hit.
[2023-03-24 02:09:17] [INFO ] Dead Transitions using invariants and state equation in 758 ms found 0 transitions.
[2023-03-24 02:09:17] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-24 02:09:17] [INFO ] Invariant cache hit.
[2023-03-24 02:09:18] [INFO ] Implicit Places using invariants in 580 ms returned []
[2023-03-24 02:09:18] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-24 02:09:18] [INFO ] Invariant cache hit.
[2023-03-24 02:09:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 02:09:22] [INFO ] Implicit Places using invariants and state equation in 4405 ms returned []
Implicit Place search using SMT with State Equation took 4987 ms to find 0 implicit places.
[2023-03-24 02:09:22] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-24 02:09:22] [INFO ] Invariant cache hit.
[2023-03-24 02:09:23] [INFO ] Dead Transitions using invariants and state equation in 737 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 6499 ms. Remains : 483/484 places, 649/650 transitions.
Stuttering acceptance computed with spot in 69 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 6587 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-24 02:09:23] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-24 02:09:23] [INFO ] Invariant cache hit.
[2023-03-24 02:09:24] [INFO ] Dead Transitions using invariants and state equation in 761 ms found 0 transitions.
[2023-03-24 02:09:24] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-24 02:09:24] [INFO ] Invariant cache hit.
[2023-03-24 02:09:24] [INFO ] Implicit Places using invariants in 588 ms returned []
[2023-03-24 02:09:24] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-24 02:09:24] [INFO ] Invariant cache hit.
[2023-03-24 02:09:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 02:09:29] [INFO ] Implicit Places using invariants and state equation in 5007 ms returned []
Implicit Place search using SMT with State Equation took 5597 ms to find 0 implicit places.
[2023-03-24 02:09:29] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-24 02:09:29] [INFO ] Invariant cache hit.
[2023-03-24 02:09:30] [INFO ] Dead Transitions using invariants and state equation in 722 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 7098 ms. Remains : 483/484 places, 649/650 transitions.
Stuttering acceptance computed with spot in 156 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 0 ms.
FORMULA PolyORBNT-PT-S05J30-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-11 finished in 7277 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 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 39 ms. Remains 411 /484 variables (removed 73) and now considering 577/650 (removed 73) transitions.
[2023-03-24 02:09:30] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2023-03-24 02:09:30] [INFO ] Computed 77 place invariants in 15 ms
[2023-03-24 02:09:31] [INFO ] Dead Transitions using invariants and state equation in 485 ms found 0 transitions.
[2023-03-24 02:09:31] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-24 02:09:31] [INFO ] Invariant cache hit.
[2023-03-24 02:09:31] [INFO ] Implicit Places using invariants in 484 ms returned []
[2023-03-24 02:09:31] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-24 02:09:31] [INFO ] Invariant cache hit.
[2023-03-24 02:09:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 02:09:34] [INFO ] Implicit Places using invariants and state equation in 3375 ms returned []
Implicit Place search using SMT with State Equation took 3861 ms to find 0 implicit places.
[2023-03-24 02:09:35] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-24 02:09:35] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-24 02:09:35] [INFO ] Invariant cache hit.
[2023-03-24 02:09:35] [INFO ] Dead Transitions using invariants and state equation in 456 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 4863 ms. Remains : 411/484 places, 577/650 transitions.
Stuttering acceptance computed with spot in 27 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 4878 reset in 441 ms.
Product exploration explored 100000 steps with 4910 reset in 465 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 120 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 46 ms :[(NOT p0)]
Finished random walk after 687 steps, including 32 resets, run visited all 1 properties in 10 ms. (steps per millisecond=68 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 162 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 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 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 16 ms. Remains 411 /411 variables (removed 0) and now considering 577/577 (removed 0) transitions.
[2023-03-24 02:09:36] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-24 02:09:36] [INFO ] Invariant cache hit.
[2023-03-24 02:09:37] [INFO ] Dead Transitions using invariants and state equation in 476 ms found 0 transitions.
[2023-03-24 02:09:37] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-24 02:09:37] [INFO ] Invariant cache hit.
[2023-03-24 02:09:37] [INFO ] Implicit Places using invariants in 487 ms returned []
[2023-03-24 02:09:37] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-24 02:09:37] [INFO ] Invariant cache hit.
[2023-03-24 02:09:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 02:09:41] [INFO ] Implicit Places using invariants and state equation in 3616 ms returned []
Implicit Place search using SMT with State Equation took 4105 ms to find 0 implicit places.
[2023-03-24 02:09:41] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-24 02:09:41] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-24 02:09:41] [INFO ] Invariant cache hit.
[2023-03-24 02:09:41] [INFO ] Dead Transitions using invariants and state equation in 453 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5065 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 115 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 45 ms :[(NOT p0)]
Finished random walk after 216 steps, including 9 resets, run visited all 1 properties in 4 ms. (steps per millisecond=54 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
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 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4938 reset in 436 ms.
Product exploration explored 100000 steps with 4914 reset in 457 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 28 ms. Remains 411 /411 variables (removed 0) and now considering 577/577 (removed 0) transitions.
[2023-03-24 02:09:43] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-24 02:09:43] [INFO ] Invariant cache hit.
[2023-03-24 02:09:43] [INFO ] Dead Transitions using invariants and state equation in 486 ms found 0 transitions.
[2023-03-24 02:09:43] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-24 02:09:43] [INFO ] Invariant cache hit.
[2023-03-24 02:09:44] [INFO ] Implicit Places using invariants in 480 ms returned []
[2023-03-24 02:09:44] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-24 02:09:44] [INFO ] Invariant cache hit.
[2023-03-24 02:09:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 02:09:48] [INFO ] Implicit Places using invariants and state equation in 3845 ms returned []
Implicit Place search using SMT with State Equation took 4327 ms to find 0 implicit places.
[2023-03-24 02:09:48] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-24 02:09:48] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-24 02:09:48] [INFO ] Invariant cache hit.
[2023-03-24 02:09:48] [INFO ] Dead Transitions using invariants and state equation in 462 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 17988 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-24 02:09:48] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2023-03-24 02:09:48] [INFO ] Computed 77 place invariants in 13 ms
[2023-03-24 02:09:49] [INFO ] Dead Transitions using invariants and state equation in 724 ms found 0 transitions.
[2023-03-24 02:09:49] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-24 02:09:49] [INFO ] Invariant cache hit.
[2023-03-24 02:09:49] [INFO ] Implicit Places using invariants in 546 ms returned []
[2023-03-24 02:09:49] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-24 02:09:49] [INFO ] Invariant cache hit.
[2023-03-24 02:09:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 02:09:54] [INFO ] Implicit Places using invariants and state equation in 4477 ms returned []
Implicit Place search using SMT with State Equation took 5025 ms to find 0 implicit places.
[2023-03-24 02:09:54] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2023-03-24 02:09:54] [INFO ] Invariant cache hit.
[2023-03-24 02:09:55] [INFO ] Dead Transitions using invariants and state equation in 753 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 6515 ms. Remains : 483/484 places, 649/650 transitions.
Stuttering acceptance computed with spot in 238 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 6778 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-24 02:09:55] [INFO ] Flatten gal took : 44 ms
[2023-03-24 02:09:55] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-24 02:09:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 484 places, 650 transitions and 3104 arcs took 8 ms.
Total runtime 209061 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1836/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1836/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : PolyORBNT-PT-S05J30-LTLFireability-04
Could not compute solution for formula : PolyORBNT-PT-S05J30-LTLFireability-12

BK_STOP 1679623796973

--------------------
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
mcc2023
ltl formula name PolyORBNT-PT-S05J30-LTLFireability-04
ltl formula formula --ltl=/tmp/1836/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 484 places, 650 transitions and 3104 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.020 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1836/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1836/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1836/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1836/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name PolyORBNT-PT-S05J30-LTLFireability-12
ltl formula formula --ltl=/tmp/1836/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 484 places, 650 transitions and 3104 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.020 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1836/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1836/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1836/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1836/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is 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 r297-tall-167873950800724"
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 ;