Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r168-tall-165277017200820.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
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 r168-tall-165277017200820
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 22K Apr 30 03:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 140K Apr 30 03:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 49K Apr 30 03:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 212K Apr 30 03:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 21K May 9 08:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 9 08:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 17K May 9 08:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 9 08:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K May 9 08:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 11K May 9 08:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 1.2M May 10 09:34 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 1652958507758

Running Version 202205111006
[2022-05-19 11:08:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-19 11:08:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 11:08:29] [INFO ] Load time of PNML (sax parser for PT used): 173 ms
[2022-05-19 11:08:29] [INFO ] Transformed 489 places.
[2022-05-19 11:08:29] [INFO ] Transformed 1400 transitions.
[2022-05-19 11:08:29] [INFO ] Parsed PT model containing 489 places and 1400 transitions in 286 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
FORMULA PolyORBNT-PT-S05J30-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J30-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J30-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J30-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 119 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 63 ms. Remains 484 /489 variables (removed 5) and now considering 745/745 (removed 0) transitions.
[2022-05-19 11:08:29] [INFO ] Flow matrix only has 741 transitions (discarded 4 similar events)
// Phase 1: matrix 741 rows 484 cols
[2022-05-19 11:08:29] [INFO ] Computed 77 place invariants in 58 ms
[2022-05-19 11:08:30] [INFO ] Dead Transitions using invariants and state equation in 938 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.
[2022-05-19 11:08:30] [INFO ] Flow matrix only has 646 transitions (discarded 4 similar events)
// Phase 1: matrix 646 rows 484 cols
[2022-05-19 11:08:30] [INFO ] Computed 77 place invariants in 18 ms
[2022-05-19 11:08:30] [INFO ] Implicit Places using invariants in 553 ms returned []
[2022-05-19 11:08:30] [INFO ] Flow matrix only has 646 transitions (discarded 4 similar events)
// Phase 1: matrix 646 rows 484 cols
[2022-05-19 11:08:30] [INFO ] Computed 77 place invariants in 13 ms
[2022-05-19 11:08:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 11:08:35] [INFO ] Implicit Places using invariants and state equation in 4582 ms returned []
Implicit Place search using SMT with State Equation took 5140 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 14 ms. Remains 484 /484 variables (removed 0) and now considering 650/650 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 484/489 places, 650/745 transitions.
Support contains 119 out of 484 places after structural reductions.
[2022-05-19 11:08:35] [INFO ] Flatten gal took : 140 ms
[2022-05-19 11:08:35] [INFO ] Flatten gal took : 71 ms
[2022-05-19 11:08:36] [INFO ] Input system was already deterministic with 650 transitions.
Incomplete random walk after 10001 steps, including 703 resets, run finished after 617 ms. (steps per millisecond=16 ) properties (out of 20) seen :13
Incomplete Best-First random walk after 10000 steps, including 170 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 178 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 145 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10000 steps, including 183 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 149 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 5) seen :1
Running SMT prover for 4 properties.
[2022-05-19 11:08:37] [INFO ] Flow matrix only has 646 transitions (discarded 4 similar events)
// Phase 1: matrix 646 rows 484 cols
[2022-05-19 11:08:37] [INFO ] Computed 77 place invariants in 8 ms
[2022-05-19 11:08:37] [INFO ] [Real]Absence check using 59 positive place invariants in 22 ms returned sat
[2022-05-19 11:08:37] [INFO ] [Real]Absence check using 59 positive and 18 generalized place invariants in 17 ms returned sat
[2022-05-19 11:08:37] [INFO ] After 226ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2022-05-19 11:08:37] [INFO ] [Nat]Absence check using 59 positive place invariants in 14 ms returned sat
[2022-05-19 11:08:37] [INFO ] [Nat]Absence check using 59 positive and 18 generalized place invariants in 20 ms returned sat
[2022-05-19 11:08:38] [INFO ] After 665ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2022-05-19 11:08:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 11:08:38] [INFO ] After 82ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2022-05-19 11:08:38] [INFO ] Deduced a trap composed of 200 places in 185 ms of which 4 ms to minimize.
[2022-05-19 11:08:38] [INFO ] Deduced a trap composed of 209 places in 209 ms of which 2 ms to minimize.
[2022-05-19 11:08:39] [INFO ] Deduced a trap composed of 193 places in 159 ms of which 1 ms to minimize.
[2022-05-19 11:08:39] [INFO ] Deduced a trap composed of 212 places in 145 ms of which 1 ms to minimize.
[2022-05-19 11:08:39] [INFO ] Deduced a trap composed of 185 places in 149 ms of which 1 ms to minimize.
[2022-05-19 11:08:39] [INFO ] Deduced a trap composed of 204 places in 158 ms of which 0 ms to minimize.
[2022-05-19 11:08:39] [INFO ] Deduced a trap composed of 201 places in 175 ms of which 1 ms to minimize.
[2022-05-19 11:08:40] [INFO ] Deduced a trap composed of 210 places in 159 ms of which 0 ms to minimize.
[2022-05-19 11:08:40] [INFO ] Deduced a trap composed of 201 places in 151 ms of which 0 ms to minimize.
[2022-05-19 11:08:40] [INFO ] Deduced a trap composed of 198 places in 146 ms of which 1 ms to minimize.
[2022-05-19 11:08:40] [INFO ] Deduced a trap composed of 215 places in 147 ms of which 1 ms to minimize.
[2022-05-19 11:08:41] [INFO ] Deduced a trap composed of 203 places in 145 ms of which 1 ms to minimize.
[2022-05-19 11:08:41] [INFO ] Deduced a trap composed of 210 places in 143 ms of which 1 ms to minimize.
[2022-05-19 11:08:41] [INFO ] Deduced a trap composed of 210 places in 153 ms of which 1 ms to minimize.
[2022-05-19 11:08:41] [INFO ] Deduced a trap composed of 204 places in 138 ms of which 0 ms to minimize.
[2022-05-19 11:08:41] [INFO ] Deduced a trap composed of 210 places in 151 ms of which 0 ms to minimize.
[2022-05-19 11:08:42] [INFO ] Deduced a trap composed of 212 places in 159 ms of which 1 ms to minimize.
[2022-05-19 11:08:42] [INFO ] Deduced a trap composed of 205 places in 152 ms of which 0 ms to minimize.
[2022-05-19 11:08:42] [INFO ] Deduced a trap composed of 196 places in 153 ms of which 0 ms to minimize.
[2022-05-19 11:08:42] [INFO ] Deduced a trap composed of 204 places in 151 ms of which 1 ms to minimize.
[2022-05-19 11:08:43] [INFO ] Deduced a trap composed of 208 places in 146 ms of which 1 ms to minimize.
[2022-05-19 11:08:43] [INFO ] Deduced a trap composed of 209 places in 147 ms of which 1 ms to minimize.
[2022-05-19 11:08:43] [INFO ] Deduced a trap composed of 196 places in 151 ms of which 0 ms to minimize.
[2022-05-19 11:08:43] [INFO ] Deduced a trap composed of 228 places in 146 ms of which 1 ms to minimize.
[2022-05-19 11:08:44] [INFO ] Deduced a trap composed of 195 places in 140 ms of which 1 ms to minimize.
[2022-05-19 11:08:44] [INFO ] Deduced a trap composed of 214 places in 149 ms of which 1 ms to minimize.
[2022-05-19 11:08:44] [INFO ] Deduced a trap composed of 208 places in 155 ms of which 0 ms to minimize.
[2022-05-19 11:08:44] [INFO ] Deduced a trap composed of 206 places in 151 ms of which 1 ms to minimize.
[2022-05-19 11:08:44] [INFO ] Deduced a trap composed of 196 places in 140 ms of which 1 ms to minimize.
[2022-05-19 11:08:45] [INFO ] Deduced a trap composed of 190 places in 149 ms of which 1 ms to minimize.
[2022-05-19 11:08:45] [INFO ] Deduced a trap composed of 202 places in 184 ms of which 0 ms to minimize.
[2022-05-19 11:08:45] [INFO ] Deduced a trap composed of 197 places in 153 ms of which 1 ms to minimize.
[2022-05-19 11:08:45] [INFO ] Deduced a trap composed of 208 places in 148 ms of which 0 ms to minimize.
[2022-05-19 11:08:46] [INFO ] Deduced a trap composed of 204 places in 148 ms of which 1 ms to minimize.
[2022-05-19 11:08:46] [INFO ] Deduced a trap composed of 207 places in 186 ms of which 5 ms to minimize.
[2022-05-19 11:08:46] [INFO ] Deduced a trap composed of 196 places in 150 ms of which 1 ms to minimize.
[2022-05-19 11:08:46] [INFO ] Deduced a trap composed of 198 places in 146 ms of which 1 ms to minimize.
[2022-05-19 11:08:46] [INFO ] Deduced a trap composed of 198 places in 144 ms of which 0 ms to minimize.
[2022-05-19 11:08:47] [INFO ] Deduced a trap composed of 211 places in 145 ms of which 0 ms to minimize.
[2022-05-19 11:08:47] [INFO ] Deduced a trap composed of 209 places in 150 ms of which 1 ms to minimize.
[2022-05-19 11:08:47] [INFO ] Deduced a trap composed of 213 places in 150 ms of which 0 ms to minimize.
[2022-05-19 11:08:47] [INFO ] Deduced a trap composed of 208 places in 143 ms of which 0 ms to minimize.
[2022-05-19 11:08:47] [INFO ] Deduced a trap composed of 199 places in 150 ms of which 1 ms to minimize.
[2022-05-19 11:08:48] [INFO ] Deduced a trap composed of 199 places in 157 ms of which 0 ms to minimize.
[2022-05-19 11:08:48] [INFO ] Deduced a trap composed of 215 places in 147 ms of which 0 ms to minimize.
[2022-05-19 11:08:48] [INFO ] Deduced a trap composed of 210 places in 162 ms of which 0 ms to minimize.
[2022-05-19 11:08:49] [INFO ] Deduced a trap composed of 193 places in 149 ms of which 1 ms to minimize.
[2022-05-19 11:08:50] [INFO ] Deduced a trap composed of 184 places in 173 ms of which 1 ms to minimize.
[2022-05-19 11:08:59] [INFO ] Trap strengthening (SAT) tested/added 48/48 trap constraints in 20970 ms
[2022-05-19 11:08:59] [INFO ] After 21365ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 61 ms.
[2022-05-19 11:08:59] [INFO ] After 22255ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 484 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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 2 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 159 ms. Remains 412 /484 variables (removed 72) and now considering 578/650 (removed 72) transitions.
[2022-05-19 11:08:59] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
// Phase 1: matrix 574 rows 412 cols
[2022-05-19 11:08:59] [INFO ] Computed 77 place invariants in 7 ms
[2022-05-19 11:09:00] [INFO ] Dead Transitions using invariants and state equation in 481 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 412/484 places, 578/650 transitions.
Incomplete random walk after 10000 steps, including 478 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-19 11:09:00] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
// Phase 1: matrix 574 rows 412 cols
[2022-05-19 11:09:00] [INFO ] Computed 77 place invariants in 24 ms
[2022-05-19 11:09:00] [INFO ] [Real]Absence check using 59 positive place invariants in 25 ms returned sat
[2022-05-19 11:09:00] [INFO ] [Real]Absence check using 59 positive and 18 generalized place invariants in 16 ms returned sat
[2022-05-19 11:09:00] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 11:09:00] [INFO ] [Nat]Absence check using 59 positive place invariants in 10 ms returned sat
[2022-05-19 11:09:00] [INFO ] [Nat]Absence check using 59 positive and 18 generalized place invariants in 17 ms returned sat
[2022-05-19 11:09:00] [INFO ] After 232ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 11:09:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 11:09:00] [INFO ] After 31ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 11:09:01] [INFO ] Deduced a trap composed of 127 places in 132 ms of which 0 ms to minimize.
[2022-05-19 11:09:01] [INFO ] Deduced a trap composed of 128 places in 152 ms of which 1 ms to minimize.
[2022-05-19 11:09:01] [INFO ] Deduced a trap composed of 129 places in 140 ms of which 0 ms to minimize.
[2022-05-19 11:09:01] [INFO ] Deduced a trap composed of 132 places in 161 ms of which 0 ms to minimize.
[2022-05-19 11:09:02] [INFO ] Deduced a trap composed of 135 places in 132 ms of which 0 ms to minimize.
[2022-05-19 11:09:02] [INFO ] Deduced a trap composed of 129 places in 133 ms of which 0 ms to minimize.
[2022-05-19 11:09:02] [INFO ] Deduced a trap composed of 133 places in 135 ms of which 1 ms to minimize.
[2022-05-19 11:09:02] [INFO ] Deduced a trap composed of 138 places in 126 ms of which 1 ms to minimize.
[2022-05-19 11:09:02] [INFO ] Deduced a trap composed of 126 places in 131 ms of which 1 ms to minimize.
[2022-05-19 11:09:02] [INFO ] Deduced a trap composed of 141 places in 123 ms of which 0 ms to minimize.
[2022-05-19 11:09:03] [INFO ] Deduced a trap composed of 130 places in 128 ms of which 1 ms to minimize.
[2022-05-19 11:09:03] [INFO ] Deduced a trap composed of 127 places in 128 ms of which 1 ms to minimize.
[2022-05-19 11:09:03] [INFO ] Deduced a trap composed of 123 places in 126 ms of which 1 ms to minimize.
[2022-05-19 11:09:03] [INFO ] Deduced a trap composed of 123 places in 131 ms of which 1 ms to minimize.
[2022-05-19 11:09:03] [INFO ] Deduced a trap composed of 144 places in 135 ms of which 0 ms to minimize.
[2022-05-19 11:09:03] [INFO ] Deduced a trap composed of 133 places in 119 ms of which 1 ms to minimize.
[2022-05-19 11:09:04] [INFO ] Deduced a trap composed of 135 places in 130 ms of which 1 ms to minimize.
[2022-05-19 11:09:04] [INFO ] Deduced a trap composed of 147 places in 128 ms of which 2 ms to minimize.
[2022-05-19 11:09:04] [INFO ] Deduced a trap composed of 117 places in 132 ms of which 1 ms to minimize.
[2022-05-19 11:09:04] [INFO ] Deduced a trap composed of 126 places in 127 ms of which 2 ms to minimize.
[2022-05-19 11:09:04] [INFO ] Deduced a trap composed of 135 places in 125 ms of which 0 ms to minimize.
[2022-05-19 11:09:05] [INFO ] Deduced a trap composed of 132 places in 138 ms of which 0 ms to minimize.
[2022-05-19 11:09:05] [INFO ] Deduced a trap composed of 120 places in 138 ms of which 1 ms to minimize.
[2022-05-19 11:09:05] [INFO ] Deduced a trap composed of 129 places in 125 ms of which 1 ms to minimize.
[2022-05-19 11:09:05] [INFO ] Deduced a trap composed of 124 places in 162 ms of which 0 ms to minimize.
[2022-05-19 11:09:05] [INFO ] Deduced a trap composed of 129 places in 135 ms of which 0 ms to minimize.
[2022-05-19 11:09:06] [INFO ] Deduced a trap composed of 143 places in 137 ms of which 0 ms to minimize.
[2022-05-19 11:09:06] [INFO ] Deduced a trap composed of 123 places in 133 ms of which 0 ms to minimize.
[2022-05-19 11:09:06] [INFO ] Deduced a trap composed of 126 places in 134 ms of which 0 ms to minimize.
[2022-05-19 11:09:06] [INFO ] Deduced a trap composed of 135 places in 126 ms of which 1 ms to minimize.
[2022-05-19 11:09:10] [INFO ] Deduced a trap composed of 120 places in 141 ms of which 0 ms to minimize.
[2022-05-19 11:09:19] [INFO ] Trap strengthening (SAT) tested/added 31/31 trap constraints in 18359 ms
[2022-05-19 11:09:19] [INFO ] After 18482ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-19 11:09:19] [INFO ] After 18832ms 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 412 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 412/412 places, 578/578 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 412 transition count 577
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 411 transition count 577
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 411 transition count 576
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 410 transition count 576
Applied a total of 4 rules in 42 ms. Remains 410 /412 variables (removed 2) and now considering 576/578 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 410/412 places, 576/578 transitions.
Incomplete random walk after 10000 steps, including 533 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 284115 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :{}
Probabilistic random walk after 284115 steps, saw 85192 distinct states, run finished after 3002 ms. (steps per millisecond=94 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-19 11:09:22] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
// Phase 1: matrix 572 rows 410 cols
[2022-05-19 11:09:22] [INFO ] Computed 77 place invariants in 7 ms
[2022-05-19 11:09:22] [INFO ] [Real]Absence check using 58 positive place invariants in 9 ms returned sat
[2022-05-19 11:09:22] [INFO ] [Real]Absence check using 58 positive and 19 generalized place invariants in 20 ms returned sat
[2022-05-19 11:09:22] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 11:09:22] [INFO ] [Nat]Absence check using 58 positive place invariants in 10 ms returned sat
[2022-05-19 11:09:22] [INFO ] [Nat]Absence check using 58 positive and 19 generalized place invariants in 20 ms returned sat
[2022-05-19 11:09:23] [INFO ] After 906ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 11:09:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 11:09:23] [INFO ] After 25ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 11:09:23] [INFO ] Deduced a trap composed of 133 places in 128 ms of which 1 ms to minimize.
[2022-05-19 11:09:23] [INFO ] Deduced a trap composed of 142 places in 124 ms of which 0 ms to minimize.
[2022-05-19 11:09:24] [INFO ] Deduced a trap composed of 126 places in 121 ms of which 0 ms to minimize.
[2022-05-19 11:09:24] [INFO ] Deduced a trap composed of 118 places in 121 ms of which 1 ms to minimize.
[2022-05-19 11:09:24] [INFO ] Deduced a trap composed of 144 places in 123 ms of which 1 ms to minimize.
[2022-05-19 11:09:24] [INFO ] Deduced a trap composed of 124 places in 130 ms of which 1 ms to minimize.
[2022-05-19 11:09:24] [INFO ] Deduced a trap composed of 145 places in 122 ms of which 1 ms to minimize.
[2022-05-19 11:09:24] [INFO ] Deduced a trap composed of 130 places in 129 ms of which 1 ms to minimize.
[2022-05-19 11:09:25] [INFO ] Deduced a trap composed of 128 places in 131 ms of which 0 ms to minimize.
[2022-05-19 11:09:25] [INFO ] Deduced a trap composed of 136 places in 124 ms of which 0 ms to minimize.
[2022-05-19 11:09:25] [INFO ] Deduced a trap composed of 132 places in 128 ms of which 0 ms to minimize.
[2022-05-19 11:09:25] [INFO ] Deduced a trap composed of 137 places in 123 ms of which 1 ms to minimize.
[2022-05-19 11:09:25] [INFO ] Deduced a trap composed of 134 places in 127 ms of which 0 ms to minimize.
[2022-05-19 11:09:26] [INFO ] Deduced a trap composed of 120 places in 130 ms of which 0 ms to minimize.
[2022-05-19 11:09:26] [INFO ] Deduced a trap composed of 143 places in 124 ms of which 1 ms to minimize.
[2022-05-19 11:09:26] [INFO ] Deduced a trap composed of 146 places in 128 ms of which 0 ms to minimize.
[2022-05-19 11:09:26] [INFO ] Deduced a trap composed of 141 places in 129 ms of which 0 ms to minimize.
[2022-05-19 11:09:27] [INFO ] Deduced a trap composed of 134 places in 130 ms of which 1 ms to minimize.
[2022-05-19 11:09:28] [INFO ] Deduced a trap composed of 127 places in 127 ms of which 1 ms to minimize.
[2022-05-19 11:09:33] [INFO ] Deduced a trap composed of 117 places in 132 ms of which 0 ms to minimize.
[2022-05-19 11:09:34] [INFO ] Deduced a trap composed of 131 places in 134 ms of which 0 ms to minimize.
[2022-05-19 11:09:35] [INFO ] Deduced a trap composed of 122 places in 132 ms of which 0 ms to minimize.
[2022-05-19 11:09:35] [INFO ] Deduced a trap composed of 138 places in 129 ms of which 0 ms to minimize.
[2022-05-19 11:09:42] [INFO ] Deduced a trap composed of 135 places in 128 ms of which 1 ms to minimize.
[2022-05-19 11:09:42] [INFO ] Deduced a trap composed of 131 places in 131 ms of which 0 ms to minimize.
[2022-05-19 11:09:47] [INFO ] Trap strengthening (SAT) tested/added 25/25 trap constraints in 23970 ms
[2022-05-19 11:09:47] [INFO ] After 24004ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-19 11:09:47] [INFO ] After 25014ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 410/410 places, 576/576 transitions.
Applied a total of 0 rules in 23 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 576/576 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 410/410 places, 576/576 transitions.
Applied a total of 0 rules in 18 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
[2022-05-19 11:09:47] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
// Phase 1: matrix 572 rows 410 cols
[2022-05-19 11:09:47] [INFO ] Computed 77 place invariants in 7 ms
[2022-05-19 11:09:48] [INFO ] Implicit Places using invariants in 446 ms returned []
[2022-05-19 11:09:48] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
// Phase 1: matrix 572 rows 410 cols
[2022-05-19 11:09:48] [INFO ] Computed 77 place invariants in 11 ms
[2022-05-19 11:09:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 11:09:51] [INFO ] Implicit Places using invariants and state equation in 3696 ms returned []
Implicit Place search using SMT with State Equation took 4145 ms to find 0 implicit places.
[2022-05-19 11:09:51] [INFO ] Redundant transitions in 43 ms returned []
[2022-05-19 11:09:51] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
// Phase 1: matrix 572 rows 410 cols
[2022-05-19 11:09:51] [INFO ] Computed 77 place invariants in 15 ms
[2022-05-19 11:09:52] [INFO ] Dead Transitions using invariants and state equation in 408 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 0 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 62 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
[2022-05-19 11:09:52] [INFO ] Computed 77 place invariants in 6 ms
[2022-05-19 11:09:52] [INFO ] [Real]Absence check using 59 positive place invariants in 9 ms returned sat
[2022-05-19 11:09:52] [INFO ] [Real]Absence check using 59 positive and 18 generalized place invariants in 18 ms returned sat
[2022-05-19 11:09:52] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 11:09:52] [INFO ] [Nat]Absence check using 59 positive place invariants in 8 ms returned sat
[2022-05-19 11:09:52] [INFO ] [Nat]Absence check using 59 positive and 18 generalized place invariants in 20 ms returned sat
[2022-05-19 11:09:52] [INFO ] After 423ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 11:09:53] [INFO ] Deduced a trap composed of 120 places in 125 ms of which 1 ms to minimize.
[2022-05-19 11:09:53] [INFO ] Deduced a trap composed of 132 places in 125 ms of which 1 ms to minimize.
[2022-05-19 11:09:53] [INFO ] Deduced a trap composed of 135 places in 126 ms of which 0 ms to minimize.
[2022-05-19 11:09:53] [INFO ] Deduced a trap composed of 135 places in 122 ms of which 0 ms to minimize.
[2022-05-19 11:09:53] [INFO ] Deduced a trap composed of 126 places in 121 ms of which 1 ms to minimize.
[2022-05-19 11:09:53] [INFO ] Deduced a trap composed of 129 places in 127 ms of which 0 ms to minimize.
[2022-05-19 11:09:54] [INFO ] Deduced a trap composed of 129 places in 125 ms of which 1 ms to minimize.
[2022-05-19 11:09:54] [INFO ] Deduced a trap composed of 114 places in 126 ms of which 1 ms to minimize.
[2022-05-19 11:09:54] [INFO ] Deduced a trap composed of 129 places in 119 ms of which 0 ms to minimize.
[2022-05-19 11:09:54] [INFO ] Deduced a trap composed of 132 places in 127 ms of which 0 ms to minimize.
[2022-05-19 11:09:54] [INFO ] Deduced a trap composed of 126 places in 125 ms of which 1 ms to minimize.
[2022-05-19 11:09:54] [INFO ] Deduced a trap composed of 114 places in 125 ms of which 1 ms to minimize.
[2022-05-19 11:09:55] [INFO ] Deduced a trap composed of 120 places in 124 ms of which 1 ms to minimize.
[2022-05-19 11:09:55] [INFO ] Deduced a trap composed of 129 places in 117 ms of which 0 ms to minimize.
[2022-05-19 11:09:55] [INFO ] Deduced a trap composed of 120 places in 113 ms of which 0 ms to minimize.
[2022-05-19 11:09:55] [INFO ] Deduced a trap composed of 126 places in 119 ms of which 0 ms to minimize.
[2022-05-19 11:09:55] [INFO ] Deduced a trap composed of 123 places in 120 ms of which 1 ms to minimize.
[2022-05-19 11:09:55] [INFO ] Deduced a trap composed of 120 places in 122 ms of which 1 ms to minimize.
[2022-05-19 11:09:56] [INFO ] Deduced a trap composed of 116 places in 113 ms of which 0 ms to minimize.
[2022-05-19 11:09:56] [INFO ] Deduced a trap composed of 123 places in 113 ms of which 1 ms to minimize.
[2022-05-19 11:09:56] [INFO ] Deduced a trap composed of 129 places in 115 ms of which 0 ms to minimize.
[2022-05-19 11:09:56] [INFO ] Deduced a trap composed of 135 places in 123 ms of which 1 ms to minimize.
[2022-05-19 11:09:56] [INFO ] Deduced a trap composed of 139 places in 128 ms of which 1 ms to minimize.
[2022-05-19 11:09:56] [INFO ] Deduced a trap composed of 124 places in 124 ms of which 1 ms to minimize.
[2022-05-19 11:09:56] [INFO ] Deduced a trap composed of 132 places in 123 ms of which 0 ms to minimize.
[2022-05-19 11:09:57] [INFO ] Deduced a trap composed of 138 places in 122 ms of which 1 ms to minimize.
[2022-05-19 11:09:57] [INFO ] Deduced a trap composed of 123 places in 124 ms of which 0 ms to minimize.
[2022-05-19 11:09:57] [INFO ] Deduced a trap composed of 138 places in 130 ms of which 0 ms to minimize.
[2022-05-19 11:09:57] [INFO ] Deduced a trap composed of 120 places in 127 ms of which 0 ms to minimize.
[2022-05-19 11:09:57] [INFO ] Deduced a trap composed of 115 places in 125 ms of which 0 ms to minimize.
[2022-05-19 11:09:58] [INFO ] Deduced a trap composed of 126 places in 124 ms of which 1 ms to minimize.
[2022-05-19 11:09:58] [INFO ] Deduced a trap composed of 123 places in 122 ms of which 0 ms to minimize.
[2022-05-19 11:09:58] [INFO ] Deduced a trap composed of 129 places in 127 ms of which 0 ms to minimize.
[2022-05-19 11:09:58] [INFO ] Deduced a trap composed of 120 places in 123 ms of which 1 ms to minimize.
[2022-05-19 11:09:58] [INFO ] Deduced a trap composed of 123 places in 126 ms of which 0 ms to minimize.
[2022-05-19 11:09:58] [INFO ] Deduced a trap composed of 133 places in 123 ms of which 1 ms to minimize.
[2022-05-19 11:09:59] [INFO ] Deduced a trap composed of 126 places in 122 ms of which 0 ms to minimize.
[2022-05-19 11:09:59] [INFO ] Deduced a trap composed of 134 places in 126 ms of which 1 ms to minimize.
[2022-05-19 11:09:59] [INFO ] Deduced a trap composed of 128 places in 120 ms of which 0 ms to minimize.
[2022-05-19 11:09:59] [INFO ] Deduced a trap composed of 125 places in 126 ms of which 0 ms to minimize.
[2022-05-19 11:09:59] [INFO ] Deduced a trap composed of 129 places in 126 ms of which 0 ms to minimize.
[2022-05-19 11:10:00] [INFO ] Deduced a trap composed of 127 places in 127 ms of which 0 ms to minimize.
[2022-05-19 11:10:00] [INFO ] Deduced a trap composed of 133 places in 126 ms of which 0 ms to minimize.
[2022-05-19 11:10:00] [INFO ] Deduced a trap composed of 126 places in 129 ms of which 0 ms to minimize.
[2022-05-19 11:10:00] [INFO ] Deduced a trap composed of 129 places in 123 ms of which 1 ms to minimize.
[2022-05-19 11:10:00] [INFO ] Deduced a trap composed of 144 places in 121 ms of which 0 ms to minimize.
[2022-05-19 11:10:00] [INFO ] Deduced a trap composed of 129 places in 113 ms of which 1 ms to minimize.
[2022-05-19 11:10:01] [INFO ] Deduced a trap composed of 139 places in 120 ms of which 0 ms to minimize.
[2022-05-19 11:10:07] [INFO ] Deduced a trap composed of 138 places in 131 ms of which 0 ms to minimize.
[2022-05-19 11:10:07] [INFO ] Deduced a trap composed of 142 places in 140 ms of which 0 ms to minimize.
[2022-05-19 11:10:09] [INFO ] Deduced a trap composed of 133 places in 140 ms of which 0 ms to minimize.
[2022-05-19 11:10:12] [INFO ] Deduced a trap composed of 126 places in 135 ms of which 0 ms to minimize.
[2022-05-19 11:10:12] [INFO ] Deduced a trap composed of 126 places in 129 ms of which 0 ms to minimize.
[2022-05-19 11:10:13] [INFO ] Deduced a trap composed of 114 places in 122 ms of which 0 ms to minimize.
[2022-05-19 11:10:13] [INFO ] Deduced a trap composed of 138 places in 124 ms of which 0 ms to minimize.
[2022-05-19 11:10:14] [INFO ] Deduced a trap composed of 134 places in 127 ms of which 0 ms to minimize.
[2022-05-19 11:10:15] [INFO ] Deduced a trap composed of 127 places in 122 ms of which 0 ms to minimize.
[2022-05-19 11:10:17] [INFO ] Deduced a trap composed of 129 places in 125 ms of which 1 ms to minimize.
[2022-05-19 11:10:21] [INFO ] Deduced a trap composed of 130 places in 130 ms of which 1 ms to minimize.
[2022-05-19 11:10:21] [INFO ] Deduced a trap composed of 138 places in 138 ms of which 1 ms to minimize.
[2022-05-19 11:10:22] [INFO ] Deduced a trap composed of 123 places in 125 ms of which 0 ms to minimize.
[2022-05-19 11:10:31] [INFO ] Trap strengthening (SAT) tested/added 61/61 trap constraints in 38569 ms
[2022-05-19 11:10:31] [INFO ] After 39019ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-19 11:10:31] [INFO ] After 39119ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2022-05-19 11:10:31] [INFO ] Flatten gal took : 44 ms
[2022-05-19 11:10:31] [INFO ] Flatten gal took : 40 ms
[2022-05-19 11:10:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11277321606392068694.gal : 17 ms
[2022-05-19 11:10:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7265159346348030385.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms16352079944512185872;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11277321606392068694.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7265159346348030385.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality7265159346348030385.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 13
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :13 after 158
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :158 after 1790
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1790 after 8018
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :8018 after 37181
Detected timeout of ITS tools.
[2022-05-19 11:10:46] [INFO ] Flatten gal took : 35 ms
[2022-05-19 11:10:46] [INFO ] Applying decomposition
[2022-05-19 11:10:46] [INFO ] Flatten gal took : 32 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph4801160927882220657.txt' '-o' '/tmp/graph4801160927882220657.bin' '-w' '/tmp/graph4801160927882220657.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4801160927882220657.bin' '-l' '-1' '-v' '-w' '/tmp/graph4801160927882220657.weights' '-q' '0' '-e' '0.001'
[2022-05-19 11:10:46] [INFO ] Decomposing Gal with order
[2022-05-19 11:10:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 11:10:47] [INFO ] Removed a total of 636 redundant transitions.
[2022-05-19 11:10:47] [INFO ] Flatten gal took : 246 ms
[2022-05-19 11:10:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 229 labels/synchronizations in 35 ms.
[2022-05-19 11:10:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality289657152067056793.gal : 22 ms
[2022-05-19 11:10:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality174970555732615588.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms16352079944512185872;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality289657152067056793.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality174970555732615588.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...296
Loading property file /tmp/ReachabilityCardinality174970555732615588.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8498621684045347276
[2022-05-19 11:11:02] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8498621684045347276
Running compilation step : cd /tmp/ltsmin8498621684045347276;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1064 ms.
Running link step : cd /tmp/ltsmin8498621684045347276;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin8498621684045347276;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicPropp4==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 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 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 484 transition count 614
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 448 transition count 614
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 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 2 with 68 rules applied. Total rules applied 140 place count 414 transition count 580
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 141 place count 413 transition count 579
Iterating global reduction 2 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 2 with 4 rules applied. Total rules applied 146 place count 411 transition count 577
Applied a total of 146 rules in 95 ms. Remains 411 /484 variables (removed 73) and now considering 577/650 (removed 73) transitions.
[2022-05-19 11:11:18] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2022-05-19 11:11:18] [INFO ] Computed 77 place invariants in 6 ms
[2022-05-19 11:11:18] [INFO ] Dead Transitions using invariants and state equation in 483 ms found 0 transitions.
[2022-05-19 11:11:18] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2022-05-19 11:11:18] [INFO ] Computed 77 place invariants in 7 ms
[2022-05-19 11:11:18] [INFO ] Implicit Places using invariants in 448 ms returned []
[2022-05-19 11:11:18] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2022-05-19 11:11:18] [INFO ] Computed 77 place invariants in 12 ms
[2022-05-19 11:11:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 11:11:23] [INFO ] Implicit Places using invariants and state equation in 4131 ms returned []
Implicit Place search using SMT with State Equation took 4587 ms to find 0 implicit places.
[2022-05-19 11:11:23] [INFO ] Redundant transitions in 19 ms returned []
[2022-05-19 11:11:23] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2022-05-19 11:11:23] [INFO ] Computed 77 place invariants in 10 ms
[2022-05-19 11:11:23] [INFO ] Dead Transitions using invariants and state equation in 445 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 411/484 places, 577/650 transitions.
Finished structural reductions, in 1 iterations. Remains : 411/484 places, 577/650 transitions.
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J30-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s315 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 282 steps with 35 reset in 9 ms.
FORMULA PolyORBNT-PT-S05J30-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-00 finished in 5892 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 33 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.
[2022-05-19 11:11:23] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2022-05-19 11:11:23] [INFO ] Computed 77 place invariants in 7 ms
[2022-05-19 11:11:24] [INFO ] Dead Transitions using invariants and state equation in 606 ms found 0 transitions.
[2022-05-19 11:11:24] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2022-05-19 11:11:24] [INFO ] Computed 77 place invariants in 7 ms
[2022-05-19 11:11:24] [INFO ] Implicit Places using invariants in 535 ms returned []
[2022-05-19 11:11:24] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2022-05-19 11:11:24] [INFO ] Computed 77 place invariants in 13 ms
[2022-05-19 11:11:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 11:11:29] [INFO ] Implicit Places using invariants and state equation in 4614 ms returned []
Implicit Place search using SMT with State Equation took 5153 ms to find 0 implicit places.
[2022-05-19 11:11:29] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2022-05-19 11:11:29] [INFO ] Computed 77 place invariants in 6 ms
[2022-05-19 11:11:30] [INFO ] Dead Transitions using invariants and state equation in 663 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 483/484 places, 649/650 transitions.
Finished structural reductions, in 1 iterations. Remains : 483/484 places, 649/650 transitions.
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J30-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (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, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 269 steps with 18 reset in 7 ms.
FORMULA PolyORBNT-PT-S05J30-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-02 finished in 6591 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(!(G((X(X(p0))||G(p1)||X(p1))) U p1))))'
Support contains 8 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 23 ms. Remains 483 /484 variables (removed 1) and now considering 649/650 (removed 1) transitions.
[2022-05-19 11:11:30] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2022-05-19 11:11:30] [INFO ] Computed 77 place invariants in 12 ms
[2022-05-19 11:11:31] [INFO ] Dead Transitions using invariants and state equation in 642 ms found 0 transitions.
[2022-05-19 11:11:31] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2022-05-19 11:11:31] [INFO ] Computed 77 place invariants in 6 ms
[2022-05-19 11:11:31] [INFO ] Implicit Places using invariants in 525 ms returned []
[2022-05-19 11:11:31] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2022-05-19 11:11:31] [INFO ] Computed 77 place invariants in 11 ms
[2022-05-19 11:11:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 11:11:35] [INFO ] Implicit Places using invariants and state equation in 4368 ms returned []
Implicit Place search using SMT with State Equation took 4895 ms to find 0 implicit places.
[2022-05-19 11:11:35] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2022-05-19 11:11:35] [INFO ] Computed 77 place invariants in 13 ms
[2022-05-19 11:11:36] [INFO ] Dead Transitions using invariants and state equation in 677 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 483/484 places, 649/650 transitions.
Finished structural reductions, in 1 iterations. Remains : 483/484 places, 649/650 transitions.
Stuttering acceptance computed with spot in 273 ms :[p0, (AND p1 p0), true, (OR p0 p1), p1, p1, p1, p1]
Running random walk in product with property : PolyORBNT-PT-S05J30-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 0}, { cond=p1, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 7}], [{ cond=(NOT p1), acceptance={} source=6 dest: 1}, { cond=p1, acceptance={} source=6 dest: 3}], [{ cond=p1, acceptance={} source=7 dest: 2}, { cond=(NOT p1), acceptance={} source=7 dest: 6}]], initial=4, aps=[p1:(OR (AND (GEQ s153 1) (GEQ s439 1) (GEQ s440 1)) (AND (GEQ s332 1) (GEQ s439 1) (GEQ s440 1)) (AND (GEQ s340 1) (GEQ s439 1) (GEQ s440 1)) (AND (GEQ s8...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 469 ms.
Product exploration explored 100000 steps with 20000 reset in 418 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 95 ms. Reduced automaton from 8 states, 13 edges and 2 AP to 7 states, 11 edges and 2 AP.
Stuttering acceptance computed with spot in 268 ms :[(OR p0 p1), p0, p1, (AND p1 p0), p1, p1, p1]
Incomplete random walk after 10000 steps, including 683 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 256 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-19 11:11:38] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2022-05-19 11:11:38] [INFO ] Computed 77 place invariants in 10 ms
[2022-05-19 11:11:38] [INFO ] [Real]Absence check using 59 positive place invariants in 10 ms returned sat
[2022-05-19 11:11:38] [INFO ] [Real]Absence check using 59 positive and 18 generalized place invariants in 19 ms returned sat
[2022-05-19 11:11:38] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F p1), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 148 ms. Reduced automaton from 7 states, 11 edges and 2 AP to 6 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 203 ms :[p1, p0, p1, (OR p0 p1), p1, p1]
Stuttering acceptance computed with spot in 342 ms :[p1, p0, p1, (OR p0 p1), p1, p1]
Support contains 8 out of 483 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 483/483 places, 649/649 transitions.
Applied a total of 0 rules in 8 ms. Remains 483 /483 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2022-05-19 11:11:39] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2022-05-19 11:11:39] [INFO ] Computed 77 place invariants in 12 ms
[2022-05-19 11:11:39] [INFO ] Dead Transitions using invariants and state equation in 652 ms found 0 transitions.
[2022-05-19 11:11:39] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2022-05-19 11:11:39] [INFO ] Computed 77 place invariants in 10 ms
[2022-05-19 11:11:40] [INFO ] Implicit Places using invariants in 529 ms returned []
[2022-05-19 11:11:40] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2022-05-19 11:11:40] [INFO ] Computed 77 place invariants in 7 ms
[2022-05-19 11:11:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 11:11:45] [INFO ] Implicit Places using invariants and state equation in 4880 ms returned []
Implicit Place search using SMT with State Equation took 5414 ms to find 0 implicit places.
[2022-05-19 11:11:45] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2022-05-19 11:11:45] [INFO ] Computed 77 place invariants in 11 ms
[2022-05-19 11:11:45] [INFO ] Dead Transitions using invariants and state equation in 669 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 483/483 places, 649/649 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 6 states, 7 edges and 2 AP to 6 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 219 ms :[p1, p0, p1, (OR p0 p1), p1, p1]
Finished random walk after 2834 steps, including 194 resets, run visited all 2 properties in 9 ms. (steps per millisecond=314 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 2 factoid took 122 ms. Reduced automaton from 6 states, 7 edges and 2 AP to 6 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 209 ms :[p1, p0, p1, (OR p0 p1), p1, p1]
Stuttering acceptance computed with spot in 214 ms :[p1, p0, p1, (OR p0 p1), p1, p1]
Stuttering acceptance computed with spot in 250 ms :[p1, p0, p1, (OR p0 p1), p1, p1]
Product exploration explored 100000 steps with 25000 reset in 353 ms.
Product exploration explored 100000 steps with 25000 reset in 368 ms.
Applying partial POR strategy [false, true, false, false, false, false]
Stuttering acceptance computed with spot in 231 ms :[p1, p0, p1, (OR p0 p1), p1, p1]
Support contains 8 out of 483 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 483/483 places, 649/649 transitions.
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 483 transition count 649
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 33 place count 483 transition count 650
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 483 transition count 650
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 482 transition count 649
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 482 transition count 649
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 69 places in 0 ms
Iterating global reduction 1 with 35 rules applied. Total rules applied 72 place count 482 transition count 649
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 105 place count 449 transition count 616
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 1 with 33 rules applied. Total rules applied 138 place count 449 transition count 616
Deduced a syphon composed of 36 places in 0 ms
Applied a total of 138 rules in 90 ms. Remains 449 /483 variables (removed 34) and now considering 616/649 (removed 33) transitions.
[2022-05-19 11:11:48] [INFO ] Flow matrix only has 612 transitions (discarded 4 similar events)
// Phase 1: matrix 612 rows 449 cols
[2022-05-19 11:11:48] [INFO ] Computed 77 place invariants in 12 ms
[2022-05-19 11:11:48] [INFO ] Dead Transitions using invariants and state equation in 441 ms found 0 transitions.
[2022-05-19 11:11:48] [INFO ] Redundant transitions in 11 ms returned []
[2022-05-19 11:11:48] [INFO ] Flow matrix only has 612 transitions (discarded 4 similar events)
// Phase 1: matrix 612 rows 449 cols
[2022-05-19 11:11:48] [INFO ] Computed 77 place invariants in 10 ms
[2022-05-19 11:11:49] [INFO ] Dead Transitions using invariants and state equation in 440 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 449/483 places, 616/649 transitions.
Finished structural reductions, in 1 iterations. Remains : 449/483 places, 616/649 transitions.
Product exploration explored 100000 steps with 25000 reset in 370 ms.
Product exploration explored 100000 steps with 25000 reset in 431 ms.
Built C files in :
/tmp/ltsmin7438808350521448753
[2022-05-19 11:11:49] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7438808350521448753
Running compilation step : cd /tmp/ltsmin7438808350521448753;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1101 ms.
Running link step : cd /tmp/ltsmin7438808350521448753;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin7438808350521448753;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6790189247505818537.hoa' '--buchi-type=spotba'
LTSmin run took 369 ms.
FORMULA PolyORBNT-PT-S05J30-LTLFireability-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-05 finished in 21085 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))&&F(((p2 U p3)||p1))))'
Support contains 65 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 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 484 transition count 645
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 479 transition count 645
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 10 place count 479 transition count 641
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 18 place count 475 transition count 641
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 474 transition count 640
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 474 transition count 640
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 24 place count 472 transition count 638
Applied a total of 24 rules in 49 ms. Remains 472 /484 variables (removed 12) and now considering 638/650 (removed 12) transitions.
[2022-05-19 11:11:51] [INFO ] Flow matrix only has 634 transitions (discarded 4 similar events)
// Phase 1: matrix 634 rows 472 cols
[2022-05-19 11:11:51] [INFO ] Computed 77 place invariants in 15 ms
[2022-05-19 11:11:52] [INFO ] Dead Transitions using invariants and state equation in 550 ms found 0 transitions.
[2022-05-19 11:11:52] [INFO ] Flow matrix only has 634 transitions (discarded 4 similar events)
// Phase 1: matrix 634 rows 472 cols
[2022-05-19 11:11:52] [INFO ] Computed 77 place invariants in 13 ms
[2022-05-19 11:11:52] [INFO ] Implicit Places using invariants in 477 ms returned []
[2022-05-19 11:11:52] [INFO ] Flow matrix only has 634 transitions (discarded 4 similar events)
// Phase 1: matrix 634 rows 472 cols
[2022-05-19 11:11:52] [INFO ] Computed 77 place invariants in 14 ms
[2022-05-19 11:11:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 11:11:58] [INFO ] Implicit Places using invariants and state equation in 5605 ms returned []
Implicit Place search using SMT with State Equation took 6083 ms to find 0 implicit places.
[2022-05-19 11:11:58] [INFO ] Redundant transitions in 14 ms returned []
[2022-05-19 11:11:58] [INFO ] Flow matrix only has 634 transitions (discarded 4 similar events)
// Phase 1: matrix 634 rows 472 cols
[2022-05-19 11:11:58] [INFO ] Computed 77 place invariants in 11 ms
[2022-05-19 11:11:58] [INFO ] Dead Transitions using invariants and state equation in 610 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 472/484 places, 638/650 transitions.
Finished structural reductions, in 1 iterations. Remains : 472/484 places, 638/650 transitions.
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : PolyORBNT-PT-S05J30-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (GEQ s250 1) (GEQ s251 1) (GEQ s438 1) (GEQ s437 1) (GEQ s66 1) (GEQ s131 1) (GEQ s12 1) (GEQ s317 1) (GEQ s394 1) (GEQ s139 1) (GEQ s202 1) (GEQ s...], 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 20 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J30-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-06 finished in 7435 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!F(p0) U (p0 U p0)))'
Support contains 1 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 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 484 transition count 616
Reduce places removed 34 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 35 rules applied. Total rules applied 69 place count 450 transition count 615
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 449 transition count 615
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 70 place count 449 transition count 580
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 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 3 with 4 rules applied. Total rules applied 144 place count 412 transition count 578
Applied a total of 144 rules in 41 ms. Remains 412 /484 variables (removed 72) and now considering 578/650 (removed 72) transitions.
[2022-05-19 11:11:58] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
// Phase 1: matrix 574 rows 412 cols
[2022-05-19 11:11:58] [INFO ] Computed 77 place invariants in 13 ms
[2022-05-19 11:11:59] [INFO ] Dead Transitions using invariants and state equation in 414 ms found 0 transitions.
[2022-05-19 11:11:59] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
// Phase 1: matrix 574 rows 412 cols
[2022-05-19 11:11:59] [INFO ] Computed 77 place invariants in 6 ms
[2022-05-19 11:11:59] [INFO ] Implicit Places using invariants in 468 ms returned []
[2022-05-19 11:11:59] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
// Phase 1: matrix 574 rows 412 cols
[2022-05-19 11:11:59] [INFO ] Computed 77 place invariants in 26 ms
[2022-05-19 11:12:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 11:12:03] [INFO ] Implicit Places using invariants and state equation in 3784 ms returned []
Implicit Place search using SMT with State Equation took 4273 ms to find 0 implicit places.
[2022-05-19 11:12:03] [INFO ] Redundant transitions in 4 ms returned []
[2022-05-19 11:12:03] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
// Phase 1: matrix 574 rows 412 cols
[2022-05-19 11:12:03] [INFO ] Computed 77 place invariants in 6 ms
[2022-05-19 11:12:04] [INFO ] Dead Transitions using invariants and state equation in 424 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 412/484 places, 578/650 transitions.
Finished structural reductions, in 1 iterations. Remains : 412/484 places, 578/650 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0), true]
Running random walk in product with property : PolyORBNT-PT-S05J30-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s154 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 0 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 5256 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((!X(p0) U p1)))'
Support contains 2 out of 484 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
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 41 ms. Remains 412 /484 variables (removed 72) and now considering 578/650 (removed 72) transitions.
[2022-05-19 11:12:04] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
// Phase 1: matrix 574 rows 412 cols
[2022-05-19 11:12:04] [INFO ] Computed 77 place invariants in 6 ms
[2022-05-19 11:12:04] [INFO ] Dead Transitions using invariants and state equation in 752 ms found 0 transitions.
[2022-05-19 11:12:04] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
// Phase 1: matrix 574 rows 412 cols
[2022-05-19 11:12:04] [INFO ] Computed 77 place invariants in 5 ms
[2022-05-19 11:12:05] [INFO ] Implicit Places using invariants in 452 ms returned []
[2022-05-19 11:12:05] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
// Phase 1: matrix 574 rows 412 cols
[2022-05-19 11:12:05] [INFO ] Computed 77 place invariants in 21 ms
[2022-05-19 11:12:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 11:12:08] [INFO ] Implicit Places using invariants and state equation in 3229 ms returned []
Implicit Place search using SMT with State Equation took 3717 ms to find 0 implicit places.
[2022-05-19 11:12:08] [INFO ] Redundant transitions in 5 ms returned []
[2022-05-19 11:12:08] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
// Phase 1: matrix 574 rows 412 cols
[2022-05-19 11:12:08] [INFO ] Computed 77 place invariants in 5 ms
[2022-05-19 11:12:09] [INFO ] Dead Transitions using invariants and state equation in 425 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 412/484 places, 578/650 transitions.
Finished structural reductions, in 1 iterations. Remains : 412/484 places, 578/650 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Running random walk in product with property : PolyORBNT-PT-S05J30-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (GEQ s153 1) (GEQ s181 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S05J30-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-08 finished in 5040 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))&&F(G(F(!(F(p1) U p1))))))'
Support contains 3 out of 484 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 484/484 places, 650/650 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 484 transition count 615
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 71 place count 449 transition count 614
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 448 transition count 614
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 72 place count 448 transition count 580
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 140 place count 414 transition count 580
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 144 place count 412 transition count 578
Applied a total of 144 rules in 62 ms. Remains 412 /484 variables (removed 72) and now considering 578/650 (removed 72) transitions.
[2022-05-19 11:12:09] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
// Phase 1: matrix 574 rows 412 cols
[2022-05-19 11:12:09] [INFO ] Computed 77 place invariants in 21 ms
[2022-05-19 11:12:10] [INFO ] Dead Transitions using invariants and state equation in 938 ms found 0 transitions.
[2022-05-19 11:12:10] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
// Phase 1: matrix 574 rows 412 cols
[2022-05-19 11:12:10] [INFO ] Computed 77 place invariants in 10 ms
[2022-05-19 11:12:10] [INFO ] Implicit Places using invariants in 468 ms returned []
[2022-05-19 11:12:10] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
// Phase 1: matrix 574 rows 412 cols
[2022-05-19 11:12:10] [INFO ] Computed 77 place invariants in 11 ms
[2022-05-19 11:12:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 11:12:13] [INFO ] Implicit Places using invariants and state equation in 3037 ms returned []
Implicit Place search using SMT with State Equation took 3550 ms to find 0 implicit places.
[2022-05-19 11:12:13] [INFO ] Redundant transitions in 6 ms returned []
[2022-05-19 11:12:13] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
// Phase 1: matrix 574 rows 412 cols
[2022-05-19 11:12:13] [INFO ] Computed 77 place invariants in 6 ms
[2022-05-19 11:12:14] [INFO ] Dead Transitions using invariants and state equation in 424 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 412/484 places, 578/650 transitions.
Finished structural reductions, in 1 iterations. Remains : 412/484 places, 578/650 transitions.
Stuttering acceptance computed with spot in 90 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Running random walk in product with property : PolyORBNT-PT-S05J30-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s153 1) (LT s181 1)), p1:(GEQ s186 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 4762 reset in 449 ms.
Product exploration explored 100000 steps with 4780 reset in 528 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 285 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Finished random walk after 918 steps, including 45 resets, run visited all 2 properties in 8 ms. (steps per millisecond=114 )
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 5 factoid took 186 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Support contains 3 out of 412 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 412/412 places, 578/578 transitions.
Applied a total of 0 rules in 17 ms. Remains 412 /412 variables (removed 0) and now considering 578/578 (removed 0) transitions.
[2022-05-19 11:12:16] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
// Phase 1: matrix 574 rows 412 cols
[2022-05-19 11:12:16] [INFO ] Computed 77 place invariants in 6 ms
[2022-05-19 11:12:16] [INFO ] Dead Transitions using invariants and state equation in 471 ms found 0 transitions.
[2022-05-19 11:12:16] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
// Phase 1: matrix 574 rows 412 cols
[2022-05-19 11:12:16] [INFO ] Computed 77 place invariants in 6 ms
[2022-05-19 11:12:17] [INFO ] Implicit Places using invariants in 452 ms returned []
[2022-05-19 11:12:17] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
// Phase 1: matrix 574 rows 412 cols
[2022-05-19 11:12:17] [INFO ] Computed 77 place invariants in 9 ms
[2022-05-19 11:12:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 11:12:20] [INFO ] Implicit Places using invariants and state equation in 3155 ms returned []
Implicit Place search using SMT with State Equation took 3620 ms to find 0 implicit places.
[2022-05-19 11:12:20] [INFO ] Redundant transitions in 5 ms returned []
[2022-05-19 11:12:20] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
// Phase 1: matrix 574 rows 412 cols
[2022-05-19 11:12:20] [INFO ] Computed 77 place invariants in 7 ms
[2022-05-19 11:12:20] [INFO ] Dead Transitions using invariants and state equation in 413 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 412/412 places, 578/578 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 (NOT p1)), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 250 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Finished random walk after 321 steps, including 16 resets, run visited all 2 properties in 3 ms. (steps per millisecond=107 )
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 5 factoid took 201 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 84 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Stuttering acceptance computed with spot in 90 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Product exploration explored 100000 steps with 4764 reset in 430 ms.
Product exploration explored 100000 steps with 4829 reset in 453 ms.
Built C files in :
/tmp/ltsmin14609465862190943244
[2022-05-19 11:12:22] [INFO ] Computing symmetric may disable matrix : 578 transitions.
[2022-05-19 11:12:22] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 11:12:22] [INFO ] Computing symmetric may enable matrix : 578 transitions.
[2022-05-19 11:12:22] [INFO ] Computation of Complete enable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 11:12:22] [INFO ] Computing Do-Not-Accords matrix : 578 transitions.
[2022-05-19 11:12:22] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 11:12:22] [INFO ] Built C files in 106ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14609465862190943244
Running compilation step : cd /tmp/ltsmin14609465862190943244;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1432 ms.
Running link step : cd /tmp/ltsmin14609465862190943244;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin14609465862190943244;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14672104096388740071.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 412 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 412/412 places, 578/578 transitions.
Applied a total of 0 rules in 25 ms. Remains 412 /412 variables (removed 0) and now considering 578/578 (removed 0) transitions.
[2022-05-19 11:12:37] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
// Phase 1: matrix 574 rows 412 cols
[2022-05-19 11:12:37] [INFO ] Computed 77 place invariants in 12 ms
[2022-05-19 11:12:38] [INFO ] Dead Transitions using invariants and state equation in 609 ms found 0 transitions.
[2022-05-19 11:12:38] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
// Phase 1: matrix 574 rows 412 cols
[2022-05-19 11:12:38] [INFO ] Computed 77 place invariants in 6 ms
[2022-05-19 11:12:38] [INFO ] Implicit Places using invariants in 503 ms returned []
[2022-05-19 11:12:38] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
// Phase 1: matrix 574 rows 412 cols
[2022-05-19 11:12:38] [INFO ] Computed 77 place invariants in 6 ms
[2022-05-19 11:12:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 11:12:42] [INFO ] Implicit Places using invariants and state equation in 3466 ms returned []
Implicit Place search using SMT with State Equation took 3971 ms to find 0 implicit places.
[2022-05-19 11:12:42] [INFO ] Redundant transitions in 9 ms returned []
[2022-05-19 11:12:42] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
// Phase 1: matrix 574 rows 412 cols
[2022-05-19 11:12:42] [INFO ] Computed 77 place invariants in 6 ms
[2022-05-19 11:12:42] [INFO ] Dead Transitions using invariants and state equation in 427 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 412/412 places, 578/578 transitions.
Built C files in :
/tmp/ltsmin4178931096655663495
[2022-05-19 11:12:42] [INFO ] Computing symmetric may disable matrix : 578 transitions.
[2022-05-19 11:12:42] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 11:12:42] [INFO ] Computing symmetric may enable matrix : 578 transitions.
[2022-05-19 11:12:42] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 11:12:42] [INFO ] Computing Do-Not-Accords matrix : 578 transitions.
[2022-05-19 11:12:42] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 11:12:42] [INFO ] Built C files in 73ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4178931096655663495
Running compilation step : cd /tmp/ltsmin4178931096655663495;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1412 ms.
Running link step : cd /tmp/ltsmin4178931096655663495;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin4178931096655663495;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11368544564249865011.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 11:12:57] [INFO ] Flatten gal took : 34 ms
[2022-05-19 11:12:57] [INFO ] Flatten gal took : 32 ms
[2022-05-19 11:12:57] [INFO ] Time to serialize gal into /tmp/LTL11088945580277522015.gal : 4 ms
[2022-05-19 11:12:57] [INFO ] Time to serialize properties into /tmp/LTL14471339069425509813.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11088945580277522015.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14471339069425509813.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1108894...268
Read 1 LTL properties
Checking formula 0 : !(((G(F("((place_456<1)||(NotifyEventJobQueuedE_1<1))")))&&(F(G(F(!((F("(Perform_Work_E_1>=1)"))U("(Perform_Work_E_1>=1)"))))))))
Formula 0 simplified : !(GF"((place_456<1)||(NotifyEventJobQueuedE_1<1))" & FGF!(F"(Perform_Work_E_1>=1)" U "(Perform_Work_E_1>=1)"))
Detected timeout of ITS tools.
[2022-05-19 11:13:12] [INFO ] Flatten gal took : 28 ms
[2022-05-19 11:13:12] [INFO ] Applying decomposition
[2022-05-19 11:13:12] [INFO ] Flatten gal took : 28 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11145368719222111396.txt' '-o' '/tmp/graph11145368719222111396.bin' '-w' '/tmp/graph11145368719222111396.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11145368719222111396.bin' '-l' '-1' '-v' '-w' '/tmp/graph11145368719222111396.weights' '-q' '0' '-e' '0.001'
[2022-05-19 11:13:12] [INFO ] Decomposing Gal with order
[2022-05-19 11:13:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 11:13:12] [INFO ] Removed a total of 536 redundant transitions.
[2022-05-19 11:13:13] [INFO ] Flatten gal took : 108 ms
[2022-05-19 11:13:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 236 labels/synchronizations in 16 ms.
[2022-05-19 11:13:13] [INFO ] Time to serialize gal into /tmp/LTL4295369497981081296.gal : 7 ms
[2022-05-19 11:13:13] [INFO ] Time to serialize properties into /tmp/LTL1450560619124704016.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4295369497981081296.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1450560619124704016.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4295369...245
Read 1 LTL properties
Checking formula 0 : !(((G(F("((i2.u25.place_456<1)||(i2.u25.NotifyEventJobQueuedE_1<1))")))&&(F(G(F(!((F("(i5.u5.Perform_Work_E_1>=1)"))U("(i5.u5.Perform_...176
Formula 0 simplified : !(GF"((i2.u25.place_456<1)||(i2.u25.NotifyEventJobQueuedE_1<1))" & FGF!(F"(i5.u5.Perform_Work_E_1>=1)" U "(i5.u5.Perform_Work_E_1>=1...159
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17604958344450781983
[2022-05-19 11:13:28] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17604958344450781983
Running compilation step : cd /tmp/ltsmin17604958344450781983;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 990 ms.
Running link step : cd /tmp/ltsmin17604958344450781983;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin17604958344450781983;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](<>((LTLAPp0==true)))&&<>([](<>(!(<>((LTLAPp1==true)) U (LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-09 finished in 94017 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)||X(p1))))'
Support contains 3 out of 484 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 484/484 places, 650/650 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 483 transition count 649
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 483 transition count 649
Applied a total of 2 rules in 18 ms. Remains 483 /484 variables (removed 1) and now considering 649/650 (removed 1) transitions.
[2022-05-19 11:13:43] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2022-05-19 11:13:43] [INFO ] Computed 77 place invariants in 17 ms
[2022-05-19 11:13:43] [INFO ] Dead Transitions using invariants and state equation in 682 ms found 0 transitions.
[2022-05-19 11:13:43] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2022-05-19 11:13:43] [INFO ] Computed 77 place invariants in 12 ms
[2022-05-19 11:13:44] [INFO ] Implicit Places using invariants in 557 ms returned []
[2022-05-19 11:13:44] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2022-05-19 11:13:44] [INFO ] Computed 77 place invariants in 13 ms
[2022-05-19 11:13:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 11:13:49] [INFO ] Implicit Places using invariants and state equation in 4652 ms returned []
Implicit Place search using SMT with State Equation took 5213 ms to find 0 implicit places.
[2022-05-19 11:13:49] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2022-05-19 11:13:49] [INFO ] Computed 77 place invariants in 16 ms
[2022-05-19 11:13:49] [INFO ] Dead Transitions using invariants and state equation in 668 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 483/484 places, 649/650 transitions.
Finished structural reductions, in 1 iterations. Remains : 483/484 places, 649/650 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBNT-PT-S05J30-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s464 1)), p1:(GEQ s349 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 29 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J30-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-10 finished in 6688 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G((G(X(X(F(p0)))) U p1)))))'
Support contains 4 out of 484 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 484/484 places, 650/650 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 484 transition count 615
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 449 transition count 615
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 70 place count 449 transition count 581
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 138 place count 415 transition count 581
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 139 place count 414 transition count 580
Iterating global reduction 2 with 1 rules applied. Total rules applied 140 place count 414 transition count 580
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 144 place count 412 transition count 578
Applied a total of 144 rules in 46 ms. Remains 412 /484 variables (removed 72) and now considering 578/650 (removed 72) transitions.
[2022-05-19 11:13:49] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
// Phase 1: matrix 574 rows 412 cols
[2022-05-19 11:13:49] [INFO ] Computed 77 place invariants in 10 ms
[2022-05-19 11:13:50] [INFO ] Dead Transitions using invariants and state equation in 437 ms found 0 transitions.
[2022-05-19 11:13:50] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
// Phase 1: matrix 574 rows 412 cols
[2022-05-19 11:13:50] [INFO ] Computed 77 place invariants in 16 ms
[2022-05-19 11:13:50] [INFO ] Implicit Places using invariants in 466 ms returned []
[2022-05-19 11:13:50] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
// Phase 1: matrix 574 rows 412 cols
[2022-05-19 11:13:50] [INFO ] Computed 77 place invariants in 6 ms
[2022-05-19 11:13:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 11:13:54] [INFO ] Implicit Places using invariants and state equation in 3346 ms returned []
Implicit Place search using SMT with State Equation took 3814 ms to find 0 implicit places.
[2022-05-19 11:13:54] [INFO ] Redundant transitions in 10 ms returned []
[2022-05-19 11:13:54] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
// Phase 1: matrix 574 rows 412 cols
[2022-05-19 11:13:54] [INFO ] Computed 77 place invariants in 12 ms
[2022-05-19 11:13:54] [INFO ] Dead Transitions using invariants and state equation in 442 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 412/484 places, 578/650 transitions.
Finished structural reductions, in 1 iterations. Remains : 412/484 places, 578/650 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : PolyORBNT-PT-S05J30-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s91 1) (GEQ s223 1) (GEQ s267 1)), p0:(GEQ s186 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S05J30-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-12 finished in 4948 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(((p0 U p1) U p0))||X(p2))))'
Support contains 5 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 23 ms. Remains 483 /484 variables (removed 1) and now considering 649/650 (removed 1) transitions.
[2022-05-19 11:13:54] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2022-05-19 11:13:54] [INFO ] Computed 77 place invariants in 12 ms
[2022-05-19 11:13:55] [INFO ] Dead Transitions using invariants and state equation in 662 ms found 0 transitions.
[2022-05-19 11:13:55] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2022-05-19 11:13:55] [INFO ] Computed 77 place invariants in 7 ms
[2022-05-19 11:13:56] [INFO ] Implicit Places using invariants in 544 ms returned []
[2022-05-19 11:13:56] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2022-05-19 11:13:56] [INFO ] Computed 77 place invariants in 6 ms
[2022-05-19 11:13:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 11:14:00] [INFO ] Implicit Places using invariants and state equation in 4601 ms returned []
Implicit Place search using SMT with State Equation took 5147 ms to find 0 implicit places.
[2022-05-19 11:14:00] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2022-05-19 11:14:00] [INFO ] Computed 77 place invariants in 8 ms
[2022-05-19 11:14:01] [INFO ] Dead Transitions using invariants and state equation in 642 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 483/484 places, 649/650 transitions.
Finished structural reductions, in 1 iterations. Remains : 483/484 places, 649/650 transitions.
Stuttering acceptance computed with spot in 301 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), true, (NOT p0), (AND (NOT p0) p2)]
Running random walk in product with property : PolyORBNT-PT-S05J30-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR p0 p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=5 dest: 4}, { cond=(OR (AND p0 p2) (AND p1 p2)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s349 1), p1:(AND (GEQ s222 1) (GEQ s350 1)), p2:(AND (GEQ s197 10) (GEQ s464 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S05J30-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-13 finished in 6807 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(p0))))'
Support contains 1 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 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 484 transition count 616
Reduce places removed 34 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 35 rules applied. Total rules applied 69 place count 450 transition count 615
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 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 3 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 3 with 68 rules applied. Total rules applied 138 place count 415 transition count 581
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 139 place count 414 transition count 580
Iterating global reduction 3 with 1 rules applied. Total rules applied 140 place count 414 transition count 580
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 144 place count 412 transition count 578
Applied a total of 144 rules in 47 ms. Remains 412 /484 variables (removed 72) and now considering 578/650 (removed 72) transitions.
[2022-05-19 11:14:01] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
// Phase 1: matrix 574 rows 412 cols
[2022-05-19 11:14:01] [INFO ] Computed 77 place invariants in 14 ms
[2022-05-19 11:14:02] [INFO ] Dead Transitions using invariants and state equation in 411 ms found 0 transitions.
[2022-05-19 11:14:02] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
// Phase 1: matrix 574 rows 412 cols
[2022-05-19 11:14:02] [INFO ] Computed 77 place invariants in 6 ms
[2022-05-19 11:14:02] [INFO ] Implicit Places using invariants in 441 ms returned []
[2022-05-19 11:14:02] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
// Phase 1: matrix 574 rows 412 cols
[2022-05-19 11:14:02] [INFO ] Computed 77 place invariants in 5 ms
[2022-05-19 11:14:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 11:14:06] [INFO ] Implicit Places using invariants and state equation in 3677 ms returned []
Implicit Place search using SMT with State Equation took 4141 ms to find 0 implicit places.
[2022-05-19 11:14:06] [INFO ] Redundant transitions in 5 ms returned []
[2022-05-19 11:14:06] [INFO ] Flow matrix only has 574 transitions (discarded 4 similar events)
// Phase 1: matrix 574 rows 412 cols
[2022-05-19 11:14:06] [INFO ] Computed 77 place invariants in 7 ms
[2022-05-19 11:14:06] [INFO ] Dead Transitions using invariants and state equation in 426 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 412/484 places, 578/650 transitions.
Finished structural reductions, in 1 iterations. Remains : 412/484 places, 578/650 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J30-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s115 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 9 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 5091 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(X(p0))) U !X(F(p1))))'
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 23 ms. Remains 483 /484 variables (removed 1) and now considering 649/650 (removed 1) transitions.
[2022-05-19 11:14:06] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2022-05-19 11:14:06] [INFO ] Computed 77 place invariants in 10 ms
[2022-05-19 11:14:07] [INFO ] Dead Transitions using invariants and state equation in 716 ms found 0 transitions.
[2022-05-19 11:14:07] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2022-05-19 11:14:07] [INFO ] Computed 77 place invariants in 9 ms
[2022-05-19 11:14:08] [INFO ] Implicit Places using invariants in 541 ms returned []
[2022-05-19 11:14:08] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2022-05-19 11:14:08] [INFO ] Computed 77 place invariants in 6 ms
[2022-05-19 11:14:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 11:14:13] [INFO ] Implicit Places using invariants and state equation in 5267 ms returned []
Implicit Place search using SMT with State Equation took 5812 ms to find 0 implicit places.
[2022-05-19 11:14:13] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2022-05-19 11:14:13] [INFO ] Computed 77 place invariants in 11 ms
[2022-05-19 11:14:13] [INFO ] Dead Transitions using invariants and state equation in 672 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 483/484 places, 649/650 transitions.
Finished structural reductions, in 1 iterations. Remains : 483/484 places, 649/650 transitions.
Stuttering acceptance computed with spot in 123 ms :[p1, p1, (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J30-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s131 1), p0:(AND (GEQ s236 1) (GEQ s376 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S05J30-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J30-LTLFireability-15 finished in 7370 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))&&F(G(F(!(F(p1) U p1))))))'
[2022-05-19 11:14:14] [INFO ] Flatten gal took : 36 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16415983683053114690
[2022-05-19 11:14:14] [INFO ] Computing symmetric may disable matrix : 650 transitions.
[2022-05-19 11:14:14] [INFO ] Applying decomposition
[2022-05-19 11:14:14] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 11:14:14] [INFO ] Computing symmetric may enable matrix : 650 transitions.
[2022-05-19 11:14:14] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 11:14:14] [INFO ] Flatten gal took : 27 ms
[2022-05-19 11:14:14] [INFO ] Computing Do-Not-Accords matrix : 650 transitions.
[2022-05-19 11:14:14] [INFO ] Computation of Completed DNA matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 11:14:14] [INFO ] Built C files in 85ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16415983683053114690
Running compilation step : cd /tmp/ltsmin16415983683053114690;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17271178681818692517.txt' '-o' '/tmp/graph17271178681818692517.bin' '-w' '/tmp/graph17271178681818692517.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17271178681818692517.bin' '-l' '-1' '-v' '-w' '/tmp/graph17271178681818692517.weights' '-q' '0' '-e' '0.001'
[2022-05-19 11:14:14] [INFO ] Decomposing Gal with order
[2022-05-19 11:14:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 11:14:14] [INFO ] Removed a total of 661 redundant transitions.
[2022-05-19 11:14:14] [INFO ] Flatten gal took : 72 ms
[2022-05-19 11:14:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 118 labels/synchronizations in 14 ms.
[2022-05-19 11:14:14] [INFO ] Time to serialize gal into /tmp/LTLFireability12073385220525583181.gal : 5 ms
[2022-05-19 11:14:14] [INFO ] Time to serialize properties into /tmp/LTLFireability44659641898718726.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12073385220525583181.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability44659641898718726.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...266
Read 1 LTL properties
Checking formula 0 : !(((G(F("((i7.u14.place_456<1)||(i7.u14.NotifyEventJobQueuedE_1<1))")))&&(F(G(F(!((F("(i2.i0.u46.Perform_Work_E_1>=1)"))U("(i2.i0.u46....184
Formula 0 simplified : !(GF"((i7.u14.place_456<1)||(i7.u14.NotifyEventJobQueuedE_1<1))" & FGF!(F"(i2.i0.u46.Perform_Work_E_1>=1)" U "(i2.i0.u46.Perform_Wor...167
Compilation finished in 1774 ms.
Running link step : cd /tmp/ltsmin16415983683053114690;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin16415983683053114690;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([](<>((LTLAPp0==true)))&&<>([](<>(!(<>((LTLAPp1==true)) U (LTLAPp1==true))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.008: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.018: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.018: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.018: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.018: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.041: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.041: Initializing POR dependencies: labels 652, guards 650
pins2lts-mc-linux64( 5/ 8), 0.041: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.229: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.330: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.339: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.344: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.349: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.374: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 1.643: LTL layer: formula: ([](<>((LTLAPp0==true)))&&<>([](<>(!(<>((LTLAPp1==true)) U (LTLAPp1==true))))))
pins2lts-mc-linux64( 0/ 8), 1.643: "([](<>((LTLAPp0==true)))&&<>([](<>(!(<>((LTLAPp1==true)) U (LTLAPp1==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 1.661: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 1.703: buchi has 4 states
pins2lts-mc-linux64( 0/ 8), 2.002: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 2.047: There are 653 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 2.047: State length is 485, there are 658 groups
pins2lts-mc-linux64( 0/ 8), 2.047: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 2.047: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 2.047: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 2.047: Visible groups: 0 / 658, labels: 2 / 653
pins2lts-mc-linux64( 0/ 8), 2.047: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 2.047: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 4/ 8), 2.106: [Blue] ~39 levels ~960 states ~2128 transitions
pins2lts-mc-linux64( 2/ 8), 2.142: [Blue] ~52 levels ~1920 states ~4272 transitions
pins2lts-mc-linux64( 2/ 8), 2.213: [Blue] ~52 levels ~3840 states ~8544 transitions
pins2lts-mc-linux64( 2/ 8), 2.379: [Blue] ~52 levels ~7680 states ~17784 transitions
pins2lts-mc-linux64( 2/ 8), 2.705: [Blue] ~52 levels ~15360 states ~33872 transitions
pins2lts-mc-linux64( 2/ 8), 3.359: [Blue] ~52 levels ~30720 states ~67128 transitions
pins2lts-mc-linux64( 4/ 8), 4.589: [Blue] ~43 levels ~61440 states ~127328 transitions
pins2lts-mc-linux64( 5/ 8), 6.773: [Blue] ~51 levels ~122880 states ~240888 transitions
pins2lts-mc-linux64( 6/ 8), 10.526: [Blue] ~42 levels ~245760 states ~454632 transitions
pins2lts-mc-linux64( 6/ 8), 18.383: [Blue] ~65 levels ~491520 states ~913280 transitions
pins2lts-mc-linux64( 4/ 8), 32.953: [Blue] ~56 levels ~983040 states ~1828672 transitions
pins2lts-mc-linux64( 4/ 8), 62.479: [Blue] ~56 levels ~1966080 states ~3757768 transitions
pins2lts-mc-linux64( 4/ 8), 120.628: [Blue] ~56 levels ~3932160 states ~7530728 transitions
pins2lts-mc-linux64( 4/ 8), 239.324: [Blue] ~56 levels ~7864320 states ~15231640 transitions
pins2lts-mc-linux64( 4/ 8), 472.743: [Blue] ~56 levels ~15728640 states ~30309560 transitions
pins2lts-mc-linux64( 4/ 8), 943.270: [Blue] ~56 levels ~31457280 states ~60484752 transitions
pins2lts-mc-linux64( 7/ 8), 1050.964: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1051.054:
pins2lts-mc-linux64( 0/ 8), 1051.055: Explored 29445259 states 70707715 transitions, fanout: 2.401
pins2lts-mc-linux64( 0/ 8), 1051.055: Total exploration time 1048.980 sec (1048.910 sec minimum, 1048.939 sec on average)
pins2lts-mc-linux64( 0/ 8), 1051.055: States per second: 28070, Transitions per second: 67406
pins2lts-mc-linux64( 0/ 8), 1051.055:
pins2lts-mc-linux64( 0/ 8), 1051.055: State space has 29445959 states, 88771 are accepting
pins2lts-mc-linux64( 0/ 8), 1051.055: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1051.055: blue states: 29445259 (100.00%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1051.055: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1051.055: all-red states: 123129 (0.42%), bogus 2 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1051.055:
pins2lts-mc-linux64( 0/ 8), 1051.055: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 1051.055:
pins2lts-mc-linux64( 0/ 8), 1051.055: Queue width: 8B, total height: 357, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 1051.055: Tree memory: 480.7MB, 17.1 B/state, compr.: 0.9%
pins2lts-mc-linux64( 0/ 8), 1051.055: Tree fill ratio (roots/leafs): 21.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1051.055: Stored 657 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1051.055: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1051.055: Est. total memory use: 480.7MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16415983683053114690;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([](<>((LTLAPp0==true)))&&<>([](<>(!(<>((LTLAPp1==true)) U (LTLAPp1==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16415983683053114690;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([](<>((LTLAPp0==true)))&&<>([](<>(!(<>((LTLAPp1==true)) U (LTLAPp1==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-19 11:36:11] [INFO ] Flatten gal took : 183 ms
[2022-05-19 11:36:11] [INFO ] Time to serialize gal into /tmp/LTLFireability261192007910942565.gal : 62 ms
[2022-05-19 11:36:11] [INFO ] Time to serialize properties into /tmp/LTLFireability7006490680493625383.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability261192007910942565.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7006490680493625383.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...287
Read 1 LTL properties
Checking formula 0 : !(((G(F("((place_456<1)||(NotifyEventJobQueuedE_1<1))")))&&(F(G(F(!((F("(Perform_Work_E_1>=1)"))U("(Perform_Work_E_1>=1)"))))))))
Formula 0 simplified : !(GF"((place_456<1)||(NotifyEventJobQueuedE_1<1))" & FGF!(F"(Perform_Work_E_1>=1)" U "(Perform_Work_E_1>=1)"))
Detected timeout of ITS tools.
[2022-05-19 11:58:23] [INFO ] Flatten gal took : 15160 ms
[2022-05-19 11:58:24] [INFO ] Input system was already deterministic with 650 transitions.
[2022-05-19 11:58:24] [INFO ] Transformed 484 places.
[2022-05-19 11:58:24] [INFO ] Transformed 650 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-19 11:58:54] [INFO ] Time to serialize gal into /tmp/LTLFireability7070294222572061981.gal : 7 ms
[2022-05-19 11:58:54] [INFO ] Time to serialize properties into /tmp/LTLFireability17615842431848811868.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7070294222572061981.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17615842431848811868.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...334
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((G(F("((place_456<1)||(NotifyEventJobQueuedE_1<1))")))&&(F(G(F(!((F("(Perform_Work_E_1>=1)"))U("(Perform_Work_E_1>=1)"))))))))
Formula 0 simplified : !(GF"((place_456<1)||(NotifyEventJobQueuedE_1<1))" & FGF!(F"(Perform_Work_E_1>=1)" U "(Perform_Work_E_1>=1)"))

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
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 r168-tall-165277017200820"
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 ;