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-162037989400033.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-tall-162037989400033
=====================================================================

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

Running Version 0
[2021-05-07 13:51:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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:51:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-07 13:51:44] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2021-05-07 13:51:44] [INFO ] Transformed 1242 places.
[2021-05-07 13:51:44] [INFO ] Transformed 1621 transitions.
[2021-05-07 13:51:44] [INFO ] Found NUPN structural information;
[2021-05-07 13:51:44] [INFO ] Parsed PT model containing 1242 places and 1621 transitions in 165 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-07 13:51:44] [INFO ] Initial state test concluded for 4 properties.
FORMULA ASLink-PT-02b-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02b-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02b-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02b-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02b-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02b-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02b-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 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 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 168 place count 1146 transition count 1511
Iterating global reduction 1 with 25 rules applied. Total rules applied 193 place count 1146 transition count 1511
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 201 place count 1146 transition count 1503
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 206 place count 1141 transition count 1498
Iterating global reduction 2 with 5 rules applied. Total rules applied 211 place count 1141 transition count 1498
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 215 place count 1137 transition count 1487
Iterating global reduction 2 with 4 rules applied. Total rules applied 219 place count 1137 transition count 1487
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 222 place count 1134 transition count 1484
Iterating global reduction 2 with 3 rules applied. Total rules applied 225 place count 1134 transition count 1484
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 228 place count 1131 transition count 1474
Iterating global reduction 2 with 3 rules applied. Total rules applied 231 place count 1131 transition count 1474
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 232 place count 1130 transition count 1466
Iterating global reduction 2 with 1 rules applied. Total rules applied 233 place count 1130 transition count 1466
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 234 place count 1129 transition count 1465
Iterating global reduction 2 with 1 rules applied. Total rules applied 235 place count 1129 transition count 1465
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 236 place count 1128 transition count 1457
Iterating global reduction 2 with 1 rules applied. Total rules applied 237 place count 1128 transition count 1457
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 238 place count 1127 transition count 1449
Iterating global reduction 2 with 1 rules applied. Total rules applied 239 place count 1127 transition count 1449
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 240 place count 1126 transition count 1448
Iterating global reduction 2 with 1 rules applied. Total rules applied 241 place count 1126 transition count 1448
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 242 place count 1125 transition count 1440
Iterating global reduction 2 with 1 rules applied. Total rules applied 243 place count 1125 transition count 1440
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 244 place count 1124 transition count 1432
Iterating global reduction 2 with 1 rules applied. Total rules applied 245 place count 1124 transition count 1432
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 246 place count 1123 transition count 1431
Iterating global reduction 2 with 1 rules applied. Total rules applied 247 place count 1123 transition count 1431
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 248 place count 1122 transition count 1423
Iterating global reduction 2 with 1 rules applied. Total rules applied 249 place count 1122 transition count 1423
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 250 place count 1121 transition count 1415
Iterating global reduction 2 with 1 rules applied. Total rules applied 251 place count 1121 transition count 1415
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 252 place count 1120 transition count 1414
Iterating global reduction 2 with 1 rules applied. Total rules applied 253 place count 1120 transition count 1414
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 254 place count 1119 transition count 1406
Iterating global reduction 2 with 1 rules applied. Total rules applied 255 place count 1119 transition count 1406
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 256 place count 1118 transition count 1398
Iterating global reduction 2 with 1 rules applied. Total rules applied 257 place count 1118 transition count 1398
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 258 place count 1117 transition count 1397
Iterating global reduction 2 with 1 rules applied. Total rules applied 259 place count 1117 transition count 1397
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 260 place count 1116 transition count 1389
Iterating global reduction 2 with 1 rules applied. Total rules applied 261 place count 1116 transition count 1389
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 262 place count 1115 transition count 1381
Iterating global reduction 2 with 1 rules applied. Total rules applied 263 place count 1115 transition count 1381
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 264 place count 1114 transition count 1380
Iterating global reduction 2 with 1 rules applied. Total rules applied 265 place count 1114 transition count 1380
Applied a total of 265 rules in 1606 ms. Remains 1114 /1242 variables (removed 128) and now considering 1380/1621 (removed 241) transitions.
// Phase 1: matrix 1380 rows 1114 cols
[2021-05-07 13:51:45] [INFO ] Computed 121 place invariants in 67 ms
[2021-05-07 13:51:46] [INFO ] Implicit Places using invariants in 615 ms returned [948, 959, 970, 978, 986, 994, 1002, 1013, 1021, 1029, 1040]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 641 ms to find 11 implicit places.
// Phase 1: matrix 1380 rows 1103 cols
[2021-05-07 13:51:46] [INFO ] Computed 110 place invariants in 52 ms
[2021-05-07 13:51:47] [INFO ] Dead Transitions using invariants and state equation in 745 ms returned []
Starting structural reductions, iteration 1 : 1103/1242 places, 1380/1621 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1092 transition count 1369
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1092 transition count 1369
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 30 place count 1084 transition count 1361
Iterating global reduction 0 with 8 rules applied. Total rules applied 38 place count 1084 transition count 1361
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 44 place count 1078 transition count 1355
Iterating global reduction 0 with 6 rules applied. Total rules applied 50 place count 1078 transition count 1355
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 1076 transition count 1353
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 1076 transition count 1353
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 1075 transition count 1352
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 1075 transition count 1352
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 1074 transition count 1351
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 1074 transition count 1351
Applied a total of 58 rules in 169 ms. Remains 1074 /1103 variables (removed 29) and now considering 1351/1380 (removed 29) transitions.
// Phase 1: matrix 1351 rows 1074 cols
[2021-05-07 13:51:47] [INFO ] Computed 110 place invariants in 33 ms
[2021-05-07 13:51:47] [INFO ] Implicit Places using invariants in 382 ms returned []
// Phase 1: matrix 1351 rows 1074 cols
[2021-05-07 13:51:47] [INFO ] Computed 110 place invariants in 14 ms
[2021-05-07 13:51:50] [INFO ] Implicit Places using invariants and state equation in 2438 ms returned []
Implicit Place search using SMT with State Equation took 2824 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1074/1242 places, 1351/1621 transitions.
[2021-05-07 13:51:50] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-07 13:51:50] [INFO ] Flatten gal took : 133 ms
FORMULA ASLink-PT-02b-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-07 13:51:50] [INFO ] Flatten gal took : 80 ms
[2021-05-07 13:51:50] [INFO ] Input system was already deterministic with 1351 transitions.
Finished random walk after 34091 steps, including 143 resets, run visited all 18 properties in 196 ms. (steps per millisecond=173 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)&&(G(p2)||p1))))], workingDir=/home/mcc/execution]
Support contains 5 out of 1074 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1074/1074 places, 1351/1351 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1067 transition count 1344
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1067 transition count 1344
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 1067 transition count 1343
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 20 place count 1062 transition count 1333
Iterating global reduction 1 with 5 rules applied. Total rules applied 25 place count 1062 transition count 1333
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 1058 transition count 1329
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 1058 transition count 1329
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 1056 transition count 1327
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 1056 transition count 1327
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 1054 transition count 1325
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 1054 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 1053 transition count 1324
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 1053 transition count 1324
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 1052 transition count 1323
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 1052 transition count 1323
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 1051 transition count 1322
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 1051 transition count 1322
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 1050 transition count 1321
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 1050 transition count 1321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 1049 transition count 1320
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 1049 transition count 1320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 1048 transition count 1319
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 1048 transition count 1319
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 1047 transition count 1318
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 1047 transition count 1318
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 1046 transition count 1317
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 1046 transition count 1317
Applied a total of 57 rules in 342 ms. Remains 1046 /1074 variables (removed 28) and now considering 1317/1351 (removed 34) transitions.
// Phase 1: matrix 1317 rows 1046 cols
[2021-05-07 13:51:51] [INFO ] Computed 110 place invariants in 16 ms
[2021-05-07 13:51:51] [INFO ] Implicit Places using invariants in 412 ms returned []
// Phase 1: matrix 1317 rows 1046 cols
[2021-05-07 13:51:51] [INFO ] Computed 110 place invariants in 11 ms
[2021-05-07 13:51:53] [INFO ] Implicit Places using invariants and state equation in 1857 ms returned []
Implicit Place search using SMT with State Equation took 2272 ms to find 0 implicit places.
// Phase 1: matrix 1317 rows 1046 cols
[2021-05-07 13:51:53] [INFO ] Computed 110 place invariants in 12 ms
[2021-05-07 13:51:54] [INFO ] Dead Transitions using invariants and state equation in 818 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1046/1074 places, 1317/1351 transitions.
Stuttering acceptance computed with spot in 257 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p2)]
Running random walk in product with property : ASLink-PT-02b-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (NEQ s408 0) (NEQ s16 1)), p2:(EQ s572 1), p0:(AND (NEQ s787 0) (NEQ s826 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 580 steps with 0 reset in 8 ms.
FORMULA ASLink-PT-02b-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02b-00 finished in 3785 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X((G(p1)||p0))&&F((p2&&F(p3)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 1074 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1074/1074 places, 1351/1351 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1066 transition count 1336
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1066 transition count 1336
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 1066 transition count 1335
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 1061 transition count 1318
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 1061 transition count 1318
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 31 place count 1057 transition count 1314
Iterating global reduction 1 with 4 rules applied. Total rules applied 35 place count 1057 transition count 1314
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 1055 transition count 1305
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 1055 transition count 1305
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 1054 transition count 1304
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 1054 transition count 1304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 1053 transition count 1303
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 1053 transition count 1303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 1052 transition count 1302
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 1052 transition count 1302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 1051 transition count 1301
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 1051 transition count 1301
Applied a total of 47 rules in 289 ms. Remains 1051 /1074 variables (removed 23) and now considering 1301/1351 (removed 50) transitions.
// Phase 1: matrix 1301 rows 1051 cols
[2021-05-07 13:51:55] [INFO ] Computed 110 place invariants in 11 ms
[2021-05-07 13:51:55] [INFO ] Implicit Places using invariants in 416 ms returned []
// Phase 1: matrix 1301 rows 1051 cols
[2021-05-07 13:51:55] [INFO ] Computed 110 place invariants in 11 ms
[2021-05-07 13:51:57] [INFO ] Implicit Places using invariants and state equation in 1735 ms returned []
Implicit Place search using SMT with State Equation took 2173 ms to find 0 implicit places.
// Phase 1: matrix 1301 rows 1051 cols
[2021-05-07 13:51:57] [INFO ] Computed 110 place invariants in 16 ms
[2021-05-07 13:51:57] [INFO ] Dead Transitions using invariants and state equation in 629 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1051/1074 places, 1301/1351 transitions.
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p2) (NOT p3) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p3)), (NOT p3), true, (NOT p1)]
Running random walk in product with property : ASLink-PT-02b-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(OR (EQ s1045 0) (EQ s970 1)), p3:(OR (EQ s903 0) (EQ s680 1)), p0:(OR (EQ s903 0) (EQ s680 1)), p1:(OR (EQ s959 0) (EQ s207 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 953 ms.
Product exploration explored 100000 steps with 50000 reset in 859 ms.
Knowledge obtained : [p2, p3, p0, p1]
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p2) (NOT p3) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p3)), (NOT p3), true, (NOT p1)]
Product exploration explored 100000 steps with 50000 reset in 903 ms.
Product exploration explored 100000 steps with 50000 reset in 884 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p2) (NOT p3) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p3)), (NOT p3), true, (NOT p1)]
Support contains 6 out of 1051 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1051/1051 places, 1301/1301 transitions.
Performed 180 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 180 rules applied. Total rules applied 180 place count 1051 transition count 1301
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 181 place count 1051 transition count 1300
Performed 228 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 228 Pre rules applied. Total rules applied 181 place count 1051 transition count 1802
Deduced a syphon composed of 408 places in 3 ms
Iterating global reduction 2 with 228 rules applied. Total rules applied 409 place count 1051 transition count 1802
Discarding 79 places :
Symmetric choice reduction at 2 with 79 rule applications. Total rules 488 place count 972 transition count 1693
Deduced a syphon composed of 329 places in 2 ms
Iterating global reduction 2 with 79 rules applied. Total rules applied 567 place count 972 transition count 1693
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 469 places in 2 ms
Iterating global reduction 2 with 140 rules applied. Total rules applied 707 place count 972 transition count 1694
Discarding 78 places :
Symmetric choice reduction at 2 with 78 rule applications. Total rules 785 place count 894 transition count 1612
Deduced a syphon composed of 395 places in 2 ms
Iterating global reduction 2 with 78 rules applied. Total rules applied 863 place count 894 transition count 1612
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 865 place count 892 transition count 1609
Deduced a syphon composed of 395 places in 4 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 867 place count 892 transition count 1609
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 892 transition count 1607
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -85
Deduced a syphon composed of 411 places in 4 ms
Iterating global reduction 3 with 16 rules applied. Total rules applied 885 place count 892 transition count 1692
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 891 place count 886 transition count 1678
Deduced a syphon composed of 405 places in 5 ms
Iterating global reduction 3 with 6 rules applied. Total rules applied 897 place count 886 transition count 1678
Performed 2(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 407 places in 3 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 899 place count 886 transition count 1690
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 901 place count 884 transition count 1682
Deduced a syphon composed of 405 places in 3 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 903 place count 884 transition count 1682
Deduced a syphon composed of 405 places in 2 ms
Applied a total of 903 rules in 490 ms. Remains 884 /1051 variables (removed 167) and now considering 1682/1301 (removed -381) transitions.
[2021-05-07 13:52:02] [INFO ] Redundant transitions in 131 ms returned []
// Phase 1: matrix 1682 rows 884 cols
[2021-05-07 13:52:02] [INFO ] Computed 110 place invariants in 22 ms
[2021-05-07 13:52:03] [INFO ] Dead Transitions using invariants and state equation in 781 ms returned []
Finished structural reductions, in 1 iterations. Remains : 884/1051 places, 1682/1301 transitions.
Product exploration explored 100000 steps with 50000 reset in 3968 ms.
Product exploration explored 100000 steps with 50000 reset in 3760 ms.
[2021-05-07 13:52:11] [INFO ] Flatten gal took : 100 ms
[2021-05-07 13:52:11] [INFO ] Flatten gal took : 57 ms
[2021-05-07 13:52:11] [INFO ] Time to serialize gal into /tmp/LTL18071868810109422667.gal : 23 ms
[2021-05-07 13:52:11] [INFO ] Time to serialize properties into /tmp/LTL4737353184364056190.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/LTL18071868810109422667.gal, -t, CGAL, -LTL, /tmp/LTL4737353184364056190.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/LTL18071868810109422667.gal -t CGAL -LTL /tmp/LTL4737353184364056190.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X(("((p1013==0)||(p739==1))")||(G("((p1104==0)||(p228==1))"))))&&(F(("((p1235==0)||(p1130==1))")&&(F("((p1013==0)||(p739==1))"))))))
Formula 0 simplified : !(X("((p1013==0)||(p739==1))" | G"((p1104==0)||(p228==1))") & F("((p1235==0)||(p1130==1))" & F"((p1013==0)||(p739==1))"))
Detected timeout of ITS tools.
[2021-05-07 13:52:26] [INFO ] Flatten gal took : 52 ms
[2021-05-07 13:52:26] [INFO ] Applying decomposition
[2021-05-07 13:52:26] [INFO ] Flatten gal took : 47 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/graph16320076485496281119.txt, -o, /tmp/graph16320076485496281119.bin, -w, /tmp/graph16320076485496281119.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/graph16320076485496281119.bin, -l, -1, -v, -w, /tmp/graph16320076485496281119.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-07 13:52:26] [INFO ] Decomposing Gal with order
[2021-05-07 13:52:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-07 13:52:27] [INFO ] Removed a total of 1024 redundant transitions.
[2021-05-07 13:52:27] [INFO ] Flatten gal took : 141 ms
[2021-05-07 13:52:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 21 labels/synchronizations in 25 ms.
[2021-05-07 13:52:27] [INFO ] Time to serialize gal into /tmp/LTL4165542557598661216.gal : 16 ms
[2021-05-07 13:52:27] [INFO ] Time to serialize properties into /tmp/LTL255857676135143629.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/LTL4165542557598661216.gal, -t, CGAL, -LTL, /tmp/LTL255857676135143629.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/LTL4165542557598661216.gal -t CGAL -LTL /tmp/LTL255857676135143629.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((X(("((i19.u346.p1013==0)||(i14.u258.p739==1))")||(G("((i19.u369.p1104==0)||(i5.i1.i0.u70.p228==1))"))))&&(F(("((i20.u396.p1235==0)||(i19.u374.p1130==1))")&&(F("((i19.u346.p1013==0)||(i14.u258.p739==1))"))))))
Formula 0 simplified : !(X("((i19.u346.p1013==0)||(i14.u258.p739==1))" | G"((i19.u369.p1104==0)||(i5.i1.i0.u70.p228==1))") & F("((i20.u396.p1235==0)||(i19.u374.p1130==1))" & F"((i19.u346.p1013==0)||(i14.u258.p739==1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6550427203637003466
[2021-05-07 13:52:42] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6550427203637003466
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/ltsmin6550427203637003466]
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/ltsmin6550427203637003466] 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/ltsmin6550427203637003466] 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 48674 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 1074 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1074/1074 places, 1351/1351 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 0 with 192 rules applied. Total rules applied 192 place count 1073 transition count 1158
Reduce places removed 192 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 197 rules applied. Total rules applied 389 place count 881 transition count 1153
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 392 place count 878 transition count 1153
Performed 284 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 284 Pre rules applied. Total rules applied 392 place count 878 transition count 869
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 3 with 592 rules applied. Total rules applied 984 place count 570 transition count 869
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 3 with 18 rules applied. Total rules applied 1002 place count 568 transition count 853
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 1018 place count 552 transition count 853
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 1018 place count 552 transition count 844
Deduced a syphon composed of 9 places in 38 ms
Ensure Unique test removed 9 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 27 rules applied. Total rules applied 1045 place count 534 transition count 844
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 1045 place count 534 transition count 836
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 1061 place count 526 transition count 836
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1066 place count 521 transition count 824
Iterating global reduction 5 with 5 rules applied. Total rules applied 1071 place count 521 transition count 824
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1071 place count 521 transition count 822
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1075 place count 519 transition count 822
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1079 place count 515 transition count 811
Iterating global reduction 5 with 4 rules applied. Total rules applied 1083 place count 515 transition count 811
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1084 place count 514 transition count 803
Iterating global reduction 5 with 1 rules applied. Total rules applied 1085 place count 514 transition count 803
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 5 with 178 rules applied. Total rules applied 1263 place count 424 transition count 715
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1267 place count 420 transition count 711
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 1272 place count 419 transition count 711
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 1273 place count 419 transition count 710
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1274 place count 418 transition count 710
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1274 place count 418 transition count 709
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 1276 place count 417 transition count 709
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1279 place count 414 transition count 706
Iterating global reduction 7 with 3 rules applied. Total rules applied 1282 place count 414 transition count 706
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 7 with 2 rules applied. Total rules applied 1284 place count 414 transition count 704
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1285 place count 413 transition count 704
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1286 place count 412 transition count 703
Iterating global reduction 9 with 1 rules applied. Total rules applied 1287 place count 412 transition count 703
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 9 with 2 rules applied. Total rules applied 1289 place count 411 transition count 708
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1290 place count 410 transition count 707
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1291 place count 409 transition count 706
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 9 with 6 rules applied. Total rules applied 1297 place count 405 transition count 704
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1299 place count 403 transition count 704
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 6 Pre rules applied. Total rules applied 1299 place count 403 transition count 698
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 11 with 13 rules applied. Total rules applied 1312 place count 396 transition count 698
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 11 with 4 rules applied. Total rules applied 1316 place count 392 transition count 698
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 1316 place count 392 transition count 697
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 1318 place count 391 transition count 697
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 12 with 12 rules applied. Total rules applied 1330 place count 385 transition count 691
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 1333 place count 382 transition count 688
Iterating global reduction 12 with 3 rules applied. Total rules applied 1336 place count 382 transition count 688
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 1338 place count 380 transition count 686
Iterating global reduction 12 with 2 rules applied. Total rules applied 1340 place count 380 transition count 686
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1342 place count 380 transition count 684
Applied a total of 1342 rules in 585 ms. Remains 380 /1074 variables (removed 694) and now considering 684/1351 (removed 667) transitions.
// Phase 1: matrix 684 rows 380 cols
[2021-05-07 13:52:43] [INFO ] Computed 63 place invariants in 5 ms
[2021-05-07 13:52:44] [INFO ] Implicit Places using invariants in 255 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 188, 207, 257, 262, 263, 266, 277, 278, 279, 297, 318, 319, 320, 321]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 256 ms to find 24 implicit places.
[2021-05-07 13:52:44] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 684 rows 356 cols
[2021-05-07 13:52:44] [INFO ] Computed 39 place invariants in 5 ms
[2021-05-07 13:52:44] [INFO ] Dead Transitions using invariants and state equation in 249 ms returned []
Starting structural reductions, iteration 1 : 356/1074 places, 684/1351 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 356 transition count 651
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 323 transition count 651
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 66 place count 323 transition count 634
Deduced a syphon composed of 17 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 35 rules applied. Total rules applied 101 place count 305 transition count 634
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 113 place count 301 transition count 626
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 121 place count 293 transition count 626
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 124 place count 290 transition count 623
Iterating global reduction 4 with 3 rules applied. Total rules applied 127 place count 290 transition count 623
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 130 place count 290 transition count 620
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 164 place count 273 transition count 603
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 165 place count 272 transition count 601
Iterating global reduction 5 with 1 rules applied. Total rules applied 166 place count 272 transition count 601
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 5 with 4 rules applied. Total rules applied 170 place count 270 transition count 602
Applied a total of 170 rules in 57 ms. Remains 270 /356 variables (removed 86) and now considering 602/684 (removed 82) transitions.
// Phase 1: matrix 602 rows 270 cols
[2021-05-07 13:52:44] [INFO ] Computed 34 place invariants in 4 ms
[2021-05-07 13:52:44] [INFO ] Implicit Places using invariants in 153 ms returned [88, 94, 99, 188, 196, 202, 267]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 154 ms to find 7 implicit places.
Starting structural reductions, iteration 2 : 263/1074 places, 602/1351 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 601
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 601
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 6 place count 258 transition count 597
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 258 transition count 597
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 14 place count 254 transition count 593
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 254 transition count 593
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 21 place count 251 transition count 590
Iterating global reduction 2 with 3 rules applied. Total rules applied 24 place count 251 transition count 590
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 250 transition count 589
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 250 transition count 589
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 249 transition count 588
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 249 transition count 588
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 32 place count 247 transition count 586
Applied a total of 32 rules in 42 ms. Remains 247 /263 variables (removed 16) and now considering 586/602 (removed 16) transitions.
// Phase 1: matrix 586 rows 247 cols
[2021-05-07 13:52:44] [INFO ] Computed 27 place invariants in 5 ms
[2021-05-07 13:52:44] [INFO ] Implicit Places using invariants in 138 ms returned []
// Phase 1: matrix 586 rows 247 cols
[2021-05-07 13:52:44] [INFO ] Computed 27 place invariants in 5 ms
[2021-05-07 13:52:45] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 247/1074 places, 586/1351 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
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 p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s119 0) (NEQ s99 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2820 reset in 225 ms.
Product exploration explored 100000 steps with 2913 reset in 262 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2835 reset in 189 ms.
Product exploration explored 100000 steps with 2878 reset in 248 ms.
[2021-05-07 13:52:46] [INFO ] Flatten gal took : 24 ms
[2021-05-07 13:52:46] [INFO ] Flatten gal took : 23 ms
[2021-05-07 13:52:46] [INFO ] Time to serialize gal into /tmp/LTL7192099105724678719.gal : 3 ms
[2021-05-07 13:52:46] [INFO ] Time to serialize properties into /tmp/LTL14015566877121084389.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/LTL7192099105724678719.gal, -t, CGAL, -LTL, /tmp/LTL14015566877121084389.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/LTL7192099105724678719.gal -t CGAL -LTL /tmp/LTL14015566877121084389.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("((p523!=0)||(p485!=1))"))))
Formula 0 simplified : !GF"((p523!=0)||(p485!=1))"
Detected timeout of ITS tools.
[2021-05-07 13:53:01] [INFO ] Flatten gal took : 39 ms
[2021-05-07 13:53:01] [INFO ] Applying decomposition
[2021-05-07 13:53:01] [INFO ] Flatten gal took : 22 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/graph5735448027542724885.txt, -o, /tmp/graph5735448027542724885.bin, -w, /tmp/graph5735448027542724885.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/graph5735448027542724885.bin, -l, -1, -v, -w, /tmp/graph5735448027542724885.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-07 13:53:01] [INFO ] Decomposing Gal with order
[2021-05-07 13:53:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-07 13:53:01] [INFO ] Removed a total of 1157 redundant transitions.
[2021-05-07 13:53:01] [INFO ] Flatten gal took : 38 ms
[2021-05-07 13:53:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 8 ms.
[2021-05-07 13:53:01] [INFO ] Time to serialize gal into /tmp/LTL17889834500295239035.gal : 3 ms
[2021-05-07 13:53:01] [INFO ] Time to serialize properties into /tmp/LTL7555393129981127986.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/LTL17889834500295239035.gal, -t, CGAL, -LTL, /tmp/LTL7555393129981127986.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/LTL17889834500295239035.gal -t CGAL -LTL /tmp/LTL7555393129981127986.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(F("((i4.i0.u35.p523!=0)||(i2.i0.u27.p485!=1))"))))
Formula 0 simplified : !GF"((i4.i0.u35.p523!=0)||(i2.i0.u27.p485!=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13563085397832815147
[2021-05-07 13:53:16] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13563085397832815147
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/ltsmin13563085397832815147]
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/ltsmin13563085397832815147] 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/ltsmin13563085397832815147] 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-05 finished in 34308 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 1074 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1074/1074 places, 1351/1351 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1065 transition count 1335
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1065 transition count 1335
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 1065 transition count 1334
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 25 place count 1059 transition count 1316
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 1059 transition count 1316
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 1054 transition count 1311
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 1054 transition count 1311
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 44 place count 1051 transition count 1301
Iterating global reduction 1 with 3 rules applied. Total rules applied 47 place count 1051 transition count 1301
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 1049 transition count 1299
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 1049 transition count 1299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 1048 transition count 1298
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 1048 transition count 1298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 1047 transition count 1297
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 1047 transition count 1297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 1046 transition count 1296
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 1046 transition count 1296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 1045 transition count 1295
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 1045 transition count 1295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 1044 transition count 1294
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 1044 transition count 1294
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 1043 transition count 1293
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 1043 transition count 1293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 1042 transition count 1292
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 1042 transition count 1292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 1041 transition count 1291
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 1041 transition count 1291
Applied a total of 67 rules in 467 ms. Remains 1041 /1074 variables (removed 33) and now considering 1291/1351 (removed 60) transitions.
// Phase 1: matrix 1291 rows 1041 cols
[2021-05-07 13:53:18] [INFO ] Computed 110 place invariants in 11 ms
[2021-05-07 13:53:18] [INFO ] Implicit Places using invariants in 391 ms returned []
// Phase 1: matrix 1291 rows 1041 cols
[2021-05-07 13:53:18] [INFO ] Computed 110 place invariants in 10 ms
[2021-05-07 13:53:21] [INFO ] Implicit Places using invariants and state equation in 3013 ms returned []
Implicit Place search using SMT with State Equation took 3414 ms to find 0 implicit places.
// Phase 1: matrix 1291 rows 1041 cols
[2021-05-07 13:53:21] [INFO ] Computed 110 place invariants in 11 ms
[2021-05-07 13:53:22] [INFO ] Dead Transitions using invariants and state equation in 653 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1041/1074 places, 1291/1351 transitions.
Stuttering acceptance computed with spot in 57 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:(AND (NEQ s22 0) (NEQ s958 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-02b-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02b-06 finished in 4633 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 1074 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1074/1074 places, 1351/1351 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 191 transitions
Trivial Post-agglo rules discarded 191 transitions
Performed 191 trivial Post agglomeration. Transition count delta: 191
Iterating post reduction 0 with 191 rules applied. Total rules applied 191 place count 1073 transition count 1159
Reduce places removed 191 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 196 rules applied. Total rules applied 387 place count 882 transition count 1154
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 390 place count 879 transition count 1154
Performed 284 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 284 Pre rules applied. Total rules applied 390 place count 879 transition count 870
Deduced a syphon composed of 284 places in 2 ms
Ensure Unique test removed 24 places
Reduce places removed 308 places and 0 transitions.
Iterating global reduction 3 with 592 rules applied. Total rules applied 982 place count 571 transition count 870
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 3 with 18 rules applied. Total rules applied 1000 place count 569 transition count 854
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 1016 place count 553 transition count 854
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 1016 place count 553 transition count 845
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 5 with 27 rules applied. Total rules applied 1043 place count 535 transition count 845
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 1043 place count 535 transition count 837
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 1059 place count 527 transition count 837
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1064 place count 522 transition count 825
Iterating global reduction 5 with 5 rules applied. Total rules applied 1069 place count 522 transition count 825
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 1069 place count 522 transition count 822
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 1075 place count 519 transition count 822
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1079 place count 515 transition count 806
Iterating global reduction 5 with 4 rules applied. Total rules applied 1083 place count 515 transition count 806
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1084 place count 514 transition count 798
Iterating global reduction 5 with 1 rules applied. Total rules applied 1085 place count 514 transition count 798
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 5 with 177 rules applied. Total rules applied 1262 place count 425 transition count 710
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1266 place count 421 transition count 706
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 1271 place count 420 transition count 706
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1271 place count 420 transition count 705
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1273 place count 419 transition count 705
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1275 place count 417 transition count 703
Iterating global reduction 5 with 2 rules applied. Total rules applied 1277 place count 417 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 5 with 2 rules applied. Total rules applied 1279 place count 417 transition count 701
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1280 place count 416 transition count 701
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1282 place count 415 transition count 707
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1283 place count 414 transition count 706
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1284 place count 413 transition count 705
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 7 with 6 rules applied. Total rules applied 1290 place count 409 transition count 703
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1292 place count 407 transition count 703
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 6 Pre rules applied. Total rules applied 1292 place count 407 transition count 697
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 9 with 13 rules applied. Total rules applied 1305 place count 400 transition count 697
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 9 with 5 rules applied. Total rules applied 1310 place count 395 transition count 697
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 1310 place count 395 transition count 696
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 1312 place count 394 transition count 696
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 10 with 14 rules applied. Total rules applied 1326 place count 387 transition count 689
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 1330 place count 383 transition count 685
Iterating global reduction 10 with 4 rules applied. Total rules applied 1334 place count 383 transition count 685
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 1336 place count 381 transition count 683
Iterating global reduction 10 with 2 rules applied. Total rules applied 1338 place count 381 transition count 683
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1340 place count 381 transition count 681
Applied a total of 1340 rules in 188 ms. Remains 381 /1074 variables (removed 693) and now considering 681/1351 (removed 670) transitions.
// Phase 1: matrix 681 rows 381 cols
[2021-05-07 13:53:22] [INFO ] Computed 63 place invariants in 6 ms
[2021-05-07 13:53:22] [INFO ] Implicit Places using invariants in 243 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 167, 185, 204, 256, 257, 260, 271, 272, 273, 291, 295, 313, 314, 315, 316]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 244 ms to find 26 implicit places.
[2021-05-07 13:53:22] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 681 rows 355 cols
[2021-05-07 13:53:22] [INFO ] Computed 37 place invariants in 5 ms
[2021-05-07 13:53:23] [INFO ] Dead Transitions using invariants and state equation in 275 ms returned []
Starting structural reductions, iteration 1 : 355/1074 places, 681/1351 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 355 transition count 637
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 88 place count 311 transition count 637
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 88 place count 311 transition count 622
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 2 with 31 rules applied. Total rules applied 119 place count 295 transition count 622
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 131 place count 291 transition count 614
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 139 place count 283 transition count 614
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 142 place count 280 transition count 611
Iterating global reduction 4 with 3 rules applied. Total rules applied 145 place count 280 transition count 611
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 148 place count 280 transition count 608
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 192 place count 258 transition count 586
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 194 place count 257 transition count 588
Applied a total of 194 rules in 39 ms. Remains 257 /355 variables (removed 98) and now considering 588/681 (removed 93) transitions.
// Phase 1: matrix 588 rows 257 cols
[2021-05-07 13:53:23] [INFO ] Computed 32 place invariants in 4 ms
[2021-05-07 13:53:23] [INFO ] Implicit Places using invariants in 295 ms returned [88, 94, 99, 174, 180, 185, 254]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 297 ms to find 7 implicit places.
Starting structural reductions, iteration 2 : 250/1074 places, 588/1351 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 250 transition count 587
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 249 transition count 587
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 6 place count 245 transition count 583
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 245 transition count 583
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 14 place count 241 transition count 579
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 241 transition count 579
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 20 place count 239 transition count 577
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 239 transition count 577
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 26 place count 237 transition count 575
Applied a total of 26 rules in 27 ms. Remains 237 /250 variables (removed 13) and now considering 575/588 (removed 13) transitions.
// Phase 1: matrix 575 rows 237 cols
[2021-05-07 13:53:23] [INFO ] Computed 25 place invariants in 4 ms
[2021-05-07 13:53:23] [INFO ] Implicit Places using invariants in 142 ms returned []
// Phase 1: matrix 575 rows 237 cols
[2021-05-07 13:53:23] [INFO ] Computed 25 place invariants in 4 ms
[2021-05-07 13:53:23] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 467 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 237/1074 places, 575/1351 transitions.
Stuttering acceptance computed with spot in 26 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:(AND (NEQ s24 0) (NEQ s225 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-02b-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02b-07 finished in 1592 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0&&X(X(F(p1)))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 1074 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1074/1074 places, 1351/1351 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1065 transition count 1335
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1065 transition count 1335
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 1065 transition count 1334
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 25 place count 1059 transition count 1316
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 1059 transition count 1316
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 1054 transition count 1311
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 1054 transition count 1311
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 44 place count 1051 transition count 1301
Iterating global reduction 1 with 3 rules applied. Total rules applied 47 place count 1051 transition count 1301
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 1049 transition count 1299
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 1049 transition count 1299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 1048 transition count 1298
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 1048 transition count 1298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 1047 transition count 1297
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 1047 transition count 1297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 1046 transition count 1296
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 1046 transition count 1296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 1045 transition count 1295
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 1045 transition count 1295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 1044 transition count 1294
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 1044 transition count 1294
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 1043 transition count 1293
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 1043 transition count 1293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 1042 transition count 1292
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 1042 transition count 1292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 1041 transition count 1291
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 1041 transition count 1291
Applied a total of 67 rules in 375 ms. Remains 1041 /1074 variables (removed 33) and now considering 1291/1351 (removed 60) transitions.
// Phase 1: matrix 1291 rows 1041 cols
[2021-05-07 13:53:24] [INFO ] Computed 110 place invariants in 10 ms
[2021-05-07 13:53:24] [INFO ] Implicit Places using invariants in 395 ms returned []
// Phase 1: matrix 1291 rows 1041 cols
[2021-05-07 13:53:24] [INFO ] Computed 110 place invariants in 10 ms
[2021-05-07 13:53:26] [INFO ] Implicit Places using invariants and state equation in 2108 ms returned []
Implicit Place search using SMT with State Equation took 2505 ms to find 0 implicit places.
// Phase 1: matrix 1291 rows 1041 cols
[2021-05-07 13:53:26] [INFO ] Computed 110 place invariants in 11 ms
[2021-05-07 13:53:27] [INFO ] Dead Transitions using invariants and state equation in 617 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1041/1074 places, 1291/1351 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ASLink-PT-02b-12 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={0} source=3 dest: 1}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(NEQ s10 1), p0:(OR (EQ s10 1) (EQ s173 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][false, false, false, false]]
Stuttering criterion allowed to conclude after 156 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 3624 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(p0)&&G((p1&&(!p0 U (F(p1)&&G(p2)))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 1074 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1074/1074 places, 1351/1351 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1067 transition count 1337
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1067 transition count 1337
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 1067 transition count 1336
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 20 place count 1062 transition count 1319
Iterating global reduction 1 with 5 rules applied. Total rules applied 25 place count 1062 transition count 1319
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 1058 transition count 1315
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 1058 transition count 1315
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 1055 transition count 1305
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 1055 transition count 1305
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 1053 transition count 1303
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 1053 transition count 1303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 1052 transition count 1302
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 1052 transition count 1302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 1051 transition count 1301
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 1051 transition count 1301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 1050 transition count 1300
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 1050 transition count 1300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 1049 transition count 1299
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 1049 transition count 1299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 1048 transition count 1298
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 1048 transition count 1298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 1047 transition count 1297
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 1047 transition count 1297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 1046 transition count 1296
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 1046 transition count 1296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 1045 transition count 1295
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 1045 transition count 1295
Applied a total of 59 rules in 361 ms. Remains 1045 /1074 variables (removed 29) and now considering 1295/1351 (removed 56) transitions.
// Phase 1: matrix 1295 rows 1045 cols
[2021-05-07 13:53:27] [INFO ] Computed 110 place invariants in 10 ms
[2021-05-07 13:53:28] [INFO ] Implicit Places using invariants in 397 ms returned []
// Phase 1: matrix 1295 rows 1045 cols
[2021-05-07 13:53:28] [INFO ] Computed 110 place invariants in 11 ms
[2021-05-07 13:53:30] [INFO ] Implicit Places using invariants and state equation in 2165 ms returned []
Implicit Place search using SMT with State Equation took 2563 ms to find 0 implicit places.
// Phase 1: matrix 1295 rows 1045 cols
[2021-05-07 13:53:30] [INFO ] Computed 110 place invariants in 10 ms
[2021-05-07 13:53:31] [INFO ] Dead Transitions using invariants and state equation in 690 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1045/1074 places, 1295/1351 transitions.
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), true, (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : ASLink-PT-02b-13 automaton TGBA [mat=[[{ cond=(OR (NOT p1) (AND (NOT p2) p0)), acceptance={} source=0 dest: 1}, { cond=(OR (AND p1 p2) (AND p1 (NOT p0))), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p1 p2 p0), acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s638 0) (EQ s968 1)), p2:(OR (EQ s90 0) (EQ s669 1)), p0:(AND (NEQ s868 0) (NEQ s925 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-02b-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02b-13 finished in 3730 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((X(F(p0)) U G(p1))&&(X(F(!p1))||F(p2)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 1074 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1074/1074 places, 1351/1351 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1066 transition count 1336
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1066 transition count 1336
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 1060 transition count 1318
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 1060 transition count 1318
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 1055 transition count 1313
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 1055 transition count 1313
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 1052 transition count 1303
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 1052 transition count 1303
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 1050 transition count 1301
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 1050 transition count 1301
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 1049 transition count 1300
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 1049 transition count 1300
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 1048 transition count 1299
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 1048 transition count 1299
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 1047 transition count 1298
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 1047 transition count 1298
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 1046 transition count 1297
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 1046 transition count 1297
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 1045 transition count 1296
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 1045 transition count 1296
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 1044 transition count 1295
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 1044 transition count 1295
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 1043 transition count 1294
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 1043 transition count 1294
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 1042 transition count 1293
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 1042 transition count 1293
Applied a total of 64 rules in 355 ms. Remains 1042 /1074 variables (removed 32) and now considering 1293/1351 (removed 58) transitions.
// Phase 1: matrix 1293 rows 1042 cols
[2021-05-07 13:53:31] [INFO ] Computed 110 place invariants in 10 ms
[2021-05-07 13:53:31] [INFO ] Implicit Places using invariants in 364 ms returned []
// Phase 1: matrix 1293 rows 1042 cols
[2021-05-07 13:53:32] [INFO ] Computed 110 place invariants in 10 ms
[2021-05-07 13:53:33] [INFO ] Implicit Places using invariants and state equation in 1822 ms returned []
Implicit Place search using SMT with State Equation took 2188 ms to find 0 implicit places.
// Phase 1: matrix 1293 rows 1042 cols
[2021-05-07 13:53:33] [INFO ] Computed 110 place invariants in 10 ms
[2021-05-07 13:53:34] [INFO ] Dead Transitions using invariants and state equation in 645 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1042/1074 places, 1293/1351 transitions.
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p0), (NOT p1), (AND p1 (NOT p2))]
Running random walk in product with property : ASLink-PT-02b-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(NEQ s9 1), p2:(OR (EQ s119 0) (EQ s361 1)), p0:(OR (EQ s475 0) (EQ s470 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 397 reset in 223 ms.
Product exploration explored 100000 steps with 409 reset in 236 ms.
Knowledge obtained : [p1, p2, p0]
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p0), (NOT p1), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 387 reset in 221 ms.
Product exploration explored 100000 steps with 412 reset in 227 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p0), (NOT p1), (AND p1 (NOT p2))]
Support contains 5 out of 1042 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1042/1042 places, 1293/1293 transitions.
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 179 rules applied. Total rules applied 179 place count 1042 transition count 1293
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 180 place count 1042 transition count 1292
Performed 228 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 228 Pre rules applied. Total rules applied 180 place count 1042 transition count 1790
Deduced a syphon composed of 407 places in 3 ms
Iterating global reduction 2 with 228 rules applied. Total rules applied 408 place count 1042 transition count 1790
Discarding 78 places :
Symmetric choice reduction at 2 with 78 rule applications. Total rules 486 place count 964 transition count 1684
Deduced a syphon composed of 329 places in 3 ms
Iterating global reduction 2 with 78 rules applied. Total rules applied 564 place count 964 transition count 1684
Performed 141 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 470 places in 2 ms
Iterating global reduction 2 with 141 rules applied. Total rules applied 705 place count 964 transition count 1685
Discarding 78 places :
Symmetric choice reduction at 2 with 78 rule applications. Total rules 783 place count 886 transition count 1603
Deduced a syphon composed of 396 places in 2 ms
Iterating global reduction 2 with 78 rules applied. Total rules applied 861 place count 886 transition count 1603
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 863 place count 884 transition count 1600
Deduced a syphon composed of 396 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 865 place count 884 transition count 1600
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 867 place count 884 transition count 1598
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 411 places in 2 ms
Iterating global reduction 3 with 15 rules applied. Total rules applied 882 place count 884 transition count 1663
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 887 place count 879 transition count 1653
Deduced a syphon composed of 406 places in 2 ms
Iterating global reduction 3 with 5 rules applied. Total rules applied 892 place count 879 transition count 1653
Performed 2(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 408 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 894 place count 879 transition count 1665
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 896 place count 877 transition count 1657
Deduced a syphon composed of 406 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 898 place count 877 transition count 1657
Deduced a syphon composed of 406 places in 1 ms
Applied a total of 898 rules in 237 ms. Remains 877 /1042 variables (removed 165) and now considering 1657/1293 (removed -364) transitions.
[2021-05-07 13:53:36] [INFO ] Redundant transitions in 22 ms returned []
// Phase 1: matrix 1657 rows 877 cols
[2021-05-07 13:53:36] [INFO ] Computed 110 place invariants in 18 ms
[2021-05-07 13:53:37] [INFO ] Dead Transitions using invariants and state equation in 754 ms returned []
Finished structural reductions, in 1 iterations. Remains : 877/1042 places, 1657/1293 transitions.
Product exploration explored 100000 steps with 1409 reset in 437 ms.
Product exploration explored 100000 steps with 1436 reset in 433 ms.
[2021-05-07 13:53:37] [INFO ] Flatten gal took : 39 ms
[2021-05-07 13:53:38] [INFO ] Flatten gal took : 38 ms
[2021-05-07 13:53:38] [INFO ] Time to serialize gal into /tmp/LTL4318047283061032550.gal : 4 ms
[2021-05-07 13:53:38] [INFO ] Time to serialize properties into /tmp/LTL85041270217400064.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/LTL4318047283061032550.gal, -t, CGAL, -LTL, /tmp/LTL85041270217400064.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/LTL4318047283061032550.gal -t CGAL -LTL /tmp/LTL85041270217400064.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(((X(F("((p516==0)||(p511==1))")))U(G("(p9!=1)")))&&((X(F("(p9==1)")))||(F("((p125==0)||(p386==1))"))))))
Formula 0 simplified : !X((XF"((p516==0)||(p511==1))" U G"(p9!=1)") & (XF"(p9==1)" | F"((p125==0)||(p386==1))"))
Detected timeout of ITS tools.
[2021-05-07 13:53:53] [INFO ] Flatten gal took : 38 ms
[2021-05-07 13:53:53] [INFO ] Applying decomposition
[2021-05-07 13:53:53] [INFO ] Flatten gal took : 39 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/graph14453381366350470018.txt, -o, /tmp/graph14453381366350470018.bin, -w, /tmp/graph14453381366350470018.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/graph14453381366350470018.bin, -l, -1, -v, -w, /tmp/graph14453381366350470018.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-07 13:53:53] [INFO ] Decomposing Gal with order
[2021-05-07 13:53:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-07 13:53:53] [INFO ] Removed a total of 1013 redundant transitions.
[2021-05-07 13:53:53] [INFO ] Flatten gal took : 75 ms
[2021-05-07 13:53:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 13 ms.
[2021-05-07 13:53:53] [INFO ] Time to serialize gal into /tmp/LTL929664715253147627.gal : 9 ms
[2021-05-07 13:53:53] [INFO ] Time to serialize properties into /tmp/LTL10083629760940427639.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/LTL929664715253147627.gal, -t, CGAL, -LTL, /tmp/LTL10083629760940427639.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/LTL929664715253147627.gal -t CGAL -LTL /tmp/LTL10083629760940427639.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(((X(F("((i6.u175.p516==0)||(i6.u174.p511==1))")))U(G("(i0.u4.p9!=1)")))&&((X(F("(i0.u4.p9==1)")))||(F("((i7.u39.p125==0)||(i4.i1.i2.u134.p386==1))"))))))
Formula 0 simplified : !X((XF"((i6.u175.p516==0)||(i6.u174.p511==1))" U G"(i0.u4.p9!=1)") & (XF"(i0.u4.p9==1)" | F"((i7.u39.p125==0)||(i4.i1.i2.u134.p386==1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3860180912438631189
[2021-05-07 13:54:08] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3860180912438631189
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/ltsmin3860180912438631189]
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/ltsmin3860180912438631189] 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/ltsmin3860180912438631189] 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 38172 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5342605514859635124
[2021-05-07 13:54:09] [INFO ] Computing symmetric may disable matrix : 1351 transitions.
[2021-05-07 13:54:09] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-07 13:54:09] [INFO ] Computing symmetric may enable matrix : 1351 transitions.
[2021-05-07 13:54:09] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-07 13:54:09] [INFO ] Applying decomposition
[2021-05-07 13:54:09] [INFO ] Flatten gal took : 65 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/graph10359716317636362543.txt, -o, /tmp/graph10359716317636362543.bin, -w, /tmp/graph10359716317636362543.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/graph10359716317636362543.bin, -l, -1, -v, -w, /tmp/graph10359716317636362543.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-07 13:54:09] [INFO ] Decomposing Gal with order
[2021-05-07 13:54:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-07 13:54:09] [INFO ] Computing Do-Not-Accords matrix : 1351 transitions.
[2021-05-07 13:54:09] [INFO ] Computation of Completed DNA matrix. took 54 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-07 13:54:09] [INFO ] Built C files in 336ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5342605514859635124
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/ltsmin5342605514859635124]
[2021-05-07 13:54:09] [INFO ] Removed a total of 1092 redundant transitions.
[2021-05-07 13:54:09] [INFO ] Flatten gal took : 107 ms
[2021-05-07 13:54:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 40 ms.
[2021-05-07 13:54:09] [INFO ] Time to serialize gal into /tmp/LTLCardinality16301095908299658090.gal : 9 ms
[2021-05-07 13:54:09] [INFO ] Time to serialize properties into /tmp/LTLCardinality14083794722358767294.ltl : 13 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/LTLCardinality16301095908299658090.gal, -t, CGAL, -LTL, /tmp/LTLCardinality14083794722358767294.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/LTLCardinality16301095908299658090.gal -t CGAL -LTL /tmp/LTLCardinality14083794722358767294.ltl -c -stutter-deadlock
Read 3 LTL properties
Checking formula 0 : !(((X(("((i20.i1.i0.u350.p1013==0)||(i11.u261.p739==1))")||(G("((i20.i0.i3.u374.p1104==0)||(i7.i1.i1.u71.p228==1))"))))&&(F(("((i19.u403.p1235==0)||(i20.i0.i1.u379.p1130==1))")&&(F("((i20.i1.i0.u350.p1013==0)||(i11.u261.p739==1))"))))))
Formula 0 simplified : !(X("((i20.i1.i0.u350.p1013==0)||(i11.u261.p739==1))" | G"((i20.i0.i3.u374.p1104==0)||(i7.i1.i1.u71.p228==1))") & F("((i19.u403.p1235==0)||(i20.i0.i1.u379.p1130==1))" & F"((i20.i1.i0.u350.p1013==0)||(i11.u261.p739==1))"))
Compilation finished in 11793 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin5342605514859635124]
Link finished in 82 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(([]((LTLAPp1==true))||(LTLAPp0==true)))&&<>(((LTLAPp2==true)&&<>((LTLAPp3==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin5342605514859635124]
LTSmin run took 622 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, -p, --pins-guards, --when, --ltl, [](<>((LTLAPp4==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin5342605514859635124]
LTSmin run took 37853 ms.
FORMULA ASLink-PT-02b-05 FALSE TECHNIQUES PARTIAL_ORDER 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, X(((X(<>((LTLAPp5==true))) U []((LTLAPp6==true)))&&(X(<>(!(LTLAPp6==true)))||<>((LTLAPp7==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin5342605514859635124]
WARNING : LTSmin timed out (>450 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, X(((X(<>((LTLAPp5==true))) U []((LTLAPp6==true)))&&(X(<>(!(LTLAPp6==true)))||<>((LTLAPp7==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin5342605514859635124]
Retrying LTSmin with larger timeout 3600 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, X(((X(<>((LTLAPp5==true))) U []((LTLAPp6==true)))&&(X(<>(!(LTLAPp6==true)))||<>((LTLAPp7==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin5342605514859635124]
Detected timeout of ITS tools.
[2021-05-07 14:14:58] [INFO ] Applying decomposition
[2021-05-07 14:14:58] [INFO ] Flatten gal took : 120 ms
[2021-05-07 14:14:58] [INFO ] Decomposing Gal with order
[2021-05-07 14:14:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-07 14:14:58] [INFO ] Removed a total of 981 redundant transitions.
[2021-05-07 14:14:58] [INFO ] Flatten gal took : 244 ms
[2021-05-07 14:14:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 1347 labels/synchronizations in 88 ms.
[2021-05-07 14:14:59] [INFO ] Time to serialize gal into /tmp/LTLCardinality6324137651967030425.gal : 21 ms
[2021-05-07 14:14:59] [INFO ] Time to serialize properties into /tmp/LTLCardinality12427399303606327111.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/LTLCardinality6324137651967030425.gal, -t, CGAL, -LTL, /tmp/LTLCardinality12427399303606327111.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/LTLCardinality6324137651967030425.gal -t CGAL -LTL /tmp/LTLCardinality12427399303606327111.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(((X(F("(i0.i0.i0.i0.u5.p9==1)")))||(F("((i0.i0.i1.i0.i0.i0.i0.i0.i0.i0.u16.p125==0)||(i0.i0.i1.i0.i0.i0.i0.i0.i1.u44.p386==1))")))&&((X(F("((i0.i1.i0.i0.i0.i0.i0.i0.i0.u63.p516==0)||(i0.i1.i0.i0.i0.i0.i0.i0.i0.u63.p511==1))")))U(G("(i0.i0.i0.i0.u5.p9!=1)"))))))
Formula 0 simplified : !X((XF"(i0.i0.i0.i0.u5.p9==1)" | F"((i0.i0.i1.i0.i0.i0.i0.i0.i0.i0.u16.p125==0)||(i0.i0.i1.i0.i0.i0.i0.i0.i1.u44.p386==1))") & (XF"((i0.i1.i0.i0.i0.i0.i0.i0.i0.u63.p516==0)||(i0.i1.i0.i0.i0.i0.i0.i0.i0.u63.p511==1))" U G"(i0.i0.i0.i0.u5.p9!=1)"))
Detected timeout of ITS tools.
[2021-05-07 14:35:48] [INFO ] Flatten gal took : 104 ms
[2021-05-07 14:35:48] [INFO ] Input system was already deterministic with 1351 transitions.
[2021-05-07 14:35:48] [INFO ] Transformed 1074 places.
[2021-05-07 14:35:48] [INFO ] Transformed 1351 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:36:18] [INFO ] Time to serialize gal into /tmp/LTLCardinality3511791437652643343.gal : 13 ms
[2021-05-07 14:36:18] [INFO ] Time to serialize properties into /tmp/LTLCardinality3373584684938089436.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/LTLCardinality3511791437652643343.gal, -t, CGAL, -LTL, /tmp/LTLCardinality3373584684938089436.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/LTLCardinality3511791437652643343.gal -t CGAL -LTL /tmp/LTLCardinality3373584684938089436.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(((X(F("(p9==1)")))||(F("((p125==0)||(p386==1))")))&&((X(F("((p516==0)||(p511==1))")))U(G("(p9!=1)"))))))
Formula 0 simplified : !X((XF"(p9==1)" | F"((p125==0)||(p386==1))") & (XF"((p516==0)||(p511==1))" U G"(p9!=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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="LTLCardinality"
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 LTLCardinality"
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-162037989400033"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;