Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r007-tall-162037989400034.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ASLink-PT-02b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-tall-162037989400034
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 760K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 124K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 01:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 01:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 22 09:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 22 09:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 417K May 5 16:51 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 ASLink-PT-02b-00
FORMULA_NAME ASLink-PT-02b-01
FORMULA_NAME ASLink-PT-02b-02
FORMULA_NAME ASLink-PT-02b-03
FORMULA_NAME ASLink-PT-02b-04
FORMULA_NAME ASLink-PT-02b-05
FORMULA_NAME ASLink-PT-02b-06
FORMULA_NAME ASLink-PT-02b-07
FORMULA_NAME ASLink-PT-02b-08
FORMULA_NAME ASLink-PT-02b-09
FORMULA_NAME ASLink-PT-02b-10
FORMULA_NAME ASLink-PT-02b-11
FORMULA_NAME ASLink-PT-02b-12
FORMULA_NAME ASLink-PT-02b-13
FORMULA_NAME ASLink-PT-02b-14
FORMULA_NAME ASLink-PT-02b-15

=== Now, execution of the tool begins

BK_START 1620395525539

Running Version 0
[2021-05-07 13:52:07] [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]
[2021-05-07 13:52:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-07 13:52:07] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2021-05-07 13:52:07] [INFO ] Transformed 1242 places.
[2021-05-07 13:52:07] [INFO ] Transformed 1621 transitions.
[2021-05-07 13:52:07] [INFO ] Found NUPN structural information;
[2021-05-07 13:52:07] [INFO ] Parsed PT model containing 1242 places and 1621 transitions in 161 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Support contains 56 out of 1242 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1242/1242 places, 1621/1621 transitions.
Discarding 71 places :
Symmetric choice reduction at 0 with 71 rule applications. Total rules 71 place count 1171 transition count 1550
Iterating global reduction 0 with 71 rules applied. Total rules applied 142 place count 1171 transition count 1550
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 143 place count 1171 transition count 1549
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 166 place count 1148 transition count 1508
Iterating global reduction 1 with 23 rules applied. Total rules applied 189 place count 1148 transition count 1508
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 197 place count 1148 transition count 1500
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 203 place count 1142 transition count 1494
Iterating global reduction 2 with 6 rules applied. Total rules applied 209 place count 1142 transition count 1494
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 213 place count 1138 transition count 1483
Iterating global reduction 2 with 4 rules applied. Total rules applied 217 place count 1138 transition count 1483
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 220 place count 1135 transition count 1480
Iterating global reduction 2 with 3 rules applied. Total rules applied 223 place count 1135 transition count 1480
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 226 place count 1132 transition count 1470
Iterating global reduction 2 with 3 rules applied. Total rules applied 229 place count 1132 transition count 1470
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 230 place count 1131 transition count 1462
Iterating global reduction 2 with 1 rules applied. Total rules applied 231 place count 1131 transition count 1462
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 232 place count 1130 transition count 1461
Iterating global reduction 2 with 1 rules applied. Total rules applied 233 place count 1130 transition count 1461
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 234 place count 1129 transition count 1453
Iterating global reduction 2 with 1 rules applied. Total rules applied 235 place count 1129 transition count 1453
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 236 place count 1128 transition count 1445
Iterating global reduction 2 with 1 rules applied. Total rules applied 237 place count 1128 transition count 1445
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 238 place count 1127 transition count 1444
Iterating global reduction 2 with 1 rules applied. Total rules applied 239 place count 1127 transition count 1444
Applied a total of 239 rules in 1064 ms. Remains 1127 /1242 variables (removed 115) and now considering 1444/1621 (removed 177) transitions.
// Phase 1: matrix 1444 rows 1127 cols
[2021-05-07 13:52:08] [INFO ] Computed 121 place invariants in 112 ms
[2021-05-07 13:52:09] [INFO ] Implicit Places using invariants in 664 ms returned [959, 970, 981, 989, 997, 1005, 1013, 1024, 1032, 1040, 1051]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 695 ms to find 11 implicit places.
// Phase 1: matrix 1444 rows 1116 cols
[2021-05-07 13:52:09] [INFO ] Computed 110 place invariants in 74 ms
[2021-05-07 13:52:10] [INFO ] Dead Transitions using invariants and state equation in 819 ms returned []
Starting structural reductions, iteration 1 : 1116/1242 places, 1444/1621 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1103 transition count 1431
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1103 transition count 1431
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 37 place count 1092 transition count 1420
Iterating global reduction 0 with 11 rules applied. Total rules applied 48 place count 1092 transition count 1420
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 57 place count 1083 transition count 1411
Iterating global reduction 0 with 9 rules applied. Total rules applied 66 place count 1083 transition count 1411
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 70 place count 1079 transition count 1407
Iterating global reduction 0 with 4 rules applied. Total rules applied 74 place count 1079 transition count 1407
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 76 place count 1077 transition count 1405
Iterating global reduction 0 with 2 rules applied. Total rules applied 78 place count 1077 transition count 1405
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 80 place count 1075 transition count 1403
Iterating global reduction 0 with 2 rules applied. Total rules applied 82 place count 1075 transition count 1403
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 84 place count 1073 transition count 1401
Iterating global reduction 0 with 2 rules applied. Total rules applied 86 place count 1073 transition count 1401
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 88 place count 1071 transition count 1399
Iterating global reduction 0 with 2 rules applied. Total rules applied 90 place count 1071 transition count 1399
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 1070 transition count 1398
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 1070 transition count 1398
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 1069 transition count 1397
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 1069 transition count 1397
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 1068 transition count 1396
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 1068 transition count 1396
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 1067 transition count 1395
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 1067 transition count 1395
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 99 place count 1066 transition count 1394
Iterating global reduction 0 with 1 rules applied. Total rules applied 100 place count 1066 transition count 1394
Applied a total of 100 rules in 385 ms. Remains 1066 /1116 variables (removed 50) and now considering 1394/1444 (removed 50) transitions.
// Phase 1: matrix 1394 rows 1066 cols
[2021-05-07 13:52:10] [INFO ] Computed 110 place invariants in 43 ms
[2021-05-07 13:52:10] [INFO ] Implicit Places using invariants in 361 ms returned []
// Phase 1: matrix 1394 rows 1066 cols
[2021-05-07 13:52:10] [INFO ] Computed 110 place invariants in 13 ms
[2021-05-07 13:52:12] [INFO ] Implicit Places using invariants and state equation in 1490 ms returned []
Implicit Place search using SMT with State Equation took 1853 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1066/1242 places, 1394/1621 transitions.
[2021-05-07 13:52:12] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-07 13:52:12] [INFO ] Flatten gal took : 158 ms
FORMULA ASLink-PT-02b-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02b-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-07 13:52:12] [INFO ] Flatten gal took : 85 ms
[2021-05-07 13:52:12] [INFO ] Input system was already deterministic with 1394 transitions.
Incomplete random walk after 100000 steps, including 388 resets, run finished after 452 ms. (steps per millisecond=221 ) properties (out of 31) seen :19
Running SMT prover for 12 properties.
// Phase 1: matrix 1394 rows 1066 cols
[2021-05-07 13:52:13] [INFO ] Computed 110 place invariants in 16 ms
[2021-05-07 13:52:13] [INFO ] [Real]Absence check using 27 positive place invariants in 14 ms returned sat
[2021-05-07 13:52:13] [INFO ] [Real]Absence check using 27 positive and 83 generalized place invariants in 26 ms returned sat
[2021-05-07 13:52:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 13:52:14] [INFO ] [Real]Absence check using state equation in 526 ms returned sat
[2021-05-07 13:52:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 13:52:14] [INFO ] [Nat]Absence check using 27 positive place invariants in 14 ms returned sat
[2021-05-07 13:52:14] [INFO ] [Nat]Absence check using 27 positive and 83 generalized place invariants in 24 ms returned sat
[2021-05-07 13:52:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 13:52:14] [INFO ] [Nat]Absence check using state equation in 534 ms returned sat
[2021-05-07 13:52:15] [INFO ] Deduced a trap composed of 40 places in 403 ms of which 4 ms to minimize.
[2021-05-07 13:52:15] [INFO ] Deduced a trap composed of 83 places in 362 ms of which 2 ms to minimize.
[2021-05-07 13:52:16] [INFO ] Deduced a trap composed of 33 places in 274 ms of which 2 ms to minimize.
[2021-05-07 13:52:16] [INFO ] Deduced a trap composed of 94 places in 123 ms of which 0 ms to minimize.
[2021-05-07 13:52:16] [INFO ] Deduced a trap composed of 137 places in 223 ms of which 1 ms to minimize.
[2021-05-07 13:52:16] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1896 ms
[2021-05-07 13:52:16] [INFO ] Computed and/alt/rep : 1157/2697/1157 causal constraints (skipped 236 transitions) in 75 ms.
[2021-05-07 13:52:34] [INFO ] Added : 800 causal constraints over 160 iterations in 17428 ms. Result :unknown
[2021-05-07 13:52:34] [INFO ] [Real]Absence check using 27 positive place invariants in 37 ms returned sat
[2021-05-07 13:52:34] [INFO ] [Real]Absence check using 27 positive and 83 generalized place invariants in 44 ms returned sat
[2021-05-07 13:52:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 13:52:34] [INFO ] [Real]Absence check using state equation in 424 ms returned sat
[2021-05-07 13:52:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 13:52:35] [INFO ] [Nat]Absence check using 27 positive place invariants in 15 ms returned sat
[2021-05-07 13:52:35] [INFO ] [Nat]Absence check using 27 positive and 83 generalized place invariants in 23 ms returned sat
[2021-05-07 13:52:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 13:52:41] [INFO ] [Nat]Absence check using state equation in 6173 ms returned unknown
[2021-05-07 13:52:41] [INFO ] [Real]Absence check using 27 positive place invariants in 25 ms returned sat
[2021-05-07 13:52:41] [INFO ] [Real]Absence check using 27 positive and 83 generalized place invariants in 25 ms returned sat
[2021-05-07 13:52:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 13:52:41] [INFO ] [Real]Absence check using state equation in 535 ms returned sat
[2021-05-07 13:52:42] [INFO ] Deduced a trap composed of 21 places in 512 ms of which 1 ms to minimize.
[2021-05-07 13:52:43] [INFO ] Deduced a trap composed of 33 places in 662 ms of which 1 ms to minimize.
[2021-05-07 13:52:43] [INFO ] Deduced a trap composed of 101 places in 241 ms of which 17 ms to minimize.
[2021-05-07 13:52:43] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 0 ms to minimize.
[2021-05-07 13:52:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1832 ms
[2021-05-07 13:52:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 13:52:44] [INFO ] [Nat]Absence check using 27 positive place invariants in 136 ms returned sat
[2021-05-07 13:52:44] [INFO ] [Nat]Absence check using 27 positive and 83 generalized place invariants in 36 ms returned sat
[2021-05-07 13:52:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 13:52:44] [INFO ] [Nat]Absence check using state equation in 483 ms returned sat
[2021-05-07 13:52:44] [INFO ] Deduced a trap composed of 21 places in 181 ms of which 1 ms to minimize.
[2021-05-07 13:52:45] [INFO ] Deduced a trap composed of 24 places in 183 ms of which 0 ms to minimize.
[2021-05-07 13:52:45] [INFO ] Deduced a trap composed of 179 places in 179 ms of which 1 ms to minimize.
[2021-05-07 13:52:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 741 ms
[2021-05-07 13:52:45] [INFO ] Computed and/alt/rep : 1157/2697/1157 causal constraints (skipped 236 transitions) in 84 ms.
[2021-05-07 13:53:04] [INFO ] Deduced a trap composed of 13 places in 428 ms of which 1 ms to minimize.
[2021-05-07 13:53:04] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
[2021-05-07 13:53:04] [INFO ] [Real]Absence check using 27 positive place invariants in 14 ms returned sat
[2021-05-07 13:53:04] [INFO ] [Real]Absence check using 27 positive and 83 generalized place invariants in 25 ms returned sat
[2021-05-07 13:53:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 13:53:04] [INFO ] [Real]Absence check using state equation in 458 ms returned sat
[2021-05-07 13:53:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 13:53:05] [INFO ] [Nat]Absence check using 27 positive place invariants in 15 ms returned sat
[2021-05-07 13:53:05] [INFO ] [Nat]Absence check using 27 positive and 83 generalized place invariants in 26 ms returned sat
[2021-05-07 13:53:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 13:53:09] [INFO ] [Nat]Absence check using state equation in 4587 ms returned unsat
[2021-05-07 13:53:09] [INFO ] [Real]Absence check using 27 positive place invariants in 14 ms returned sat
[2021-05-07 13:53:09] [INFO ] [Real]Absence check using 27 positive and 83 generalized place invariants in 25 ms returned sat
[2021-05-07 13:53:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 13:53:10] [INFO ] [Real]Absence check using state equation in 545 ms returned sat
[2021-05-07 13:53:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 13:53:10] [INFO ] [Nat]Absence check using 27 positive place invariants in 15 ms returned sat
[2021-05-07 13:53:10] [INFO ] [Nat]Absence check using 27 positive and 83 generalized place invariants in 24 ms returned sat
[2021-05-07 13:53:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 13:53:17] [INFO ] [Nat]Absence check using state equation in 6355 ms returned unknown
[2021-05-07 13:53:17] [INFO ] [Real]Absence check using 27 positive place invariants in 14 ms returned sat
[2021-05-07 13:53:17] [INFO ] [Real]Absence check using 27 positive and 83 generalized place invariants in 23 ms returned sat
[2021-05-07 13:53:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 13:53:17] [INFO ] [Real]Absence check using state equation in 512 ms returned sat
[2021-05-07 13:53:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 13:53:17] [INFO ] [Nat]Absence check using 27 positive place invariants in 15 ms returned sat
[2021-05-07 13:53:17] [INFO ] [Nat]Absence check using 27 positive and 83 generalized place invariants in 23 ms returned sat
[2021-05-07 13:53:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 13:53:24] [INFO ] [Nat]Absence check using state equation in 6321 ms returned unknown
[2021-05-07 13:53:24] [INFO ] [Real]Absence check using 27 positive place invariants in 14 ms returned sat
[2021-05-07 13:53:24] [INFO ] [Real]Absence check using 27 positive and 83 generalized place invariants in 25 ms returned sat
[2021-05-07 13:53:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 13:53:24] [INFO ] [Real]Absence check using state equation in 518 ms returned sat
[2021-05-07 13:53:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 13:53:25] [INFO ] [Nat]Absence check using 27 positive place invariants in 15 ms returned sat
[2021-05-07 13:53:25] [INFO ] [Nat]Absence check using 27 positive and 83 generalized place invariants in 25 ms returned sat
[2021-05-07 13:53:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 13:53:29] [INFO ] [Nat]Absence check using state equation in 4830 ms returned unknown
[2021-05-07 13:53:30] [INFO ] [Real]Absence check using 27 positive place invariants in 14 ms returned sat
[2021-05-07 13:53:30] [INFO ] [Real]Absence check using 27 positive and 83 generalized place invariants in 24 ms returned sat
[2021-05-07 13:53:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 13:53:30] [INFO ] [Real]Absence check using state equation in 461 ms returned sat
[2021-05-07 13:53:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 13:53:30] [INFO ] [Nat]Absence check using 27 positive place invariants in 15 ms returned sat
[2021-05-07 13:53:30] [INFO ] [Nat]Absence check using 27 positive and 83 generalized place invariants in 24 ms returned sat
[2021-05-07 13:53:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 13:53:36] [INFO ] [Nat]Absence check using state equation in 6198 ms returned unknown
[2021-05-07 13:53:37] [INFO ] [Real]Absence check using 27 positive place invariants in 14 ms returned sat
[2021-05-07 13:53:37] [INFO ] [Real]Absence check using 27 positive and 83 generalized place invariants in 24 ms returned sat
[2021-05-07 13:53:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 13:53:37] [INFO ] [Real]Absence check using state equation in 513 ms returned sat
[2021-05-07 13:53:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 13:53:37] [INFO ] [Nat]Absence check using 27 positive place invariants in 15 ms returned sat
[2021-05-07 13:53:37] [INFO ] [Nat]Absence check using 27 positive and 83 generalized place invariants in 23 ms returned sat
[2021-05-07 13:53:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 13:53:43] [INFO ] [Nat]Absence check using state equation in 6267 ms returned unknown
[2021-05-07 13:53:44] [INFO ] [Real]Absence check using 27 positive place invariants in 14 ms returned sat
[2021-05-07 13:53:44] [INFO ] [Real]Absence check using 27 positive and 83 generalized place invariants in 24 ms returned sat
[2021-05-07 13:53:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 13:53:44] [INFO ] [Real]Absence check using state equation in 460 ms returned sat
[2021-05-07 13:53:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 13:53:44] [INFO ] [Nat]Absence check using 27 positive place invariants in 15 ms returned sat
[2021-05-07 13:53:44] [INFO ] [Nat]Absence check using 27 positive and 83 generalized place invariants in 24 ms returned sat
[2021-05-07 13:53:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 13:53:51] [INFO ] [Nat]Absence check using state equation in 6300 ms returned unknown
[2021-05-07 13:53:51] [INFO ] [Real]Absence check using 27 positive place invariants in 13 ms returned sat
[2021-05-07 13:53:51] [INFO ] [Real]Absence check using 27 positive and 83 generalized place invariants in 24 ms returned sat
[2021-05-07 13:53:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 13:53:51] [INFO ] [Real]Absence check using state equation in 454 ms returned sat
[2021-05-07 13:53:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 13:53:51] [INFO ] [Nat]Absence check using 27 positive place invariants in 14 ms returned sat
[2021-05-07 13:53:51] [INFO ] [Nat]Absence check using 27 positive and 83 generalized place invariants in 23 ms returned sat
[2021-05-07 13:53:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 13:53:55] [INFO ] [Nat]Absence check using state equation in 3778 ms returned unknown
[2021-05-07 13:53:55] [INFO ] [Real]Absence check using 27 positive place invariants in 13 ms returned sat
[2021-05-07 13:53:55] [INFO ] [Real]Absence check using 27 positive and 83 generalized place invariants in 23 ms returned sat
[2021-05-07 13:53:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 13:53:56] [INFO ] [Real]Absence check using state equation in 464 ms returned sat
[2021-05-07 13:53:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 13:53:56] [INFO ] [Nat]Absence check using 27 positive place invariants in 14 ms returned sat
[2021-05-07 13:53:56] [INFO ] [Nat]Absence check using 27 positive and 83 generalized place invariants in 23 ms returned sat
[2021-05-07 13:53:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 13:54:01] [INFO ] [Nat]Absence check using state equation in 4892 ms returned unknown
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2021-05-07 13:54:01] [INFO ] Initial state test concluded for 1 properties.
FORMULA ASLink-PT-02b-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 1066 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1066/1066 places, 1394/1394 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 183 transitions
Trivial Post-agglo rules discarded 183 transitions
Performed 183 trivial Post agglomeration. Transition count delta: 183
Iterating post reduction 0 with 183 rules applied. Total rules applied 183 place count 1065 transition count 1210
Reduce places removed 183 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 185 rules applied. Total rules applied 368 place count 882 transition count 1208
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 372 place count 881 transition count 1205
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 375 place count 879 transition count 1204
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 376 place count 878 transition count 1204
Performed 282 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 282 Pre rules applied. Total rules applied 376 place count 878 transition count 922
Deduced a syphon composed of 282 places in 1 ms
Ensure Unique test removed 23 places
Reduce places removed 305 places and 0 transitions.
Iterating global reduction 5 with 587 rules applied. Total rules applied 963 place count 573 transition count 922
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 5 with 18 rules applied. Total rules applied 981 place count 571 transition count 906
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 6 with 16 rules applied. Total rules applied 997 place count 555 transition count 906
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 8 Pre rules applied. Total rules applied 997 place count 555 transition count 898
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 1021 place count 539 transition count 898
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 7 Pre rules applied. Total rules applied 1021 place count 539 transition count 891
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 1035 place count 532 transition count 891
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1038 place count 529 transition count 881
Iterating global reduction 7 with 3 rules applied. Total rules applied 1041 place count 529 transition count 881
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1041 place count 529 transition count 880
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1043 place count 528 transition count 880
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1044 place count 527 transition count 872
Iterating global reduction 7 with 1 rules applied. Total rules applied 1045 place count 527 transition count 872
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1046 place count 526 transition count 864
Iterating global reduction 7 with 1 rules applied. Total rules applied 1047 place count 526 transition count 864
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1048 place count 525 transition count 856
Iterating global reduction 7 with 1 rules applied. Total rules applied 1049 place count 525 transition count 856
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1050 place count 524 transition count 848
Iterating global reduction 7 with 1 rules applied. Total rules applied 1051 place count 524 transition count 848
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1052 place count 523 transition count 840
Iterating global reduction 7 with 1 rules applied. Total rules applied 1053 place count 523 transition count 840
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1054 place count 522 transition count 832
Iterating global reduction 7 with 1 rules applied. Total rules applied 1055 place count 522 transition count 832
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1056 place count 521 transition count 824
Iterating global reduction 7 with 1 rules applied. Total rules applied 1057 place count 521 transition count 824
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1058 place count 520 transition count 816
Iterating global reduction 7 with 1 rules applied. Total rules applied 1059 place count 520 transition count 816
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1060 place count 519 transition count 808
Iterating global reduction 7 with 1 rules applied. Total rules applied 1061 place count 519 transition count 808
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1062 place count 518 transition count 800
Iterating global reduction 7 with 1 rules applied. Total rules applied 1063 place count 518 transition count 800
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 7 with 180 rules applied. Total rules applied 1243 place count 427 transition count 711
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1247 place count 423 transition count 707
Ensure Unique test removed 1 places
Iterating global reduction 7 with 5 rules applied. Total rules applied 1252 place count 422 transition count 707
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 1253 place count 422 transition count 706
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1254 place count 421 transition count 706
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 1254 place count 421 transition count 705
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1256 place count 420 transition count 705
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1258 place count 418 transition count 703
Iterating global reduction 9 with 2 rules applied. Total rules applied 1260 place count 418 transition count 703
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 9 with 2 rules applied. Total rules applied 1262 place count 418 transition count 701
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1263 place count 417 transition count 701
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1265 place count 416 transition count 706
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1266 place count 415 transition count 705
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1267 place count 414 transition count 704
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 11 with 6 rules applied. Total rules applied 1273 place count 410 transition count 702
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1275 place count 408 transition count 702
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 6 Pre rules applied. Total rules applied 1275 place count 408 transition count 696
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 13 with 13 rules applied. Total rules applied 1288 place count 401 transition count 696
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 13 with 5 rules applied. Total rules applied 1293 place count 396 transition count 696
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 1293 place count 396 transition count 695
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 1295 place count 395 transition count 695
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 14 with 14 rules applied. Total rules applied 1309 place count 388 transition count 688
Discarding 4 places :
Symmetric choice reduction at 14 with 4 rule applications. Total rules 1313 place count 384 transition count 684
Iterating global reduction 14 with 4 rules applied. Total rules applied 1317 place count 384 transition count 684
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 1319 place count 382 transition count 682
Iterating global reduction 14 with 2 rules applied. Total rules applied 1321 place count 382 transition count 682
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 1323 place count 382 transition count 680
Applied a total of 1323 rules in 766 ms. Remains 382 /1066 variables (removed 684) and now considering 680/1394 (removed 714) transitions.
// Phase 1: matrix 680 rows 382 cols
[2021-05-07 13:54:02] [INFO ] Computed 64 place invariants in 6 ms
[2021-05-07 13:54:02] [INFO ] Implicit Places using invariants in 657 ms returned [1, 18, 19, 31, 49, 67, 86, 144, 154, 155, 157, 174, 192, 213, 264, 265, 268, 279, 280, 281, 299, 320, 321, 322, 323]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 660 ms to find 25 implicit places.
[2021-05-07 13:54:02] [INFO ] Redundant transitions in 39 ms returned []
// Phase 1: matrix 680 rows 357 cols
[2021-05-07 13:54:02] [INFO ] Computed 39 place invariants in 5 ms
[2021-05-07 13:54:03] [INFO ] Dead Transitions using invariants and state equation in 270 ms returned []
Starting structural reductions, iteration 1 : 357/1066 places, 680/1394 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 357 transition count 638
Reduce places removed 42 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 43 rules applied. Total rules applied 85 place count 315 transition count 637
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 86 place count 314 transition count 637
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 86 place count 314 transition count 623
Deduced a syphon composed of 14 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 29 rules applied. Total rules applied 115 place count 299 transition count 623
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 127 place count 295 transition count 615
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 135 place count 287 transition count 615
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 138 place count 284 transition count 612
Iterating global reduction 5 with 3 rules applied. Total rules applied 141 place count 284 transition count 612
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 144 place count 284 transition count 609
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 186 place count 263 transition count 588
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 190 place count 261 transition count 589
Applied a total of 190 rules in 59 ms. Remains 261 /357 variables (removed 96) and now considering 589/680 (removed 91) transitions.
// Phase 1: matrix 589 rows 261 cols
[2021-05-07 13:54:03] [INFO ] Computed 34 place invariants in 4 ms
[2021-05-07 13:54:03] [INFO ] Implicit Places using invariants in 147 ms returned [101, 106, 182, 188, 193, 258]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 150 ms to find 6 implicit places.
Starting structural reductions, iteration 2 : 255/1066 places, 589/1394 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 255 transition count 588
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 254 transition count 588
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 5 place count 251 transition count 585
Iterating global reduction 2 with 3 rules applied. Total rules applied 8 place count 251 transition count 585
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 11 place count 248 transition count 582
Iterating global reduction 2 with 3 rules applied. Total rules applied 14 place count 248 transition count 582
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 247 transition count 581
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 247 transition count 581
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 20 place count 245 transition count 579
Applied a total of 20 rules in 34 ms. Remains 245 /255 variables (removed 10) and now considering 579/589 (removed 10) transitions.
// Phase 1: matrix 579 rows 245 cols
[2021-05-07 13:54:03] [INFO ] Computed 28 place invariants in 4 ms
[2021-05-07 13:54:03] [INFO ] Implicit Places using invariants in 133 ms returned []
// Phase 1: matrix 579 rows 245 cols
[2021-05-07 13:54:03] [INFO ] Computed 28 place invariants in 4 ms
[2021-05-07 13:54:03] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 245/1066 places, 579/1394 transitions.
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ASLink-PT-02b-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(OR (AND (EQ s27 1) (EQ s147 1)) (AND (EQ s91 1) (EQ s93 1) (EQ s95 1))), p0:(AND (EQ s27 1) (EQ s147 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-02b-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02b-01 finished in 2683 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G((F(p0)&&(p1||X(F(p2))))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 1066 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1066/1066 places, 1394/1394 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1059 transition count 1380
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1059 transition count 1380
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 1055 transition count 1369
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 1055 transition count 1369
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 1055 transition count 1368
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 1054 transition count 1367
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 1054 transition count 1367
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 1053 transition count 1359
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 1053 transition count 1359
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 1052 transition count 1351
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 1052 transition count 1351
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 1051 transition count 1350
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 1051 transition count 1350
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 1050 transition count 1342
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 1050 transition count 1342
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 1049 transition count 1334
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 1049 transition count 1334
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 1048 transition count 1333
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 1048 transition count 1333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 1047 transition count 1325
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 1047 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 1046 transition count 1317
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 1046 transition count 1317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 1045 transition count 1316
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 1045 transition count 1316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 1044 transition count 1308
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 1044 transition count 1308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 1043 transition count 1300
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 1043 transition count 1300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 1042 transition count 1299
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 1042 transition count 1299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 1041 transition count 1291
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 1041 transition count 1291
Applied a total of 51 rules in 470 ms. Remains 1041 /1066 variables (removed 25) and now considering 1291/1394 (removed 103) transitions.
// Phase 1: matrix 1291 rows 1041 cols
[2021-05-07 13:54:04] [INFO ] Computed 110 place invariants in 11 ms
[2021-05-07 13:54:04] [INFO ] Implicit Places using invariants in 397 ms returned []
// Phase 1: matrix 1291 rows 1041 cols
[2021-05-07 13:54:04] [INFO ] Computed 110 place invariants in 11 ms
[2021-05-07 13:54:07] [INFO ] Implicit Places using invariants and state equation in 2282 ms returned []
Implicit Place search using SMT with State Equation took 2691 ms to find 0 implicit places.
// Phase 1: matrix 1291 rows 1041 cols
[2021-05-07 13:54:07] [INFO ] Computed 110 place invariants in 11 ms
[2021-05-07 13:54:07] [INFO ] Dead Transitions using invariants and state equation in 614 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1041/1066 places, 1291/1394 transitions.
Stuttering acceptance computed with spot in 301 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Running random walk in product with property : ASLink-PT-02b-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s22 1) (EQ s161 1)), p1:(EQ s399 0), p2:(OR (NEQ s37 1) (NEQ s166 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 168 steps with 0 reset in 2 ms.
FORMULA ASLink-PT-02b-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02b-03 finished in 4106 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((X((G(p1) U (p2&&G(p1))))||p0))))], workingDir=/home/mcc/execution]
Support contains 5 out of 1066 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1066/1066 places, 1394/1394 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1059 transition count 1380
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1059 transition count 1380
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 1055 transition count 1369
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 1055 transition count 1369
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 1055 transition count 1368
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 1054 transition count 1367
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 1054 transition count 1367
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 1053 transition count 1359
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 1053 transition count 1359
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 1052 transition count 1351
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 1052 transition count 1351
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 1051 transition count 1350
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 1051 transition count 1350
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 1050 transition count 1342
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 1050 transition count 1342
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 1049 transition count 1334
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 1049 transition count 1334
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 1048 transition count 1333
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 1048 transition count 1333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 1047 transition count 1325
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 1047 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 1046 transition count 1317
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 1046 transition count 1317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 1045 transition count 1316
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 1045 transition count 1316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 1044 transition count 1308
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 1044 transition count 1308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 1043 transition count 1300
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 1043 transition count 1300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 1042 transition count 1299
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 1042 transition count 1299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 1041 transition count 1291
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 1041 transition count 1291
Applied a total of 51 rules in 530 ms. Remains 1041 /1066 variables (removed 25) and now considering 1291/1394 (removed 103) transitions.
// Phase 1: matrix 1291 rows 1041 cols
[2021-05-07 13:54:08] [INFO ] Computed 110 place invariants in 13 ms
[2021-05-07 13:54:09] [INFO ] Implicit Places using invariants in 375 ms returned []
// Phase 1: matrix 1291 rows 1041 cols
[2021-05-07 13:54:09] [INFO ] Computed 110 place invariants in 11 ms
[2021-05-07 13:54:12] [INFO ] Implicit Places using invariants and state equation in 3662 ms returned []
Implicit Place search using SMT with State Equation took 4047 ms to find 0 implicit places.
// Phase 1: matrix 1291 rows 1041 cols
[2021-05-07 13:54:12] [INFO ] Computed 110 place invariants in 11 ms
[2021-05-07 13:54:13] [INFO ] Dead Transitions using invariants and state equation in 599 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1041/1066 places, 1291/1394 transitions.
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (OR (NOT p2) (NOT p1))]
Running random walk in product with property : ASLink-PT-02b-04 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p2 p1), acceptance={0} source=5 dest: 0}, { cond=(NOT p1), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=5 dest: 5}]], initial=3, aps=[p1:(AND (EQ s9 1) (EQ s49 1)), p0:(OR (EQ s870 0) (EQ s995 0) (EQ s457 1)), p2:(EQ s457 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 717 ms.
Product exploration explored 100000 steps with 33333 reset in 598 ms.
Knowledge obtained : [(NOT p1), p0, (NOT p2)]
Stuttering acceptance computed with spot in 180 ms :[(NOT p1), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (OR (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 33333 reset in 639 ms.
Product exploration explored 100000 steps with 33333 reset in 634 ms.
Applying partial POR strategy [true, false, false, false, true, true]
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (OR (NOT p2) (NOT p1))]
Support contains 5 out of 1041 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1041/1041 places, 1291/1291 transitions.
Performed 178 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 178 rules applied. Total rules applied 178 place count 1041 transition count 1291
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 179 place count 1041 transition count 1290
Performed 229 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 229 Pre rules applied. Total rules applied 179 place count 1041 transition count 1793
Deduced a syphon composed of 407 places in 3 ms
Iterating global reduction 2 with 229 rules applied. Total rules applied 408 place count 1041 transition count 1793
Discarding 80 places :
Symmetric choice reduction at 2 with 80 rule applications. Total rules 488 place count 961 transition count 1683
Deduced a syphon composed of 327 places in 2 ms
Iterating global reduction 2 with 80 rules applied. Total rules applied 568 place count 961 transition count 1683
Performed 139 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 466 places in 1 ms
Iterating global reduction 2 with 139 rules applied. Total rules applied 707 place count 961 transition count 1684
Discarding 78 places :
Symmetric choice reduction at 2 with 78 rule applications. Total rules 785 place count 883 transition count 1602
Deduced a syphon composed of 392 places in 2 ms
Iterating global reduction 2 with 78 rules applied. Total rules applied 863 place count 883 transition count 1602
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 865 place count 881 transition count 1599
Deduced a syphon composed of 392 places in 2 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 867 place count 881 transition count 1599
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 869 place count 881 transition count 1597
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 407 places in 1 ms
Iterating global reduction 3 with 15 rules applied. Total rules applied 884 place count 881 transition count 1662
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 889 place count 876 transition count 1652
Deduced a syphon composed of 402 places in 1 ms
Iterating global reduction 3 with 5 rules applied. Total rules applied 894 place count 876 transition count 1652
Performed 2(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 404 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 896 place count 876 transition count 1664
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 898 place count 874 transition count 1656
Deduced a syphon composed of 402 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 900 place count 874 transition count 1656
Deduced a syphon composed of 402 places in 1 ms
Applied a total of 900 rules in 410 ms. Remains 874 /1041 variables (removed 167) and now considering 1656/1291 (removed -365) transitions.
[2021-05-07 13:54:17] [INFO ] Redundant transitions in 101 ms returned []
// Phase 1: matrix 1656 rows 874 cols
[2021-05-07 13:54:17] [INFO ] Computed 110 place invariants in 18 ms
[2021-05-07 13:54:18] [INFO ] Dead Transitions using invariants and state equation in 795 ms returned []
Finished structural reductions, in 1 iterations. Remains : 874/1041 places, 1656/1291 transitions.
Product exploration explored 100000 steps with 33333 reset in 651 ms.
Product exploration explored 100000 steps with 33333 reset in 629 ms.
[2021-05-07 13:54:19] [INFO ] Flatten gal took : 63 ms
[2021-05-07 13:54:19] [INFO ] Flatten gal took : 56 ms
[2021-05-07 13:54:19] [INFO ] Time to serialize gal into /tmp/LTL1780006771798433394.gal : 27 ms
[2021-05-07 13:54:19] [INFO ] Time to serialize properties into /tmp/LTL9387112059559978909.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL1780006771798433394.gal, -t, CGAL, -LTL, /tmp/LTL9387112059559978909.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1780006771798433394.gal -t CGAL -LTL /tmp/LTL9387112059559978909.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(("(((p973==0)||(p1188==0))||(p499==1))")||(X((G("((p9==1)&&(p52==1))"))U(("(p499==1)")&&(G("((p9==1)&&(p52==1))")))))))))
Formula 0 simplified : !XX("(((p973==0)||(p1188==0))||(p499==1))" | X(G"((p9==1)&&(p52==1))" U ("(p499==1)" & G"((p9==1)&&(p52==1))")))
Detected timeout of ITS tools.
[2021-05-07 13:54:34] [INFO ] Flatten gal took : 55 ms
[2021-05-07 13:54:34] [INFO ] Applying decomposition
[2021-05-07 13:54:34] [INFO ] Flatten gal took : 48 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph17511340236833639872.txt, -o, /tmp/graph17511340236833639872.bin, -w, /tmp/graph17511340236833639872.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph17511340236833639872.bin, -l, -1, -v, -w, /tmp/graph17511340236833639872.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-07 13:54:34] [INFO ] Decomposing Gal with order
[2021-05-07 13:54:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-07 13:54:35] [INFO ] Removed a total of 1003 redundant transitions.
[2021-05-07 13:54:35] [INFO ] Flatten gal took : 115 ms
[2021-05-07 13:54:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 21 ms.
[2021-05-07 13:54:35] [INFO ] Time to serialize gal into /tmp/LTL5666115682944046682.gal : 14 ms
[2021-05-07 13:54:35] [INFO ] Time to serialize properties into /tmp/LTL14481914188642547633.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL5666115682944046682.gal, -t, CGAL, -LTL, /tmp/LTL14481914188642547633.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5666115682944046682.gal -t CGAL -LTL /tmp/LTL14481914188642547633.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(("(((i19.u328.p973==0)||(i19.u351.p1188==0))||(i9.u172.p499==1))")||(X((G("((i2.u5.p9==1)&&(i1.u17.p52==1))"))U(("(i9.u172.p499==1)")&&(G("((i2.u5.p9==1)&&(i1.u17.p52==1))")))))))))
Formula 0 simplified : !XX("(((i19.u328.p973==0)||(i19.u351.p1188==0))||(i9.u172.p499==1))" | X(G"((i2.u5.p9==1)&&(i1.u17.p52==1))" U ("(i9.u172.p499==1)" & G"((i2.u5.p9==1)&&(i1.u17.p52==1))")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7818018350129129079
[2021-05-07 13:54:50] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7818018350129129079
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7818018350129129079]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7818018350129129079] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7818018350129129079] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property ASLink-PT-02b-04 finished in 43092 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 1066 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1066/1066 places, 1394/1394 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 187 transitions
Trivial Post-agglo rules discarded 187 transitions
Performed 187 trivial Post agglomeration. Transition count delta: 187
Iterating post reduction 0 with 187 rules applied. Total rules applied 187 place count 1065 transition count 1206
Reduce places removed 187 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 189 rules applied. Total rules applied 376 place count 878 transition count 1204
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 380 place count 877 transition count 1201
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 383 place count 875 transition count 1200
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 384 place count 874 transition count 1200
Performed 284 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 284 Pre rules applied. Total rules applied 384 place count 874 transition count 916
Deduced a syphon composed of 284 places in 1 ms
Ensure Unique test removed 24 places
Reduce places removed 308 places and 0 transitions.
Iterating global reduction 5 with 592 rules applied. Total rules applied 976 place count 566 transition count 916
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 5 with 18 rules applied. Total rules applied 994 place count 564 transition count 900
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 6 with 16 rules applied. Total rules applied 1010 place count 548 transition count 900
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 9 Pre rules applied. Total rules applied 1010 place count 548 transition count 891
Deduced a syphon composed of 9 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 7 with 27 rules applied. Total rules applied 1037 place count 530 transition count 891
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 8 Pre rules applied. Total rules applied 1037 place count 530 transition count 883
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 1053 place count 522 transition count 883
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1056 place count 519 transition count 873
Iterating global reduction 7 with 3 rules applied. Total rules applied 1059 place count 519 transition count 873
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1059 place count 519 transition count 872
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1061 place count 518 transition count 872
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1062 place count 517 transition count 864
Iterating global reduction 7 with 1 rules applied. Total rules applied 1063 place count 517 transition count 864
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1064 place count 516 transition count 856
Iterating global reduction 7 with 1 rules applied. Total rules applied 1065 place count 516 transition count 856
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1066 place count 515 transition count 848
Iterating global reduction 7 with 1 rules applied. Total rules applied 1067 place count 515 transition count 848
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1068 place count 514 transition count 840
Iterating global reduction 7 with 1 rules applied. Total rules applied 1069 place count 514 transition count 840
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1070 place count 513 transition count 832
Iterating global reduction 7 with 1 rules applied. Total rules applied 1071 place count 513 transition count 832
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1072 place count 512 transition count 824
Iterating global reduction 7 with 1 rules applied. Total rules applied 1073 place count 512 transition count 824
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1074 place count 511 transition count 816
Iterating global reduction 7 with 1 rules applied. Total rules applied 1075 place count 511 transition count 816
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1076 place count 510 transition count 808
Iterating global reduction 7 with 1 rules applied. Total rules applied 1077 place count 510 transition count 808
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1078 place count 509 transition count 800
Iterating global reduction 7 with 1 rules applied. Total rules applied 1079 place count 509 transition count 800
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1080 place count 508 transition count 792
Iterating global reduction 7 with 1 rules applied. Total rules applied 1081 place count 508 transition count 792
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 84
Deduced a syphon composed of 84 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 7 with 170 rules applied. Total rules applied 1251 place count 422 transition count 708
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1255 place count 418 transition count 704
Ensure Unique test removed 1 places
Iterating global reduction 7 with 5 rules applied. Total rules applied 1260 place count 417 transition count 704
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 1261 place count 417 transition count 703
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1262 place count 416 transition count 703
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 1262 place count 416 transition count 702
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1264 place count 415 transition count 702
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1266 place count 413 transition count 700
Iterating global reduction 9 with 2 rules applied. Total rules applied 1268 place count 413 transition count 700
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 9 with 2 rules applied. Total rules applied 1270 place count 413 transition count 698
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1271 place count 412 transition count 698
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1273 place count 411 transition count 703
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1274 place count 410 transition count 702
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1275 place count 409 transition count 701
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 11 with 6 rules applied. Total rules applied 1281 place count 405 transition count 699
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1283 place count 403 transition count 699
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 6 Pre rules applied. Total rules applied 1283 place count 403 transition count 693
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 13 with 13 rules applied. Total rules applied 1296 place count 396 transition count 693
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 13 with 5 rules applied. Total rules applied 1301 place count 391 transition count 693
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 1301 place count 391 transition count 692
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 1303 place count 390 transition count 692
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 14 with 14 rules applied. Total rules applied 1317 place count 383 transition count 685
Discarding 4 places :
Symmetric choice reduction at 14 with 4 rule applications. Total rules 1321 place count 379 transition count 681
Iterating global reduction 14 with 4 rules applied. Total rules applied 1325 place count 379 transition count 681
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 1327 place count 377 transition count 679
Iterating global reduction 14 with 2 rules applied. Total rules applied 1329 place count 377 transition count 679
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 1331 place count 377 transition count 677
Applied a total of 1331 rules in 385 ms. Remains 377 /1066 variables (removed 689) and now considering 677/1394 (removed 717) transitions.
// Phase 1: matrix 677 rows 377 cols
[2021-05-07 13:54:51] [INFO ] Computed 62 place invariants in 6 ms
[2021-05-07 13:54:51] [INFO ] Implicit Places using invariants in 227 ms returned [1, 18, 19, 34, 69, 88, 140, 150, 151, 153, 170, 188, 208, 259, 260, 263, 274, 275, 276, 294, 315, 316, 317, 318]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 228 ms to find 24 implicit places.
[2021-05-07 13:54:51] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 677 rows 353 cols
[2021-05-07 13:54:51] [INFO ] Computed 38 place invariants in 4 ms
[2021-05-07 13:54:52] [INFO ] Dead Transitions using invariants and state equation in 248 ms returned []
Starting structural reductions, iteration 1 : 353/1066 places, 677/1394 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 353 transition count 638
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 78 place count 314 transition count 638
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 78 place count 314 transition count 623
Deduced a syphon composed of 15 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 31 rules applied. Total rules applied 109 place count 298 transition count 623
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 121 place count 294 transition count 615
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 129 place count 286 transition count 615
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 132 place count 283 transition count 612
Iterating global reduction 4 with 3 rules applied. Total rules applied 135 place count 283 transition count 612
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 138 place count 283 transition count 609
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 170 place count 267 transition count 593
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 174 place count 265 transition count 594
Applied a total of 174 rules in 36 ms. Remains 265 /353 variables (removed 88) and now considering 594/677 (removed 83) transitions.
// Phase 1: matrix 594 rows 265 cols
[2021-05-07 13:54:52] [INFO ] Computed 33 place invariants in 4 ms
[2021-05-07 13:54:52] [INFO ] Implicit Places using invariants in 144 ms returned [97, 105, 111, 186, 192, 197, 262]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 145 ms to find 7 implicit places.
Starting structural reductions, iteration 2 : 258/1066 places, 594/1394 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 258 transition count 593
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 257 transition count 593
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 6 place count 253 transition count 589
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 253 transition count 589
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 14 place count 249 transition count 585
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 249 transition count 585
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 21 place count 246 transition count 582
Iterating global reduction 2 with 3 rules applied. Total rules applied 24 place count 246 transition count 582
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 245 transition count 581
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 245 transition count 581
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 244 transition count 580
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 244 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 32 place count 242 transition count 578
Applied a total of 32 rules in 38 ms. Remains 242 /258 variables (removed 16) and now considering 578/594 (removed 16) transitions.
// Phase 1: matrix 578 rows 242 cols
[2021-05-07 13:54:52] [INFO ] Computed 26 place invariants in 5 ms
[2021-05-07 13:54:52] [INFO ] Implicit Places using invariants in 133 ms returned []
// Phase 1: matrix 578 rows 242 cols
[2021-05-07 13:54:52] [INFO ] Computed 26 place invariants in 13 ms
[2021-05-07 13:54:52] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 523 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 242/1066 places, 578/1394 transitions.
Stuttering acceptance computed with spot in 80 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ASLink-PT-02b-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s20 1), p1:(EQ s24 1)], 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 5 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-02b-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02b-05 finished in 1712 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 1066 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1066/1066 places, 1394/1394 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1060 transition count 1381
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1060 transition count 1381
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 1057 transition count 1371
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 1057 transition count 1371
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 1057 transition count 1370
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 1056 transition count 1369
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 1056 transition count 1369
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 1055 transition count 1361
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 1055 transition count 1361
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 1054 transition count 1353
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 1054 transition count 1353
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 1053 transition count 1352
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 1053 transition count 1352
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 1052 transition count 1344
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 1052 transition count 1344
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 1051 transition count 1336
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 1051 transition count 1336
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 1050 transition count 1335
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 1050 transition count 1335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 1049 transition count 1327
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 1049 transition count 1327
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 1048 transition count 1319
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 1048 transition count 1319
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 1047 transition count 1318
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 1047 transition count 1318
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 1046 transition count 1310
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 1046 transition count 1310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 1045 transition count 1302
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 1045 transition count 1302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 1044 transition count 1301
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 1044 transition count 1301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 1043 transition count 1293
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 1043 transition count 1293
Applied a total of 47 rules in 497 ms. Remains 1043 /1066 variables (removed 23) and now considering 1293/1394 (removed 101) transitions.
// Phase 1: matrix 1293 rows 1043 cols
[2021-05-07 13:54:53] [INFO ] Computed 110 place invariants in 11 ms
[2021-05-07 13:54:53] [INFO ] Implicit Places using invariants in 381 ms returned []
// Phase 1: matrix 1293 rows 1043 cols
[2021-05-07 13:54:53] [INFO ] Computed 110 place invariants in 10 ms
[2021-05-07 13:54:55] [INFO ] Implicit Places using invariants and state equation in 1576 ms returned []
Implicit Place search using SMT with State Equation took 1958 ms to find 0 implicit places.
// Phase 1: matrix 1293 rows 1043 cols
[2021-05-07 13:54:55] [INFO ] Computed 110 place invariants in 11 ms
[2021-05-07 13:54:56] [INFO ] Dead Transitions using invariants and state equation in 616 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1043/1066 places, 1293/1394 transitions.
Stuttering acceptance computed with spot in 60 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-02b-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s180 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 7767 steps with 31 reset in 52 ms.
FORMULA ASLink-PT-02b-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02b-06 finished in 3207 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 1066 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1066/1066 places, 1394/1394 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 186 transitions
Trivial Post-agglo rules discarded 186 transitions
Performed 186 trivial Post agglomeration. Transition count delta: 186
Iterating post reduction 0 with 186 rules applied. Total rules applied 186 place count 1065 transition count 1207
Reduce places removed 186 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 188 rules applied. Total rules applied 374 place count 879 transition count 1205
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 378 place count 878 transition count 1202
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 380 place count 876 transition count 1202
Performed 284 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 284 Pre rules applied. Total rules applied 380 place count 876 transition count 918
Deduced a syphon composed of 284 places in 1 ms
Ensure Unique test removed 23 places
Reduce places removed 307 places and 0 transitions.
Iterating global reduction 4 with 591 rules applied. Total rules applied 971 place count 569 transition count 918
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 4 with 18 rules applied. Total rules applied 989 place count 567 transition count 902
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 1005 place count 551 transition count 902
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 8 Pre rules applied. Total rules applied 1005 place count 551 transition count 894
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1029 place count 535 transition count 894
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 7 Pre rules applied. Total rules applied 1029 place count 535 transition count 887
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 1043 place count 528 transition count 887
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1046 place count 525 transition count 877
Iterating global reduction 6 with 3 rules applied. Total rules applied 1049 place count 525 transition count 877
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1049 place count 525 transition count 876
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1051 place count 524 transition count 876
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1052 place count 523 transition count 868
Iterating global reduction 6 with 1 rules applied. Total rules applied 1053 place count 523 transition count 868
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1054 place count 522 transition count 860
Iterating global reduction 6 with 1 rules applied. Total rules applied 1055 place count 522 transition count 860
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1056 place count 521 transition count 852
Iterating global reduction 6 with 1 rules applied. Total rules applied 1057 place count 521 transition count 852
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1058 place count 520 transition count 844
Iterating global reduction 6 with 1 rules applied. Total rules applied 1059 place count 520 transition count 844
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1060 place count 519 transition count 836
Iterating global reduction 6 with 1 rules applied. Total rules applied 1061 place count 519 transition count 836
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1062 place count 518 transition count 828
Iterating global reduction 6 with 1 rules applied. Total rules applied 1063 place count 518 transition count 828
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1064 place count 517 transition count 820
Iterating global reduction 6 with 1 rules applied. Total rules applied 1065 place count 517 transition count 820
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1066 place count 516 transition count 812
Iterating global reduction 6 with 1 rules applied. Total rules applied 1067 place count 516 transition count 812
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1068 place count 515 transition count 804
Iterating global reduction 6 with 1 rules applied. Total rules applied 1069 place count 515 transition count 804
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1070 place count 514 transition count 796
Iterating global reduction 6 with 1 rules applied. Total rules applied 1071 place count 514 transition count 796
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 6 with 181 rules applied. Total rules applied 1252 place count 422 transition count 707
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1256 place count 418 transition count 703
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 1261 place count 417 transition count 703
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 1262 place count 417 transition count 702
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1263 place count 416 transition count 702
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1263 place count 416 transition count 701
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1265 place count 415 transition count 701
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1267 place count 413 transition count 699
Iterating global reduction 8 with 2 rules applied. Total rules applied 1269 place count 413 transition count 699
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 8 with 2 rules applied. Total rules applied 1271 place count 413 transition count 697
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1272 place count 412 transition count 697
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1274 place count 411 transition count 702
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1275 place count 410 transition count 701
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1276 place count 409 transition count 700
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 10 with 6 rules applied. Total rules applied 1282 place count 405 transition count 698
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 1284 place count 403 transition count 698
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 6 Pre rules applied. Total rules applied 1284 place count 403 transition count 692
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 12 with 13 rules applied. Total rules applied 1297 place count 396 transition count 692
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 12 with 5 rules applied. Total rules applied 1302 place count 391 transition count 692
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 1302 place count 391 transition count 691
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 1304 place count 390 transition count 691
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 13 with 14 rules applied. Total rules applied 1318 place count 383 transition count 684
Discarding 4 places :
Symmetric choice reduction at 13 with 4 rule applications. Total rules 1322 place count 379 transition count 680
Iterating global reduction 13 with 4 rules applied. Total rules applied 1326 place count 379 transition count 680
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 1328 place count 377 transition count 678
Iterating global reduction 13 with 2 rules applied. Total rules applied 1330 place count 377 transition count 678
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 1332 place count 377 transition count 676
Applied a total of 1332 rules in 238 ms. Remains 377 /1066 variables (removed 689) and now considering 676/1394 (removed 718) transitions.
// Phase 1: matrix 676 rows 377 cols
[2021-05-07 13:54:56] [INFO ] Computed 63 place invariants in 6 ms
[2021-05-07 13:54:56] [INFO ] Implicit Places using invariants in 260 ms returned [1, 18, 19, 31, 48, 66, 85, 129, 140, 150, 151, 153, 170, 188, 208, 259, 260, 263, 274, 275, 276, 294, 315, 316, 317, 318]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 262 ms to find 26 implicit places.
[2021-05-07 13:54:56] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 676 rows 351 cols
[2021-05-07 13:54:56] [INFO ] Computed 37 place invariants in 4 ms
[2021-05-07 13:54:57] [INFO ] Dead Transitions using invariants and state equation in 284 ms returned []
Starting structural reductions, iteration 1 : 351/1066 places, 676/1394 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 351 transition count 634
Reduce places removed 42 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 43 rules applied. Total rules applied 85 place count 309 transition count 633
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 86 place count 308 transition count 633
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 86 place count 308 transition count 618
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 31 rules applied. Total rules applied 117 place count 292 transition count 618
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 129 place count 288 transition count 610
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 137 place count 280 transition count 610
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 140 place count 277 transition count 607
Iterating global reduction 5 with 3 rules applied. Total rules applied 143 place count 277 transition count 607
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 146 place count 277 transition count 604
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 6 with 40 rules applied. Total rules applied 186 place count 257 transition count 584
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 190 place count 255 transition count 585
Applied a total of 190 rules in 28 ms. Remains 255 /351 variables (removed 96) and now considering 585/676 (removed 91) transitions.
// Phase 1: matrix 585 rows 255 cols
[2021-05-07 13:54:57] [INFO ] Computed 32 place invariants in 4 ms
[2021-05-07 13:54:57] [INFO ] Implicit Places using invariants in 161 ms returned [88, 101, 176, 182, 187, 252]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 162 ms to find 6 implicit places.
Starting structural reductions, iteration 2 : 249/1066 places, 585/1394 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 249 transition count 584
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 248 transition count 584
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 5 place count 245 transition count 581
Iterating global reduction 2 with 3 rules applied. Total rules applied 8 place count 245 transition count 581
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 11 place count 242 transition count 578
Iterating global reduction 2 with 3 rules applied. Total rules applied 14 place count 242 transition count 578
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 241 transition count 577
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 241 transition count 577
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 20 place count 239 transition count 575
Applied a total of 20 rules in 22 ms. Remains 239 /249 variables (removed 10) and now considering 575/585 (removed 10) transitions.
// Phase 1: matrix 575 rows 239 cols
[2021-05-07 13:54:57] [INFO ] Computed 26 place invariants in 4 ms
[2021-05-07 13:54:57] [INFO ] Implicit Places using invariants in 153 ms returned []
// Phase 1: matrix 575 rows 239 cols
[2021-05-07 13:54:57] [INFO ] Computed 26 place invariants in 4 ms
[2021-05-07 13:54:57] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 239/1066 places, 575/1394 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-02b-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s94 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2532 reset in 184 ms.
Stack based approach found an accepted trace after 81226 steps with 2044 reset with depth 116 and stack size 116 in 176 ms.
FORMULA ASLink-PT-02b-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02b-07 finished in 1878 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X(G(!p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 1066 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1066/1066 places, 1394/1394 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1060 transition count 1381
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1060 transition count 1381
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 1057 transition count 1371
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 1057 transition count 1371
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 1057 transition count 1370
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 1056 transition count 1369
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 1056 transition count 1369
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 1055 transition count 1361
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 1055 transition count 1361
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 1054 transition count 1353
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 1054 transition count 1353
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 1053 transition count 1352
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 1053 transition count 1352
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 1052 transition count 1344
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 1052 transition count 1344
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 1051 transition count 1336
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 1051 transition count 1336
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 1050 transition count 1335
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 1050 transition count 1335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 1049 transition count 1327
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 1049 transition count 1327
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 1048 transition count 1319
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 1048 transition count 1319
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 1047 transition count 1318
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 1047 transition count 1318
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 1046 transition count 1310
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 1046 transition count 1310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 1045 transition count 1302
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 1045 transition count 1302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 1044 transition count 1301
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 1044 transition count 1301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 1043 transition count 1293
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 1043 transition count 1293
Applied a total of 47 rules in 456 ms. Remains 1043 /1066 variables (removed 23) and now considering 1293/1394 (removed 101) transitions.
// Phase 1: matrix 1293 rows 1043 cols
[2021-05-07 13:54:58] [INFO ] Computed 110 place invariants in 10 ms
[2021-05-07 13:54:58] [INFO ] Implicit Places using invariants in 383 ms returned []
// Phase 1: matrix 1293 rows 1043 cols
[2021-05-07 13:54:58] [INFO ] Computed 110 place invariants in 10 ms
[2021-05-07 13:55:00] [INFO ] Implicit Places using invariants and state equation in 1472 ms returned []
Implicit Place search using SMT with State Equation took 1857 ms to find 0 implicit places.
// Phase 1: matrix 1293 rows 1043 cols
[2021-05-07 13:55:00] [INFO ] Computed 110 place invariants in 10 ms
[2021-05-07 13:55:01] [INFO ] Dead Transitions using invariants and state equation in 641 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1043/1066 places, 1293/1394 transitions.
Stuttering acceptance computed with spot in 107 ms :[true, p0, (NOT p0), false, false]
Running random walk in product with property : ASLink-PT-02b-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(EQ s182 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6333 steps with 25 reset in 17 ms.
FORMULA ASLink-PT-02b-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02b-08 finished in 3095 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((p0 U (G(p2)&&p1)))||X(p3)))], workingDir=/home/mcc/execution]
Support contains 5 out of 1066 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1066/1066 places, 1394/1394 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1060 transition count 1381
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1060 transition count 1381
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 1056 transition count 1370
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 1056 transition count 1370
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 1056 transition count 1369
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 1055 transition count 1368
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 1055 transition count 1368
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 1054 transition count 1360
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 1054 transition count 1360
Applied a total of 25 rules in 142 ms. Remains 1054 /1066 variables (removed 12) and now considering 1360/1394 (removed 34) transitions.
// Phase 1: matrix 1360 rows 1054 cols
[2021-05-07 13:55:01] [INFO ] Computed 110 place invariants in 12 ms
[2021-05-07 13:55:01] [INFO ] Implicit Places using invariants in 358 ms returned []
// Phase 1: matrix 1360 rows 1054 cols
[2021-05-07 13:55:01] [INFO ] Computed 110 place invariants in 11 ms
[2021-05-07 13:55:03] [INFO ] Implicit Places using invariants and state equation in 1838 ms returned []
Implicit Place search using SMT with State Equation took 2197 ms to find 0 implicit places.
// Phase 1: matrix 1360 rows 1054 cols
[2021-05-07 13:55:03] [INFO ] Computed 110 place invariants in 14 ms
[2021-05-07 13:55:04] [INFO ] Dead Transitions using invariants and state equation in 708 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1054/1066 places, 1360/1394 transitions.
Stuttering acceptance computed with spot in 240 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3)), true, (NOT p2), (OR (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : ASLink-PT-02b-10 automaton TGBA [mat=[[{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={} source=0 dest: 1}, { cond=(OR (AND p1 p2) p0), acceptance={} source=0 dest: 2}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p3), acceptance={} source=1 dest: 4}], [{ cond=(OR (AND (NOT p1) (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p0) (NOT p3))), acceptance={} source=2 dest: 4}, { cond=(AND p1 p2 (NOT p0) (NOT p3)), acceptance={} source=2 dest: 5}, { cond=(OR (AND (NOT p1) p0 (NOT p3)) (AND (NOT p2) p0 (NOT p3))), acceptance={} source=2 dest: 6}, { cond=(OR (AND p1 p2 (NOT p3)) (AND p0 (NOT p3))), acceptance={} source=2 dest: 8}], [{ cond=(AND (NOT p2) p0 (NOT p3)), acceptance={} source=3 dest: 4}, { cond=(OR (AND (NOT p1) p2 (NOT p3)) (AND p2 p0 (NOT p3))), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={} source=6 dest: 4}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(OR (AND (NOT p1) p0) (AND (NOT p2) p0)), acceptance={0} source=6 dest: 6}, { cond=(AND p1 p2 p0), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=7 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p2) p0), acceptance={0} source=7 dest: 6}, { cond=(AND p2 p0), acceptance={} source=7 dest: 7}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={} source=8 dest: 4}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=8 dest: 5}, { cond=(OR (AND (NOT p1) p0) (AND (NOT p2) p0)), acceptance={} source=8 dest: 6}, { cond=(OR (AND p1 p2) p0), acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(AND (EQ s472 1) (EQ s814 1)), p0:(AND (EQ s472 1) (EQ s814 1)), p2:(AND (EQ s99 1) (EQ s523 1)), p3:(NEQ s428 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 904 ms.
Product exploration explored 100000 steps with 50000 reset in 911 ms.
Knowledge obtained : [(NOT p1), (NOT p0), (NOT p2), p3]
Stuttering acceptance computed with spot in 259 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3)), true, (NOT p2), (OR (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 50000 reset in 901 ms.
Product exploration explored 100000 steps with 50000 reset in 894 ms.
Applying partial POR strategy [false, true, true, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 255 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND p0 (NOT p2) (NOT p3)), true, (NOT p2), (OR (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p1) (NOT p2))]
Support contains 5 out of 1054 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1054/1054 places, 1360/1360 transitions.
Performed 178 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 178 rules applied. Total rules applied 178 place count 1054 transition count 1360
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 179 place count 1054 transition count 1359
Performed 233 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 233 Pre rules applied. Total rules applied 179 place count 1054 transition count 1887
Deduced a syphon composed of 411 places in 3 ms
Iterating global reduction 2 with 233 rules applied. Total rules applied 412 place count 1054 transition count 1887
Discarding 80 places :
Symmetric choice reduction at 2 with 80 rule applications. Total rules 492 place count 974 transition count 1777
Deduced a syphon composed of 331 places in 3 ms
Iterating global reduction 2 with 80 rules applied. Total rules applied 572 place count 974 transition count 1777
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 473 places in 2 ms
Iterating global reduction 2 with 142 rules applied. Total rules applied 714 place count 974 transition count 1778
Discarding 79 places :
Symmetric choice reduction at 2 with 79 rule applications. Total rules 793 place count 895 transition count 1695
Deduced a syphon composed of 398 places in 1 ms
Iterating global reduction 2 with 79 rules applied. Total rules applied 872 place count 895 transition count 1695
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 874 place count 893 transition count 1692
Deduced a syphon composed of 398 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 876 place count 893 transition count 1692
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 878 place count 893 transition count 1690
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 413 places in 1 ms
Iterating global reduction 3 with 15 rules applied. Total rules applied 893 place count 893 transition count 1755
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 898 place count 888 transition count 1745
Deduced a syphon composed of 408 places in 2 ms
Iterating global reduction 3 with 5 rules applied. Total rules applied 903 place count 888 transition count 1745
Performed 2(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 410 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 905 place count 888 transition count 1757
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 907 place count 886 transition count 1749
Deduced a syphon composed of 408 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 909 place count 886 transition count 1749
Deduced a syphon composed of 408 places in 2 ms
Applied a total of 909 rules in 218 ms. Remains 886 /1054 variables (removed 168) and now considering 1749/1360 (removed -389) transitions.
[2021-05-07 13:55:09] [INFO ] Redundant transitions in 27 ms returned []
// Phase 1: matrix 1749 rows 886 cols
[2021-05-07 13:55:09] [INFO ] Computed 110 place invariants in 19 ms
[2021-05-07 13:55:09] [INFO ] Dead Transitions using invariants and state equation in 788 ms returned []
Finished structural reductions, in 1 iterations. Remains : 886/1054 places, 1749/1360 transitions.
Product exploration explored 100000 steps with 50000 reset in 4157 ms.
Product exploration explored 100000 steps with 50000 reset in 4010 ms.
[2021-05-07 13:55:18] [INFO ] Flatten gal took : 46 ms
[2021-05-07 13:55:18] [INFO ] Flatten gal took : 46 ms
[2021-05-07 13:55:18] [INFO ] Time to serialize gal into /tmp/LTL12835332926248036068.gal : 5 ms
[2021-05-07 13:55:18] [INFO ] Time to serialize properties into /tmp/LTL9439419437821765094.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL12835332926248036068.gal, -t, CGAL, -LTL, /tmp/LTL9439419437821765094.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL12835332926248036068.gal -t CGAL -LTL /tmp/LTL9439419437821765094.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G(("((p513==1)&&(p888==1))")U(("((p513==1)&&(p888==1))")&&(G("((p105==1)&&(p565==1))")))))||(X("(p465!=1)"))))
Formula 0 simplified : !(G("((p513==1)&&(p888==1))" U ("((p513==1)&&(p888==1))" & G"((p105==1)&&(p565==1))")) | X"(p465!=1)")
Detected timeout of ITS tools.
[2021-05-07 13:55:33] [INFO ] Flatten gal took : 42 ms
[2021-05-07 13:55:33] [INFO ] Applying decomposition
[2021-05-07 13:55:33] [INFO ] Flatten gal took : 42 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph10897792157364947869.txt, -o, /tmp/graph10897792157364947869.bin, -w, /tmp/graph10897792157364947869.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph10897792157364947869.bin, -l, -1, -v, -w, /tmp/graph10897792157364947869.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-07 13:55:33] [INFO ] Decomposing Gal with order
[2021-05-07 13:55:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-07 13:55:33] [INFO ] Removed a total of 1134 redundant transitions.
[2021-05-07 13:55:33] [INFO ] Flatten gal took : 93 ms
[2021-05-07 13:55:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 14 ms.
[2021-05-07 13:55:33] [INFO ] Time to serialize gal into /tmp/LTL2028177529998757209.gal : 8 ms
[2021-05-07 13:55:33] [INFO ] Time to serialize properties into /tmp/LTL14463727082567775022.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL2028177529998757209.gal, -t, CGAL, -LTL, /tmp/LTL14463727082567775022.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2028177529998757209.gal -t CGAL -LTL /tmp/LTL14463727082567775022.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((G(("((i17.u177.p513==1)&&(i17.u311.p888==1))")U(("((i17.u177.p513==1)&&(i17.u311.p888==1))")&&(G("((i12.u35.p105==1)&&(i12.u195.p565==1))")))))||(X("(i8.i1.i2.u163.p465!=1)"))))
Formula 0 simplified : !(G("((i17.u177.p513==1)&&(i17.u311.p888==1))" U ("((i17.u177.p513==1)&&(i17.u311.p888==1))" & G"((i12.u35.p105==1)&&(i12.u195.p565==1))")) | X"(i8.i1.i2.u163.p465!=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15309337405831193185
[2021-05-07 13:55:48] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15309337405831193185
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15309337405831193185]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15309337405831193185] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15309337405831193185] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property ASLink-PT-02b-10 finished in 48548 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0) U (F(p2)||p1)))], workingDir=/home/mcc/execution]
Support contains 5 out of 1066 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1066/1066 places, 1394/1394 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 187 transitions
Trivial Post-agglo rules discarded 187 transitions
Performed 187 trivial Post agglomeration. Transition count delta: 187
Iterating post reduction 0 with 187 rules applied. Total rules applied 187 place count 1065 transition count 1206
Reduce places removed 187 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 189 rules applied. Total rules applied 376 place count 878 transition count 1204
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 380 place count 877 transition count 1201
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 382 place count 875 transition count 1201
Performed 282 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 282 Pre rules applied. Total rules applied 382 place count 875 transition count 919
Deduced a syphon composed of 282 places in 1 ms
Ensure Unique test removed 24 places
Reduce places removed 306 places and 0 transitions.
Iterating global reduction 4 with 588 rules applied. Total rules applied 970 place count 569 transition count 919
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 4 with 18 rules applied. Total rules applied 988 place count 567 transition count 903
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 1004 place count 551 transition count 903
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 9 Pre rules applied. Total rules applied 1004 place count 551 transition count 894
Deduced a syphon composed of 9 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 27 rules applied. Total rules applied 1031 place count 533 transition count 894
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 8 Pre rules applied. Total rules applied 1031 place count 533 transition count 886
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 1047 place count 525 transition count 886
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1049 place count 523 transition count 877
Iterating global reduction 6 with 2 rules applied. Total rules applied 1051 place count 523 transition count 877
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1051 place count 523 transition count 876
Deduced a syphon composed of 1 places in 17 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1053 place count 522 transition count 876
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1054 place count 521 transition count 868
Iterating global reduction 6 with 1 rules applied. Total rules applied 1055 place count 521 transition count 868
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1056 place count 520 transition count 860
Iterating global reduction 6 with 1 rules applied. Total rules applied 1057 place count 520 transition count 860
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1058 place count 519 transition count 852
Iterating global reduction 6 with 1 rules applied. Total rules applied 1059 place count 519 transition count 852
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1060 place count 518 transition count 844
Iterating global reduction 6 with 1 rules applied. Total rules applied 1061 place count 518 transition count 844
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1062 place count 517 transition count 836
Iterating global reduction 6 with 1 rules applied. Total rules applied 1063 place count 517 transition count 836
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1064 place count 516 transition count 828
Iterating global reduction 6 with 1 rules applied. Total rules applied 1065 place count 516 transition count 828
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1066 place count 515 transition count 820
Iterating global reduction 6 with 1 rules applied. Total rules applied 1067 place count 515 transition count 820
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1068 place count 514 transition count 812
Iterating global reduction 6 with 1 rules applied. Total rules applied 1069 place count 514 transition count 812
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1070 place count 513 transition count 804
Iterating global reduction 6 with 1 rules applied. Total rules applied 1071 place count 513 transition count 804
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1072 place count 512 transition count 796
Iterating global reduction 6 with 1 rules applied. Total rules applied 1073 place count 512 transition count 796
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 6 with 174 rules applied. Total rules applied 1247 place count 424 transition count 710
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1251 place count 420 transition count 706
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 1256 place count 419 transition count 706
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 1257 place count 419 transition count 705
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1258 place count 418 transition count 705
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1258 place count 418 transition count 704
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1260 place count 417 transition count 704
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1262 place count 415 transition count 702
Iterating global reduction 8 with 2 rules applied. Total rules applied 1264 place count 415 transition count 702
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 8 with 2 rules applied. Total rules applied 1266 place count 415 transition count 700
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1267 place count 414 transition count 700
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1269 place count 413 transition count 705
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1270 place count 412 transition count 704
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1271 place count 411 transition count 703
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 10 with 6 rules applied. Total rules applied 1277 place count 407 transition count 701
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 1279 place count 405 transition count 701
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 6 Pre rules applied. Total rules applied 1279 place count 405 transition count 695
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 12 with 13 rules applied. Total rules applied 1292 place count 398 transition count 695
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 12 with 5 rules applied. Total rules applied 1297 place count 393 transition count 695
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 1297 place count 393 transition count 694
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 1299 place count 392 transition count 694
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 13 with 14 rules applied. Total rules applied 1313 place count 385 transition count 687
Discarding 3 places :
Symmetric choice reduction at 13 with 3 rule applications. Total rules 1316 place count 382 transition count 684
Iterating global reduction 13 with 3 rules applied. Total rules applied 1319 place count 382 transition count 684
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 1320 place count 381 transition count 683
Iterating global reduction 13 with 1 rules applied. Total rules applied 1321 place count 381 transition count 683
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 1322 place count 381 transition count 682
Applied a total of 1322 rules in 319 ms. Remains 381 /1066 variables (removed 685) and now considering 682/1394 (removed 712) transitions.
// Phase 1: matrix 682 rows 381 cols
[2021-05-07 13:55:50] [INFO ] Computed 62 place invariants in 6 ms
[2021-05-07 13:55:50] [INFO ] Implicit Places using invariants in 274 ms returned [1, 18, 19, 32, 49, 67, 86, 138, 149, 150, 152, 169, 187, 263, 264, 267, 278, 279, 280, 298, 319, 320, 321, 322]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 277 ms to find 24 implicit places.
[2021-05-07 13:55:50] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 682 rows 357 cols
[2021-05-07 13:55:50] [INFO ] Computed 38 place invariants in 4 ms
[2021-05-07 13:55:50] [INFO ] Dead Transitions using invariants and state equation in 280 ms returned []
Starting structural reductions, iteration 1 : 357/1066 places, 682/1394 transitions.
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 357 transition count 639
Reduce places removed 43 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 44 rules applied. Total rules applied 87 place count 314 transition count 638
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 88 place count 313 transition count 638
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 88 place count 313 transition count 623
Deduced a syphon composed of 15 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 31 rules applied. Total rules applied 119 place count 297 transition count 623
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 131 place count 293 transition count 615
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 139 place count 285 transition count 615
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 142 place count 282 transition count 612
Iterating global reduction 5 with 3 rules applied. Total rules applied 145 place count 282 transition count 612
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 148 place count 282 transition count 609
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 186 place count 263 transition count 590
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 190 place count 261 transition count 591
Applied a total of 190 rules in 28 ms. Remains 261 /357 variables (removed 96) and now considering 591/682 (removed 91) transitions.
// Phase 1: matrix 591 rows 261 cols
[2021-05-07 13:55:50] [INFO ] Computed 33 place invariants in 8 ms
[2021-05-07 13:55:50] [INFO ] Implicit Places using invariants in 166 ms returned [89, 95, 100, 181, 187, 192, 258]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 177 ms to find 7 implicit places.
Starting structural reductions, iteration 2 : 254/1066 places, 591/1394 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 254 transition count 590
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 253 transition count 590
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 5 place count 250 transition count 587
Iterating global reduction 2 with 3 rules applied. Total rules applied 8 place count 250 transition count 587
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 11 place count 247 transition count 584
Iterating global reduction 2 with 3 rules applied. Total rules applied 14 place count 247 transition count 584
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 245 transition count 582
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 245 transition count 582
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 22 place count 243 transition count 580
Applied a total of 22 rules in 22 ms. Remains 243 /254 variables (removed 11) and now considering 580/591 (removed 11) transitions.
// Phase 1: matrix 580 rows 243 cols
[2021-05-07 13:55:50] [INFO ] Computed 26 place invariants in 4 ms
[2021-05-07 13:55:50] [INFO ] Implicit Places using invariants in 127 ms returned []
// Phase 1: matrix 580 rows 243 cols
[2021-05-07 13:55:50] [INFO ] Computed 26 place invariants in 3 ms
[2021-05-07 13:55:51] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 243/1066 places, 580/1394 transitions.
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ASLink-PT-02b-11 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s154 1) (EQ s153 1)), p2:(EQ s154 1), p0:(OR (EQ s135 1) (AND (EQ s41 1) (EQ s93 1)))], nbAcceptance=0, 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 101 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-02b-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02b-11 finished in 1679 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||X((((p1&&F(p2)) U ((((p1&&F(p2))||G(p1))&&X(G(!p0)))||G(((p1&&F(p2))||G(p1))))) U (p0&&((p1&&F(p2)) U ((((p1&&F(p2))||G(p1))&&X(G(!p0)))||G(((p1&&F(p2))||G(p1)))))))))))], workingDir=/home/mcc/execution]
Support contains 1 out of 1066 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1066/1066 places, 1394/1394 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1060 transition count 1381
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1060 transition count 1381
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 1057 transition count 1371
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 1057 transition count 1371
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1056 transition count 1370
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1056 transition count 1370
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1055 transition count 1362
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1055 transition count 1362
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1054 transition count 1354
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1054 transition count 1354
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1053 transition count 1353
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1053 transition count 1353
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1052 transition count 1345
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1052 transition count 1345
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 1051 transition count 1337
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 1051 transition count 1337
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 1050 transition count 1336
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 1050 transition count 1336
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 1049 transition count 1328
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 1049 transition count 1328
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 1048 transition count 1320
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 1048 transition count 1320
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 1047 transition count 1319
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 1047 transition count 1319
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 1046 transition count 1311
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 1046 transition count 1311
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 1045 transition count 1303
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 1045 transition count 1303
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 1044 transition count 1302
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 1044 transition count 1302
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 1043 transition count 1294
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 1043 transition count 1294
Applied a total of 46 rules in 475 ms. Remains 1043 /1066 variables (removed 23) and now considering 1294/1394 (removed 100) transitions.
// Phase 1: matrix 1294 rows 1043 cols
[2021-05-07 13:55:51] [INFO ] Computed 110 place invariants in 11 ms
[2021-05-07 13:55:52] [INFO ] Implicit Places using invariants in 344 ms returned []
// Phase 1: matrix 1294 rows 1043 cols
[2021-05-07 13:55:52] [INFO ] Computed 110 place invariants in 11 ms
[2021-05-07 13:55:54] [INFO ] Implicit Places using invariants and state equation in 1929 ms returned []
Implicit Place search using SMT with State Equation took 2274 ms to find 0 implicit places.
// Phase 1: matrix 1294 rows 1043 cols
[2021-05-07 13:55:54] [INFO ] Computed 110 place invariants in 32 ms
[2021-05-07 13:55:54] [INFO ] Dead Transitions using invariants and state equation in 616 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1043/1066 places, 1294/1394 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-02b-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s1016 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null][false]]
Stuttering criterion allowed to conclude after 257 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-02b-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02b-12 finished in 3417 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 1066 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1066/1066 places, 1394/1394 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 188 transitions
Trivial Post-agglo rules discarded 188 transitions
Performed 188 trivial Post agglomeration. Transition count delta: 188
Iterating post reduction 0 with 188 rules applied. Total rules applied 188 place count 1065 transition count 1205
Reduce places removed 188 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 190 rules applied. Total rules applied 378 place count 877 transition count 1203
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 382 place count 876 transition count 1200
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 384 place count 874 transition count 1200
Performed 282 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 282 Pre rules applied. Total rules applied 384 place count 874 transition count 918
Deduced a syphon composed of 282 places in 1 ms
Ensure Unique test removed 24 places
Reduce places removed 306 places and 0 transitions.
Iterating global reduction 4 with 588 rules applied. Total rules applied 972 place count 568 transition count 918
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 4 with 18 rules applied. Total rules applied 990 place count 566 transition count 902
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 1006 place count 550 transition count 902
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 9 Pre rules applied. Total rules applied 1006 place count 550 transition count 893
Deduced a syphon composed of 9 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 27 rules applied. Total rules applied 1033 place count 532 transition count 893
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 8 Pre rules applied. Total rules applied 1033 place count 532 transition count 885
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 1049 place count 524 transition count 885
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1052 place count 521 transition count 875
Iterating global reduction 6 with 3 rules applied. Total rules applied 1055 place count 521 transition count 875
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1055 place count 521 transition count 874
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1057 place count 520 transition count 874
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1058 place count 519 transition count 866
Iterating global reduction 6 with 1 rules applied. Total rules applied 1059 place count 519 transition count 866
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1060 place count 518 transition count 858
Iterating global reduction 6 with 1 rules applied. Total rules applied 1061 place count 518 transition count 858
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1062 place count 517 transition count 850
Iterating global reduction 6 with 1 rules applied. Total rules applied 1063 place count 517 transition count 850
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1064 place count 516 transition count 842
Iterating global reduction 6 with 1 rules applied. Total rules applied 1065 place count 516 transition count 842
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1066 place count 515 transition count 834
Iterating global reduction 6 with 1 rules applied. Total rules applied 1067 place count 515 transition count 834
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1068 place count 514 transition count 826
Iterating global reduction 6 with 1 rules applied. Total rules applied 1069 place count 514 transition count 826
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1070 place count 513 transition count 818
Iterating global reduction 6 with 1 rules applied. Total rules applied 1071 place count 513 transition count 818
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1072 place count 512 transition count 810
Iterating global reduction 6 with 1 rules applied. Total rules applied 1073 place count 512 transition count 810
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1074 place count 511 transition count 802
Iterating global reduction 6 with 1 rules applied. Total rules applied 1075 place count 511 transition count 802
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1076 place count 510 transition count 794
Iterating global reduction 6 with 1 rules applied. Total rules applied 1077 place count 510 transition count 794
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 6 with 176 rules applied. Total rules applied 1253 place count 421 transition count 707
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1257 place count 417 transition count 703
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 1262 place count 416 transition count 703
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 1263 place count 416 transition count 702
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1264 place count 415 transition count 702
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1264 place count 415 transition count 701
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1266 place count 414 transition count 701
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1268 place count 412 transition count 699
Iterating global reduction 8 with 2 rules applied. Total rules applied 1270 place count 412 transition count 699
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 8 with 2 rules applied. Total rules applied 1272 place count 412 transition count 697
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1273 place count 411 transition count 697
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1275 place count 410 transition count 702
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1276 place count 409 transition count 701
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1277 place count 408 transition count 700
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 10 with 6 rules applied. Total rules applied 1283 place count 404 transition count 698
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 1285 place count 402 transition count 698
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 6 Pre rules applied. Total rules applied 1285 place count 402 transition count 692
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 12 with 13 rules applied. Total rules applied 1298 place count 395 transition count 692
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 12 with 5 rules applied. Total rules applied 1303 place count 390 transition count 692
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 1303 place count 390 transition count 691
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 1305 place count 389 transition count 691
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 13 with 14 rules applied. Total rules applied 1319 place count 382 transition count 684
Discarding 4 places :
Symmetric choice reduction at 13 with 4 rule applications. Total rules 1323 place count 378 transition count 680
Iterating global reduction 13 with 4 rules applied. Total rules applied 1327 place count 378 transition count 680
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 1329 place count 376 transition count 678
Iterating global reduction 13 with 2 rules applied. Total rules applied 1331 place count 376 transition count 678
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 1333 place count 376 transition count 676
Applied a total of 1333 rules in 226 ms. Remains 376 /1066 variables (removed 690) and now considering 676/1394 (removed 718) transitions.
// Phase 1: matrix 676 rows 376 cols
[2021-05-07 13:55:55] [INFO ] Computed 62 place invariants in 6 ms
[2021-05-07 13:55:55] [INFO ] Implicit Places using invariants in 497 ms returned [1, 18, 19, 31, 48, 66, 85, 137, 147, 148, 150, 167, 186, 206, 258, 259, 262, 273, 274, 275, 293, 314, 315, 316, 317]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 498 ms to find 25 implicit places.
[2021-05-07 13:55:55] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 676 rows 351 cols
[2021-05-07 13:55:55] [INFO ] Computed 37 place invariants in 5 ms
[2021-05-07 13:55:55] [INFO ] Dead Transitions using invariants and state equation in 290 ms returned []
Starting structural reductions, iteration 1 : 351/1066 places, 676/1394 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 351 transition count 637
Reduce places removed 39 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 43 rules applied. Total rules applied 82 place count 312 transition count 633
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 86 place count 308 transition count 633
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 86 place count 308 transition count 618
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 31 rules applied. Total rules applied 117 place count 292 transition count 618
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 129 place count 288 transition count 610
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 137 place count 280 transition count 610
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 140 place count 277 transition count 607
Iterating global reduction 5 with 3 rules applied. Total rules applied 143 place count 277 transition count 607
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 146 place count 277 transition count 604
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 6 with 40 rules applied. Total rules applied 186 place count 257 transition count 584
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 190 place count 255 transition count 585
Applied a total of 190 rules in 27 ms. Remains 255 /351 variables (removed 96) and now considering 585/676 (removed 91) transitions.
// Phase 1: matrix 585 rows 255 cols
[2021-05-07 13:55:55] [INFO ] Computed 32 place invariants in 4 ms
[2021-05-07 13:55:56] [INFO ] Implicit Places using invariants in 136 ms returned [88, 94, 99, 176, 182, 187, 252]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 137 ms to find 7 implicit places.
Starting structural reductions, iteration 2 : 248/1066 places, 585/1394 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 248 transition count 584
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 247 transition count 584
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 6 place count 243 transition count 580
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 243 transition count 580
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 14 place count 239 transition count 576
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 239 transition count 576
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 20 place count 237 transition count 574
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 237 transition count 574
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 26 place count 235 transition count 572
Applied a total of 26 rules in 27 ms. Remains 235 /248 variables (removed 13) and now considering 572/585 (removed 13) transitions.
// Phase 1: matrix 572 rows 235 cols
[2021-05-07 13:55:56] [INFO ] Computed 25 place invariants in 4 ms
[2021-05-07 13:55:56] [INFO ] Implicit Places using invariants in 126 ms returned []
// Phase 1: matrix 572 rows 235 cols
[2021-05-07 13:55:56] [INFO ] Computed 25 place invariants in 4 ms
[2021-05-07 13:55:56] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 235/1066 places, 572/1394 transitions.
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0)]
Running random walk in product with property : ASLink-PT-02b-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (NEQ s115 1) (NEQ s163 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 343 steps with 10 reset in 1 ms.
FORMULA ASLink-PT-02b-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02b-13 finished in 1810 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(G(p0))&&F(((F(p1)&&X(p2))||G(F(p1))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 1066 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1066/1066 places, 1394/1394 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1059 transition count 1380
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1059 transition count 1380
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 1055 transition count 1369
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 1055 transition count 1369
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 1055 transition count 1368
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 1054 transition count 1367
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 1054 transition count 1367
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 1053 transition count 1359
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 1053 transition count 1359
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 1052 transition count 1351
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 1052 transition count 1351
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 1051 transition count 1350
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 1051 transition count 1350
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 1050 transition count 1342
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 1050 transition count 1342
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 1049 transition count 1334
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 1049 transition count 1334
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 1048 transition count 1333
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 1048 transition count 1333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 1047 transition count 1325
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 1047 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 1046 transition count 1317
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 1046 transition count 1317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 1045 transition count 1316
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 1045 transition count 1316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 1044 transition count 1308
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 1044 transition count 1308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 1043 transition count 1300
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 1043 transition count 1300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 1042 transition count 1299
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 1042 transition count 1299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 1041 transition count 1291
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 1041 transition count 1291
Applied a total of 51 rules in 451 ms. Remains 1041 /1066 variables (removed 25) and now considering 1291/1394 (removed 103) transitions.
// Phase 1: matrix 1291 rows 1041 cols
[2021-05-07 13:55:57] [INFO ] Computed 110 place invariants in 11 ms
[2021-05-07 13:55:57] [INFO ] Implicit Places using invariants in 399 ms returned []
// Phase 1: matrix 1291 rows 1041 cols
[2021-05-07 13:55:57] [INFO ] Computed 110 place invariants in 11 ms
[2021-05-07 13:55:59] [INFO ] Implicit Places using invariants and state equation in 2234 ms returned []
Implicit Place search using SMT with State Equation took 2634 ms to find 0 implicit places.
// Phase 1: matrix 1291 rows 1041 cols
[2021-05-07 13:55:59] [INFO ] Computed 110 place invariants in 10 ms
[2021-05-07 13:56:00] [INFO ] Dead Transitions using invariants and state equation in 620 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1041/1066 places, 1291/1394 transitions.
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : ASLink-PT-02b-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (NEQ s107 1) (NEQ s513 1)), p0:(OR (NEQ s33 1) (NEQ s169 1)), p2:(OR (NEQ s107 1) (NEQ s513 1) (NEQ s1003 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 875 reset in 228 ms.
Product exploration explored 100000 steps with 874 reset in 250 ms.
Knowledge obtained : [p1, p0, p2]
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p2) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 801 reset in 207 ms.
Product exploration explored 100000 steps with 841 reset in 231 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p2) (NOT p1)), (NOT p1)]
Support contains 5 out of 1041 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1041/1041 places, 1291/1291 transitions.
Performed 178 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 178 rules applied. Total rules applied 178 place count 1041 transition count 1291
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 179 place count 1041 transition count 1290
Performed 231 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 231 Pre rules applied. Total rules applied 179 place count 1041 transition count 1797
Deduced a syphon composed of 409 places in 3 ms
Iterating global reduction 2 with 231 rules applied. Total rules applied 410 place count 1041 transition count 1797
Discarding 80 places :
Symmetric choice reduction at 2 with 80 rule applications. Total rules 490 place count 961 transition count 1687
Deduced a syphon composed of 329 places in 2 ms
Iterating global reduction 2 with 80 rules applied. Total rules applied 570 place count 961 transition count 1687
Performed 141 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 470 places in 1 ms
Iterating global reduction 2 with 141 rules applied. Total rules applied 711 place count 961 transition count 1688
Discarding 79 places :
Symmetric choice reduction at 2 with 79 rule applications. Total rules 790 place count 882 transition count 1605
Deduced a syphon composed of 395 places in 1 ms
Iterating global reduction 2 with 79 rules applied. Total rules applied 869 place count 882 transition count 1605
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 871 place count 880 transition count 1602
Deduced a syphon composed of 395 places in 2 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 873 place count 880 transition count 1602
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 875 place count 880 transition count 1600
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 410 places in 2 ms
Iterating global reduction 3 with 15 rules applied. Total rules applied 890 place count 880 transition count 1665
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 895 place count 875 transition count 1655
Deduced a syphon composed of 405 places in 2 ms
Iterating global reduction 3 with 5 rules applied. Total rules applied 900 place count 875 transition count 1655
Performed 2(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 407 places in 2 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 902 place count 875 transition count 1667
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 904 place count 873 transition count 1659
Deduced a syphon composed of 405 places in 2 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 906 place count 873 transition count 1659
Deduced a syphon composed of 405 places in 1 ms
Applied a total of 906 rules in 204 ms. Remains 873 /1041 variables (removed 168) and now considering 1659/1291 (removed -368) transitions.
[2021-05-07 13:56:02] [INFO ] Redundant transitions in 24 ms returned []
// Phase 1: matrix 1659 rows 873 cols
[2021-05-07 13:56:02] [INFO ] Computed 110 place invariants in 18 ms
[2021-05-07 13:56:02] [INFO ] Dead Transitions using invariants and state equation in 789 ms returned []
Finished structural reductions, in 1 iterations. Remains : 873/1041 places, 1659/1291 transitions.
Product exploration explored 100000 steps with 2920 reset in 539 ms.
Product exploration explored 100000 steps with 3048 reset in 540 ms.
[2021-05-07 13:56:04] [INFO ] Flatten gal took : 40 ms
[2021-05-07 13:56:04] [INFO ] Flatten gal took : 40 ms
[2021-05-07 13:56:04] [INFO ] Time to serialize gal into /tmp/LTL9996742565686725480.gal : 4 ms
[2021-05-07 13:56:04] [INFO ] Time to serialize properties into /tmp/LTL12466924549383204744.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL9996742565686725480.gal, -t, CGAL, -LTL, /tmp/LTL12466924549383204744.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9996742565686725480.gal -t CGAL -LTL /tmp/LTL12466924549383204744.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F(G("((p33!=1)||(p176!=1))")))&&(F(((F("((p113!=1)||(p556!=1))"))&&(X("(((p113!=1)||(p556!=1))||(p1196!=1))")))||(G(F("((p113!=1)||(p556!=1))")))))))
Formula 0 simplified : !(FG"((p33!=1)||(p176!=1))" & F((F"((p113!=1)||(p556!=1))" & X"(((p113!=1)||(p556!=1))||(p1196!=1))") | GF"((p113!=1)||(p556!=1))"))
Detected timeout of ITS tools.
[2021-05-07 13:56:19] [INFO ] Flatten gal took : 41 ms
[2021-05-07 13:56:19] [INFO ] Applying decomposition
[2021-05-07 13:56:19] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph9026393281399684893.txt, -o, /tmp/graph9026393281399684893.bin, -w, /tmp/graph9026393281399684893.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph9026393281399684893.bin, -l, -1, -v, -w, /tmp/graph9026393281399684893.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-07 13:56:19] [INFO ] Decomposing Gal with order
[2021-05-07 13:56:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-07 13:56:19] [INFO ] Removed a total of 1014 redundant transitions.
[2021-05-07 13:56:19] [INFO ] Flatten gal took : 65 ms
[2021-05-07 13:56:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 14 ms.
[2021-05-07 13:56:19] [INFO ] Time to serialize gal into /tmp/LTL7117489696067612420.gal : 10 ms
[2021-05-07 13:56:19] [INFO ] Time to serialize properties into /tmp/LTL13343897275466640310.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL7117489696067612420.gal, -t, CGAL, -LTL, /tmp/LTL13343897275466640310.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7117489696067612420.gal -t CGAL -LTL /tmp/LTL13343897275466640310.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((F(G("((i1.u11.p33!=1)||(i1.u57.p176!=1))")))&&(F(((F("((i3.u36.p113!=1)||(i3.u192.p556!=1))"))&&(X("(((i3.u36.p113!=1)||(i3.u192.p556!=1))||(i18.u357.p1196!=1))")))||(G(F("((i3.u36.p113!=1)||(i3.u192.p556!=1))")))))))
Formula 0 simplified : !(FG"((i1.u11.p33!=1)||(i1.u57.p176!=1))" & F((F"((i3.u36.p113!=1)||(i3.u192.p556!=1))" & X"(((i3.u36.p113!=1)||(i3.u192.p556!=1))||(i18.u357.p1196!=1))") | GF"((i3.u36.p113!=1)||(i3.u192.p556!=1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16618518550656073904
[2021-05-07 13:56:34] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16618518550656073904
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin16618518550656073904]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin16618518550656073904] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin16618518550656073904] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property ASLink-PT-02b-14 finished in 38839 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U (G((G(p2)||p1))||(G((p3 U !p2))&&(G(p2)||p4)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 1066 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1066/1066 places, 1394/1394 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 186 transitions
Trivial Post-agglo rules discarded 186 transitions
Performed 186 trivial Post agglomeration. Transition count delta: 186
Iterating post reduction 0 with 186 rules applied. Total rules applied 186 place count 1065 transition count 1207
Reduce places removed 186 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 188 rules applied. Total rules applied 374 place count 879 transition count 1205
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 378 place count 878 transition count 1202
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 380 place count 876 transition count 1202
Performed 281 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 281 Pre rules applied. Total rules applied 380 place count 876 transition count 921
Deduced a syphon composed of 281 places in 1 ms
Ensure Unique test removed 24 places
Reduce places removed 305 places and 0 transitions.
Iterating global reduction 4 with 586 rules applied. Total rules applied 966 place count 571 transition count 921
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 4 with 20 rules applied. Total rules applied 986 place count 568 transition count 904
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 1003 place count 551 transition count 904
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 9 Pre rules applied. Total rules applied 1003 place count 551 transition count 895
Deduced a syphon composed of 9 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 1029 place count 534 transition count 895
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 7 Pre rules applied. Total rules applied 1029 place count 534 transition count 888
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 1043 place count 527 transition count 888
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1045 place count 525 transition count 886
Iterating global reduction 6 with 2 rules applied. Total rules applied 1047 place count 525 transition count 886
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1047 place count 525 transition count 885
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1049 place count 524 transition count 885
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 6 with 176 rules applied. Total rules applied 1225 place count 435 transition count 798
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1229 place count 431 transition count 794
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 1234 place count 430 transition count 794
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 1235 place count 430 transition count 793
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1236 place count 429 transition count 793
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1236 place count 429 transition count 792
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1238 place count 428 transition count 792
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1240 place count 426 transition count 790
Iterating global reduction 8 with 2 rules applied. Total rules applied 1242 place count 426 transition count 790
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 8 with 2 rules applied. Total rules applied 1244 place count 426 transition count 788
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1245 place count 425 transition count 788
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1247 place count 424 transition count 793
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1248 place count 423 transition count 792
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1249 place count 422 transition count 791
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 10 with 6 rules applied. Total rules applied 1255 place count 418 transition count 789
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 1257 place count 416 transition count 789
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 6 Pre rules applied. Total rules applied 1257 place count 416 transition count 783
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 12 with 13 rules applied. Total rules applied 1270 place count 409 transition count 783
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 12 with 5 rules applied. Total rules applied 1275 place count 404 transition count 783
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 1275 place count 404 transition count 782
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 1277 place count 403 transition count 782
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 13 with 14 rules applied. Total rules applied 1291 place count 396 transition count 775
Discarding 4 places :
Symmetric choice reduction at 13 with 4 rule applications. Total rules 1295 place count 392 transition count 771
Iterating global reduction 13 with 4 rules applied. Total rules applied 1299 place count 392 transition count 771
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 1301 place count 390 transition count 769
Iterating global reduction 13 with 2 rules applied. Total rules applied 1303 place count 390 transition count 769
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 1305 place count 390 transition count 767
Applied a total of 1305 rules in 151 ms. Remains 390 /1066 variables (removed 676) and now considering 767/1394 (removed 627) transitions.
// Phase 1: matrix 767 rows 390 cols
[2021-05-07 13:56:35] [INFO ] Computed 62 place invariants in 6 ms
[2021-05-07 13:56:35] [INFO ] Implicit Places using invariants in 250 ms returned [1, 18, 19, 31, 49, 67, 86, 140, 150, 151, 153, 171, 189, 210, 261, 262, 265, 276, 277, 278, 307, 328, 329, 330, 331]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 251 ms to find 25 implicit places.
[2021-05-07 13:56:35] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 767 rows 365 cols
[2021-05-07 13:56:35] [INFO ] Computed 37 place invariants in 5 ms
[2021-05-07 13:56:36] [INFO ] Dead Transitions using invariants and state equation in 317 ms returned []
Starting structural reductions, iteration 1 : 365/1066 places, 767/1394 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 365 transition count 725
Reduce places removed 42 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 43 rules applied. Total rules applied 85 place count 323 transition count 724
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 86 place count 322 transition count 724
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 86 place count 322 transition count 709
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 31 rules applied. Total rules applied 117 place count 306 transition count 709
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 129 place count 302 transition count 701
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 137 place count 294 transition count 701
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 140 place count 291 transition count 698
Iterating global reduction 5 with 3 rules applied. Total rules applied 143 place count 291 transition count 698
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 146 place count 291 transition count 695
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 6 with 40 rules applied. Total rules applied 186 place count 271 transition count 675
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 190 place count 269 transition count 676
Applied a total of 190 rules in 35 ms. Remains 269 /365 variables (removed 96) and now considering 676/767 (removed 91) transitions.
// Phase 1: matrix 676 rows 269 cols
[2021-05-07 13:56:36] [INFO ] Computed 32 place invariants in 5 ms
[2021-05-07 13:56:36] [INFO ] Implicit Places using invariants in 152 ms returned [89, 95, 179, 185, 190, 266]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 153 ms to find 6 implicit places.
Starting structural reductions, iteration 2 : 263/1066 places, 676/1394 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 263 transition count 675
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 262 transition count 675
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 5 place count 259 transition count 672
Iterating global reduction 2 with 3 rules applied. Total rules applied 8 place count 259 transition count 672
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 11 place count 256 transition count 669
Iterating global reduction 2 with 3 rules applied. Total rules applied 14 place count 256 transition count 669
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 254 transition count 667
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 254 transition count 667
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 22 place count 252 transition count 665
Applied a total of 22 rules in 29 ms. Remains 252 /263 variables (removed 11) and now considering 665/676 (removed 11) transitions.
// Phase 1: matrix 665 rows 252 cols
[2021-05-07 13:56:36] [INFO ] Computed 26 place invariants in 5 ms
[2021-05-07 13:56:36] [INFO ] Implicit Places using invariants in 142 ms returned []
// Phase 1: matrix 665 rows 252 cols
[2021-05-07 13:56:36] [INFO ] Computed 26 place invariants in 5 ms
[2021-05-07 13:56:37] [INFO ] Implicit Places using invariants and state equation in 465 ms returned []
Implicit Place search using SMT with State Equation took 608 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 252/1066 places, 665/1394 transitions.
Stuttering acceptance computed with spot in 502 ms :[(AND (NOT p1) (NOT p2) (NOT p4)), true, (NOT p2), (AND (NOT p2) (NOT p1)), p2, false, false, false, false, (AND (NOT p1) (NOT p2) (NOT p4)), false, false, false, false, p2]
Running random walk in product with property : ASLink-PT-02b-15 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p2) (NOT p4) p0), acceptance={0, 1, 2} source=0 dest: 0}, { cond=(OR (AND p1 (NOT p2) (NOT p4) p0) (AND p2 (NOT p3) p0)), acceptance={0, 2} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p4) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p1) p2 (NOT p3) (NOT p0)) (AND (NOT p1) p2 (NOT p4) (NOT p0))), acceptance={} source=0 dest: 2}, { cond=(OR (AND p1 p2 (NOT p3) (NOT p0)) (AND p1 (NOT p4) (NOT p0))), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p4 (NOT p0)), acceptance={} source=0 dest: 4}, { cond=(AND p2 p3 p0), acceptance={0, 2} source=0 dest: 5}, { cond=(AND (NOT p1) (NOT p2) p4 p0), acceptance={0, 1} source=0 dest: 6}, { cond=(OR (AND p1 (NOT p2) p4 p0) (AND p2 p3 p0)), acceptance={0} source=0 dest: 6}, { cond=(AND (NOT p1) p2 p3 p4 p0), acceptance={1, 2} source=0 dest: 7}, { cond=(AND (NOT p1) p2 p3 p4 p0), acceptance={1} source=0 dest: 8}, { cond=(OR (AND (NOT p1) p2 (NOT p3) p0) (AND (NOT p1) p2 (NOT p4) p0)), acceptance={1, 2} source=0 dest: 9}, { cond=(AND p1 p2 p3 (NOT p4) p0), acceptance={2} source=0 dest: 9}, { cond=(OR (AND p1 (NOT p2) p4 (NOT p0)) (AND p1 p3 p4 (NOT p0))), acceptance={} source=0 dest: 11}, { cond=(AND (NOT p1) p2 p3 p4 (NOT p0)), acceptance={} source=0 dest: 13}], [{ cond=true, acceptance={0, 1, 2} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=4 dest: 1}, { cond=(OR (NOT p2) p3), acceptance={} source=4 dest: 4}, { cond=(AND p2 p3), acceptance={} source=4 dest: 14}], [{ cond=(AND p2 (NOT p3) p0), acceptance={0, 2} source=5 dest: 0}, { cond=(AND (NOT p1) p2 (NOT p3) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND p1 p2 (NOT p3) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND p2 p3 p0), acceptance={0, 2} source=5 dest: 5}, { cond=(AND (NOT p1) p2 p3 p0), acceptance={1, 2} source=5 dest: 7}, { cond=(AND (NOT p1) p2 (NOT p3) p0), acceptance={1, 2} source=5 dest: 9}, { cond=(AND p1 p2 p3 (NOT p0)), acceptance={} source=5 dest: 10}, { cond=(AND (NOT p1) p2 p3 (NOT p0)), acceptance={} source=5 dest: 12}], [{ cond=(AND p2 (NOT p3) p0), acceptance={0, 2} source=6 dest: 0}, { cond=(AND (NOT p1) p2 (NOT p3) (NOT p0)), acceptance={} source=6 dest: 2}, { cond=(AND p1 p2 (NOT p3) (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND p2 p3 p0), acceptance={0, 2} source=6 dest: 5}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=6 dest: 6}, { cond=(OR (AND p1 (NOT p2) p0) (AND p2 p3 p0)), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p1) p2 p3 p0), acceptance={1, 2} source=6 dest: 7}, { cond=(AND (NOT p1) p2 p3 p0), acceptance={1} source=6 dest: 8}, { cond=(AND (NOT p1) p2 (NOT p3) p0), acceptance={1, 2} source=6 dest: 9}, { cond=(OR (AND p1 (NOT p2) (NOT p0)) (AND p1 p3 (NOT p0))), acceptance={} source=6 dest: 11}, { cond=(AND (NOT p1) p2 p3 (NOT p0)), acceptance={} source=6 dest: 13}], [{ cond=(AND (NOT p1) p2 (NOT p3) (NOT p0)), acceptance={} source=7 dest: 2}, { cond=(AND p1 p2 (NOT p3) (NOT p0)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p1) p2 p3 p0), acceptance={1, 2} source=7 dest: 7}, { cond=(AND p1 p2 p3 p0), acceptance={2} source=7 dest: 7}, { cond=(AND (NOT p1) p2 (NOT p3) p0), acceptance={1, 2} source=7 dest: 9}, { cond=(AND p1 p2 (NOT p3) p0), acceptance={2} source=7 dest: 9}, { cond=(AND p1 p2 p3 (NOT p0)), acceptance={} source=7 dest: 10}, { cond=(AND (NOT p1) p2 p3 (NOT p0)), acceptance={} source=7 dest: 12}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=8 dest: 6}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=8 dest: 6}, { cond=(AND (NOT p1) p2 p3 p0), acceptance={1} source=8 dest: 8}, { cond=(AND p1 p2 p3 p0), acceptance={} source=8 dest: 8}, { cond=(OR (AND p1 (NOT p2) (NOT p0)) (AND p1 p3 (NOT p0))), acceptance={} source=8 dest: 11}, { cond=(AND (NOT p1) p2 p3 (NOT p0)), acceptance={} source=8 dest: 13}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p4) p0), acceptance={0, 1, 2} source=9 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p4) p0), acceptance={0, 2} source=9 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p4) (NOT p0)), acceptance={} source=9 dest: 1}, { cond=(OR (AND (NOT p1) p2 (NOT p3) (NOT p0)) (AND (NOT p1) p2 (NOT p4) (NOT p0))), acceptance={} source=9 dest: 2}, { cond=(OR (AND p1 p2 (NOT p3) (NOT p0)) (AND p1 (NOT p4) (NOT p0))), acceptance={} source=9 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p4 (NOT p0)), acceptance={} source=9 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p4 p0), acceptance={0, 1} source=9 dest: 6}, { cond=(AND p1 (NOT p2) p4 p0), acceptance={0} source=9 dest: 6}, { cond=(AND (NOT p1) p2 p3 p4 p0), acceptance={1, 2} source=9 dest: 7}, { cond=(AND p1 p2 p3 p4 p0), acceptance={2} source=9 dest: 7}, { cond=(AND (NOT p1) p2 p3 p4 p0), acceptance={1} source=9 dest: 8}, { cond=(AND p1 p2 p3 p4 p0), acceptance={} source=9 dest: 8}, { cond=(OR (AND (NOT p1) p2 (NOT p3) p0) (AND (NOT p1) p2 (NOT p4) p0)), acceptance={1, 2} source=9 dest: 9}, { cond=(OR (AND p1 p2 (NOT p3) p0) (AND p1 p2 (NOT p4) p0)), acceptance={2} source=9 dest: 9}, { cond=(OR (AND p1 (NOT p2) p4 (NOT p0)) (AND p1 p3 p4 (NOT p0))), acceptance={} source=9 dest: 11}, { cond=(AND (NOT p1) p2 p3 p4 (NOT p0)), acceptance={} source=9 dest: 13}], [{ cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=10 dest: 2}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=10 dest: 3}, { cond=(AND p1 p2 p3), acceptance={} source=10 dest: 10}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=10 dest: 12}], [{ cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=11 dest: 2}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=11 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=11 dest: 4}, { cond=(OR (AND p1 (NOT p2)) (AND p1 p3)), acceptance={} source=11 dest: 11}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=11 dest: 13}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=12 dest: 2}, { cond=(AND p2 p3), acceptance={} source=12 dest: 12}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=13 dest: 2}, { cond=(NOT p2), acceptance={} source=13 dest: 4}, { cond=(AND p2 p3), acceptance={} source=13 dest: 13}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=14 dest: 1}, { cond=(AND p2 p3), acceptance={0, 1, 2} source=14 dest: 14}]], initial=0, aps=[p1:(OR (NEQ s35 1) (NEQ s153 1)), p2:(NEQ s96 1), p4:(OR (NEQ s35 1) (NEQ s153 1)), p0:(OR (NEQ s35 1) (NEQ s153 1)), p3:(AND (EQ s121 1) (EQ s194 1))], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 2398 reset in 478 ms.
Product exploration explored 100000 steps with 2338 reset in 412 ms.
Knowledge obtained : [p1, p2, p4, p0, (NOT p3)]
Stuttering acceptance computed with spot in 459 ms :[(AND (NOT p1) (NOT p2) (NOT p4)), true, (NOT p2), (AND (NOT p2) (NOT p1)), p2, false, false, false, false, (AND (NOT p1) (NOT p2) (NOT p4)), false, false, false, false, p2]
Product exploration explored 100000 steps with 2290 reset in 391 ms.
Product exploration explored 100000 steps with 2332 reset in 419 ms.
[2021-05-07 13:56:40] [INFO ] Flatten gal took : 23 ms
[2021-05-07 13:56:40] [INFO ] Flatten gal took : 23 ms
[2021-05-07 13:56:40] [INFO ] Time to serialize gal into /tmp/LTL3139523383394754209.gal : 3 ms
[2021-05-07 13:56:40] [INFO ] Time to serialize properties into /tmp/LTL5048163628302457209.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL3139523383394754209.gal, -t, CGAL, -LTL, /tmp/LTL5048163628302457209.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3139523383394754209.gal -t CGAL -LTL /tmp/LTL5048163628302457209.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((("((p118!=1)||(p575!=1))")U((G(("((p118!=1)||(p575!=1))")||(G("(p367!=1)"))))||((G(("((p520==1)&&(p884==1))")U("(p367==1)")))&&(("((p118!=1)||(p575!=1))")||(G("(p367!=1)")))))))
Formula 0 simplified : !("((p118!=1)||(p575!=1))" U (G("((p118!=1)||(p575!=1))" | G"(p367!=1)") | (("((p118!=1)||(p575!=1))" | G"(p367!=1)") & G("((p520==1)&&(p884==1))" U "(p367==1)"))))
Detected timeout of ITS tools.
[2021-05-07 13:56:55] [INFO ] Flatten gal took : 23 ms
[2021-05-07 13:56:55] [INFO ] Applying decomposition
[2021-05-07 13:56:55] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph4538348886297147880.txt, -o, /tmp/graph4538348886297147880.bin, -w, /tmp/graph4538348886297147880.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph4538348886297147880.bin, -l, -1, -v, -w, /tmp/graph4538348886297147880.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-07 13:56:55] [INFO ] Decomposing Gal with order
[2021-05-07 13:56:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-07 13:56:55] [INFO ] Removed a total of 1368 redundant transitions.
[2021-05-07 13:56:55] [INFO ] Flatten gal took : 37 ms
[2021-05-07 13:56:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 55 labels/synchronizations in 7 ms.
[2021-05-07 13:56:55] [INFO ] Time to serialize gal into /tmp/LTL7519849578735234141.gal : 3 ms
[2021-05-07 13:56:55] [INFO ] Time to serialize properties into /tmp/LTL1726744277082936476.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL7519849578735234141.gal, -t, CGAL, -LTL, /tmp/LTL1726744277082936476.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7519849578735234141.gal -t CGAL -LTL /tmp/LTL1726744277082936476.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((("((i0.u15.p118!=1)||(i0.u42.p575!=1))")U((G(("((i0.u15.p118!=1)||(i0.u42.p575!=1))")||(G("(i2.u25.p367!=1)"))))||((G(("((i3.u34.p520==1)&&(i3.u49.p884==1))")U("(i2.u25.p367==1)")))&&(("((i0.u15.p118!=1)||(i0.u42.p575!=1))")||(G("(i2.u25.p367!=1)")))))))
Formula 0 simplified : !("((i0.u15.p118!=1)||(i0.u42.p575!=1))" U (G("((i0.u15.p118!=1)||(i0.u42.p575!=1))" | G"(i2.u25.p367!=1)") | (("((i0.u15.p118!=1)||(i0.u42.p575!=1))" | G"(i2.u25.p367!=1)") & G("((i3.u34.p520==1)&&(i3.u49.p884==1))" U "(i2.u25.p367==1)"))))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15792271120841527049
[2021-05-07 13:57:10] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15792271120841527049
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15792271120841527049]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15792271120841527049] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15792271120841527049] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property ASLink-PT-02b-15 finished in 35930 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15502298926684593488
[2021-05-07 13:57:11] [INFO ] Computing symmetric may disable matrix : 1394 transitions.
[2021-05-07 13:57:11] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-07 13:57:11] [INFO ] Computing symmetric may enable matrix : 1394 transitions.
[2021-05-07 13:57:11] [INFO ] Applying decomposition
[2021-05-07 13:57:11] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-07 13:57:11] [INFO ] Flatten gal took : 68 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph3841266963346211082.txt, -o, /tmp/graph3841266963346211082.bin, -w, /tmp/graph3841266963346211082.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph3841266963346211082.bin, -l, -1, -v, -w, /tmp/graph3841266963346211082.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-07 13:57:11] [INFO ] Decomposing Gal with order
[2021-05-07 13:57:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-07 13:57:11] [INFO ] Removed a total of 1183 redundant transitions.
[2021-05-07 13:57:11] [INFO ] Computing Do-Not-Accords matrix : 1394 transitions.
[2021-05-07 13:57:11] [INFO ] Flatten gal took : 96 ms
[2021-05-07 13:57:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 11 ms.
[2021-05-07 13:57:11] [INFO ] Computation of Completed DNA matrix. took 57 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-07 13:57:11] [INFO ] Built C files in 420ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15502298926684593488
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15502298926684593488]
[2021-05-07 13:57:16] [INFO ] Time to serialize gal into /tmp/LTLFireability7622272304180398902.gal : 4340 ms
[2021-05-07 13:57:16] [INFO ] Time to serialize properties into /tmp/LTLFireability15381815246305420475.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability7622272304180398902.gal, -t, CGAL, -LTL, /tmp/LTLFireability15381815246305420475.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability7622272304180398902.gal -t CGAL -LTL /tmp/LTLFireability15381815246305420475.ltl -c -stutter-deadlock
Read 4 LTL properties
Checking formula 0 : !((X(X(("(((i22.u336.p973==0)||(i22.u358.p1188==0))||(i19.u174.p499==1))")||(X((G("((i4.u4.p9==1)&&(i0.u16.p52==1))"))U(("(i19.u174.p499==1)")&&(G("((i4.u4.p9==1)&&(i0.u16.p52==1))")))))))))
Formula 0 simplified : !XX("(((i22.u336.p973==0)||(i22.u358.p1188==0))||(i19.u174.p499==1))" | X(G"((i4.u4.p9==1)&&(i0.u16.p52==1))" U ("(i19.u174.p499==1)" & G"((i4.u4.p9==1)&&(i0.u16.p52==1))")))
Compilation finished in 12788 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin15502298926684593488]
Link finished in 128 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X((X(([]((LTLAPp1==true)) U ((LTLAPp2==true)&&[]((LTLAPp1==true)))))||(LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin15502298926684593488]
LTSmin run took 639 ms.
FORMULA ASLink-PT-02b-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, ([](((LTLAPp3==true) U ([]((LTLAPp5==true))&&(LTLAPp4==true))))||X((LTLAPp6==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin15502298926684593488]
LTSmin run took 848 ms.
FORMULA ASLink-PT-02b-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (<>([]((LTLAPp7==true)))&&<>(((<>((LTLAPp8==true))&&X((LTLAPp9==true)))||[](<>((LTLAPp8==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin15502298926684593488]
WARNING : LTSmin timed out (>257 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (<>([]((LTLAPp7==true)))&&<>(((<>((LTLAPp8==true))&&X((LTLAPp9==true)))||[](<>((LTLAPp8==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin15502298926684593488]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, ((LTLAPp10==true) U ([](([]((LTLAPp12==true))||(LTLAPp11==true)))||([](((LTLAPp13==true) U !(LTLAPp12==true)))&&([]((LTLAPp12==true))||(LTLAPp14==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin15502298926684593488]
WARNING : LTSmin timed out (>257 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, ((LTLAPp10==true) U ([](([]((LTLAPp12==true))||(LTLAPp11==true)))||([](((LTLAPp13==true) U !(LTLAPp12==true)))&&([]((LTLAPp12==true))||(LTLAPp14==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin15502298926684593488]
Retrying LTSmin with larger timeout 2056 s
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (<>([]((LTLAPp7==true)))&&<>(((<>((LTLAPp8==true))&&X((LTLAPp9==true)))||[](<>((LTLAPp8==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin15502298926684593488]
Detected timeout of ITS tools.
[2021-05-07 14:18:57] [INFO ] Applying decomposition
[2021-05-07 14:18:57] [INFO ] Flatten gal took : 112 ms
[2021-05-07 14:18:57] [INFO ] Decomposing Gal with order
[2021-05-07 14:18:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-07 14:18:58] [INFO ] Removed a total of 1079 redundant transitions.
[2021-05-07 14:18:58] [INFO ] Flatten gal took : 170 ms
[2021-05-07 14:18:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 1367 labels/synchronizations in 75 ms.
[2021-05-07 14:18:58] [INFO ] Time to serialize gal into /tmp/LTLFireability5125495375778554215.gal : 19 ms
[2021-05-07 14:18:58] [INFO ] Time to serialize properties into /tmp/LTLFireability14232466901294608670.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability5125495375778554215.gal, -t, CGAL, -LTL, /tmp/LTLFireability14232466901294608670.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability5125495375778554215.gal -t CGAL -LTL /tmp/LTLFireability14232466901294608670.ltl -c -stutter-deadlock
Read 2 LTL properties
Checking formula 0 : !(((F(G(!("((i0.i0.i0.i0.u5.p33==1)&&(i0.i0.i1.i0.i0.i0.i0.i0.i0.u18.p176==1))"))))&&((F(!("((i0.i0.i1.i0.i0.i0.i0.i0.i0.i0.u16.p113==1)&&(i0.i1.i0.i0.i0.i0.i0.i0.u65.p556==1))")))U(((X(!("(((i0.i0.i1.i0.i0.i0.i0.i0.i0.i0.u16.p113==1)&&(i0.i1.i0.i0.i0.i0.i0.i0.u65.p556==1))&&(i1.i1.i18.u195.p1196==1))")))&&(F(!("((i0.i0.i1.i0.i0.i0.i0.i0.i0.i0.u16.p113==1)&&(i0.i1.i0.i0.i0.i0.i0.i0.u65.p556==1))"))))||(G(F(!("((i0.i0.i1.i0.i0.i0.i0.i0.i0.i0.u16.p113==1)&&(i0.i1.i0.i0.i0.i0.i0.i0.u65.p556==1))"))))))))
Formula 0 simplified : !(FG!"((i0.i0.i0.i0.u5.p33==1)&&(i0.i0.i1.i0.i0.i0.i0.i0.i0.u18.p176==1))" & (F!"((i0.i0.i1.i0.i0.i0.i0.i0.i0.i0.u16.p113==1)&&(i0.i1.i0.i0.i0.i0.i0.i0.u65.p556==1))" U ((F!"((i0.i0.i1.i0.i0.i0.i0.i0.i0.i0.u16.p113==1)&&(i0.i1.i0.i0.i0.i0.i0.i0.u65.p556==1))" & X!"(((i0.i0.i1.i0.i0.i0.i0.i0.i0.i0.u16.p113==1)&&(i0.i1.i0.i0.i0.i0.i0.i0.u65.p556==1))&&(i1.i1.i18.u195.p1196==1))") | GF!"((i0.i0.i1.i0.i0.i0.i0.i0.i0.i0.u16.p113==1)&&(i0.i1.i0.i0.i0.i0.i0.i0.u65.p556==1))")))
WARNING : LTSmin timed out (>2056 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (<>([]((LTLAPp7==true)))&&<>(((<>((LTLAPp8==true))&&X((LTLAPp9==true)))||[](<>((LTLAPp8==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin15502298926684593488]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, ((LTLAPp10==true) U ([](([]((LTLAPp12==true))||(LTLAPp11==true)))||([](((LTLAPp13==true) U !(LTLAPp12==true)))&&([]((LTLAPp12==true))||(LTLAPp14==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin15502298926684593488]
Detected timeout of ITS tools.
[2021-05-07 14:40:40] [INFO ] Flatten gal took : 120 ms
[2021-05-07 14:40:40] [INFO ] Input system was already deterministic with 1394 transitions.
[2021-05-07 14:40:40] [INFO ] Transformed 1066 places.
[2021-05-07 14:40:40] [INFO ] Transformed 1394 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-07 14:41:10] [INFO ] Time to serialize gal into /tmp/LTLFireability14809766840629944071.gal : 4 ms
[2021-05-07 14:41:10] [INFO ] Time to serialize properties into /tmp/LTLFireability3983726416335193264.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability14809766840629944071.gal, -t, CGAL, -LTL, /tmp/LTLFireability3983726416335193264.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability14809766840629944071.gal -t CGAL -LTL /tmp/LTLFireability3983726416335193264.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((F(G(!("((p33==1)&&(p176==1))"))))&&((F(!("((p113==1)&&(p556==1))")))U(((X(!("(((p113==1)&&(p556==1))&&(p1196==1))")))&&(F(!("((p113==1)&&(p556==1))"))))||(G(F(!("((p113==1)&&(p556==1))"))))))))
Formula 0 simplified : !(FG!"((p33==1)&&(p176==1))" & (F!"((p113==1)&&(p556==1))" U ((F!"((p113==1)&&(p556==1))" & X!"(((p113==1)&&(p556==1))&&(p1196==1))") | GF!"((p113==1)&&(p556==1))")))

BK_TIME_CONFINEMENT_REACHED

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="ASLink-PT-02b"
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 ASLink-PT-02b, 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 r007-tall-162037989400034"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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