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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 912K
-rw-r--r-- 1 mcc users 7.2K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 101K 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.2K Mar 28 15:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 15:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 15:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 23 01:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 01:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 22 09:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 22 09:36 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 597K 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-06a-00
FORMULA_NAME ASLink-PT-06a-01
FORMULA_NAME ASLink-PT-06a-02
FORMULA_NAME ASLink-PT-06a-03
FORMULA_NAME ASLink-PT-06a-04
FORMULA_NAME ASLink-PT-06a-05
FORMULA_NAME ASLink-PT-06a-06
FORMULA_NAME ASLink-PT-06a-07
FORMULA_NAME ASLink-PT-06a-08
FORMULA_NAME ASLink-PT-06a-09
FORMULA_NAME ASLink-PT-06a-10
FORMULA_NAME ASLink-PT-06a-11
FORMULA_NAME ASLink-PT-06a-12
FORMULA_NAME ASLink-PT-06a-13
FORMULA_NAME ASLink-PT-06a-14
FORMULA_NAME ASLink-PT-06a-15

=== Now, execution of the tool begins

BK_START 1620414943111

Running Version 0
[2021-05-07 19:15:44] [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 19:15:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-07 19:15:44] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2021-05-07 19:15:44] [INFO ] Transformed 1406 places.
[2021-05-07 19:15:44] [INFO ] Transformed 2100 transitions.
[2021-05-07 19:15:44] [INFO ] Found NUPN structural information;
[2021-05-07 19:15:44] [INFO ] Parsed PT model containing 1406 places and 2100 transitions in 183 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 19:15:44] [INFO ] Initial state test concluded for 5 properties.
Ensure Unique test removed 22 transitions
Reduce redundant transitions removed 22 transitions.
FORMULA ASLink-PT-06a-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06a-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06a-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06a-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06a-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06a-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 1406 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1406/1406 places, 2078/2078 transitions.
Ensure Unique test removed 24 places
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 1371 transition count 2078
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 46 place count 1360 transition count 2029
Ensure Unique test removed 1 places
Iterating global reduction 1 with 12 rules applied. Total rules applied 58 place count 1359 transition count 2029
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 60 place count 1359 transition count 2027
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 1358 transition count 2019
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 1358 transition count 2019
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 1357 transition count 2011
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 1357 transition count 2011
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 1356 transition count 2003
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 1356 transition count 2003
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 1355 transition count 1995
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 1355 transition count 1995
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 1354 transition count 1987
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 1354 transition count 1987
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 1353 transition count 1979
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 1353 transition count 1979
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 1352 transition count 1971
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 1352 transition count 1971
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 1351 transition count 1963
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 1351 transition count 1963
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 1350 transition count 1955
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 1350 transition count 1955
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 1349 transition count 1947
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 1349 transition count 1947
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 1348 transition count 1939
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 1348 transition count 1939
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 83 place count 1347 transition count 1931
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 1347 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 85 place count 1346 transition count 1923
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 1346 transition count 1923
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 87 place count 1345 transition count 1915
Iterating global reduction 2 with 1 rules applied. Total rules applied 88 place count 1345 transition count 1915
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 89 place count 1344 transition count 1907
Iterating global reduction 2 with 1 rules applied. Total rules applied 90 place count 1344 transition count 1907
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 91 place count 1343 transition count 1899
Iterating global reduction 2 with 1 rules applied. Total rules applied 92 place count 1343 transition count 1899
Applied a total of 92 rules in 1004 ms. Remains 1343 /1406 variables (removed 63) and now considering 1899/2078 (removed 179) transitions.
// Phase 1: matrix 1899 rows 1343 cols
[2021-05-07 19:15:46] [INFO ] Computed 234 place invariants in 182 ms
[2021-05-07 19:15:47] [INFO ] Implicit Places using invariants in 1072 ms returned [1, 19, 20, 23, 33, 51, 69, 198, 214, 219, 220, 221, 239, 257, 386, 408, 409, 410, 428, 446, 575, 591, 596, 597, 598, 616, 634, 764, 779, 784, 785, 786, 804, 822, 952, 968, 972, 973, 974, 992, 1010, 1139, 1144, 1156, 1161, 1162, 1163, 1181, 1183, 1186, 1204, 1205, 1206, 1207, 1224, 1232, 1240, 1246, 1252, 1258, 1264, 1272, 1278, 1284, 1292]
Discarding 65 places :
Implicit Place search using SMT only with invariants took 1102 ms to find 65 implicit places.
// Phase 1: matrix 1899 rows 1278 cols
[2021-05-07 19:15:47] [INFO ] Computed 169 place invariants in 29 ms
[2021-05-07 19:15:48] [INFO ] Dead Transitions using invariants and state equation in 1139 ms returned []
Starting structural reductions, iteration 1 : 1278/1406 places, 1899/2078 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1265 transition count 1886
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1265 transition count 1886
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 35 place count 1256 transition count 1877
Iterating global reduction 0 with 9 rules applied. Total rules applied 44 place count 1256 transition count 1877
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 48 place count 1252 transition count 1873
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 1252 transition count 1873
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 1251 transition count 1872
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 1251 transition count 1872
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 1250 transition count 1871
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 1250 transition count 1871
Applied a total of 56 rules in 196 ms. Remains 1250 /1278 variables (removed 28) and now considering 1871/1899 (removed 28) transitions.
// Phase 1: matrix 1871 rows 1250 cols
[2021-05-07 19:15:48] [INFO ] Computed 169 place invariants in 54 ms
[2021-05-07 19:15:49] [INFO ] Implicit Places using invariants in 622 ms returned []
// Phase 1: matrix 1871 rows 1250 cols
[2021-05-07 19:15:49] [INFO ] Computed 169 place invariants in 20 ms
[2021-05-07 19:15:51] [INFO ] Implicit Places using invariants and state equation in 2222 ms returned []
Implicit Place search using SMT with State Equation took 2848 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1250/1406 places, 1871/2078 transitions.
[2021-05-07 19:15:51] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-07 19:15:51] [INFO ] Flatten gal took : 275 ms
FORMULA ASLink-PT-06a-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06a-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06a-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-07 19:15:51] [INFO ] Flatten gal took : 119 ms
[2021-05-07 19:15:52] [INFO ] Input system was already deterministic with 1871 transitions.
Incomplete random walk after 100000 steps, including 558 resets, run finished after 585 ms. (steps per millisecond=170 ) properties (out of 12) seen :7
Running SMT prover for 5 properties.
// Phase 1: matrix 1871 rows 1250 cols
[2021-05-07 19:15:52] [INFO ] Computed 169 place invariants in 19 ms
[2021-05-07 19:15:52] [INFO ] [Real]Absence check using 44 positive place invariants in 20 ms returned sat
[2021-05-07 19:15:53] [INFO ] [Real]Absence check using 44 positive and 125 generalized place invariants in 27 ms returned sat
[2021-05-07 19:15:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:15:53] [INFO ] [Real]Absence check using state equation in 621 ms returned sat
[2021-05-07 19:15:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:15:54] [INFO ] [Nat]Absence check using 44 positive place invariants in 19 ms returned sat
[2021-05-07 19:15:54] [INFO ] [Nat]Absence check using 44 positive and 125 generalized place invariants in 8 ms returned unsat
[2021-05-07 19:15:54] [INFO ] [Real]Absence check using 44 positive place invariants in 18 ms returned sat
[2021-05-07 19:15:54] [INFO ] [Real]Absence check using 44 positive and 125 generalized place invariants in 26 ms returned sat
[2021-05-07 19:15:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:15:54] [INFO ] [Real]Absence check using state equation in 480 ms returned sat
[2021-05-07 19:15:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:15:55] [INFO ] [Nat]Absence check using 44 positive place invariants in 18 ms returned unsat
[2021-05-07 19:15:55] [INFO ] [Real]Absence check using 44 positive place invariants in 20 ms returned sat
[2021-05-07 19:15:55] [INFO ] [Real]Absence check using 44 positive and 125 generalized place invariants in 29 ms returned sat
[2021-05-07 19:15:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:15:56] [INFO ] [Real]Absence check using state equation in 946 ms returned sat
[2021-05-07 19:15:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:15:56] [INFO ] [Nat]Absence check using 44 positive place invariants in 20 ms returned sat
[2021-05-07 19:15:56] [INFO ] [Nat]Absence check using 44 positive and 125 generalized place invariants in 26 ms returned sat
[2021-05-07 19:15:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:15:57] [INFO ] [Nat]Absence check using state equation in 819 ms returned sat
[2021-05-07 19:15:57] [INFO ] Computed and/alt/rep : 845/2060/845 causal constraints (skipped 1025 transitions) in 177 ms.
[2021-05-07 19:16:04] [INFO ] Added : 378 causal constraints over 76 iterations in 7179 ms. Result :sat
[2021-05-07 19:16:04] [INFO ] [Real]Absence check using 44 positive place invariants in 48 ms returned sat
[2021-05-07 19:16:04] [INFO ] [Real]Absence check using 44 positive and 125 generalized place invariants in 28 ms returned sat
[2021-05-07 19:16:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:16:05] [INFO ] [Real]Absence check using state equation in 659 ms returned sat
[2021-05-07 19:16:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:16:05] [INFO ] [Nat]Absence check using 44 positive place invariants in 20 ms returned sat
[2021-05-07 19:16:05] [INFO ] [Nat]Absence check using 44 positive and 125 generalized place invariants in 28 ms returned sat
[2021-05-07 19:16:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:16:06] [INFO ] [Nat]Absence check using state equation in 777 ms returned sat
[2021-05-07 19:16:06] [INFO ] Computed and/alt/rep : 845/2060/845 causal constraints (skipped 1025 transitions) in 129 ms.
[2021-05-07 19:16:15] [INFO ] Added : 450 causal constraints over 90 iterations in 8440 ms. Result :sat
[2021-05-07 19:16:15] [INFO ] [Real]Absence check using 44 positive place invariants in 34 ms returned sat
[2021-05-07 19:16:15] [INFO ] [Real]Absence check using 44 positive and 125 generalized place invariants in 48 ms returned sat
[2021-05-07 19:16:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:16:15] [INFO ] [Real]Absence check using state equation in 694 ms returned sat
[2021-05-07 19:16:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:16:16] [INFO ] [Nat]Absence check using 44 positive place invariants in 19 ms returned sat
[2021-05-07 19:16:16] [INFO ] [Nat]Absence check using 44 positive and 125 generalized place invariants in 26 ms returned sat
[2021-05-07 19:16:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:16:17] [INFO ] [Nat]Absence check using state equation in 894 ms returned sat
[2021-05-07 19:16:17] [INFO ] Computed and/alt/rep : 845/2060/845 causal constraints (skipped 1025 transitions) in 117 ms.
[2021-05-07 19:16:30] [INFO ] Added : 718 causal constraints over 144 iterations in 13772 ms. Result :sat
Successfully simplified 2 atomic propositions for a total of 7 simplifications.
[2021-05-07 19:16:30] [INFO ] Initial state test concluded for 1 properties.
FORMULA ASLink-PT-06a-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06a-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 3 out of 1250 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1250/1250 places, 1871/1871 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 242 transitions
Trivial Post-agglo rules discarded 242 transitions
Performed 242 trivial Post agglomeration. Transition count delta: 242
Iterating post reduction 0 with 242 rules applied. Total rules applied 242 place count 1249 transition count 1628
Reduce places removed 248 places and 0 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 254 rules applied. Total rules applied 496 place count 1001 transition count 1622
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 503 place count 995 transition count 1621
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 504 place count 994 transition count 1621
Performed 177 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 177 Pre rules applied. Total rules applied 504 place count 994 transition count 1444
Deduced a syphon composed of 177 places in 1 ms
Ensure Unique test removed 54 places
Reduce places removed 231 places and 0 transitions.
Iterating global reduction 4 with 408 rules applied. Total rules applied 912 place count 763 transition count 1444
Discarding 16 places :
Implicit places reduction removed 16 places
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 4 with 37 rules applied. Total rules applied 949 place count 747 transition count 1423
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 5 with 21 rules applied. Total rules applied 970 place count 726 transition count 1423
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 25 Pre rules applied. Total rules applied 970 place count 726 transition count 1398
Deduced a syphon composed of 25 places in 2 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 6 with 50 rules applied. Total rules applied 1020 place count 701 transition count 1398
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 1031 place count 690 transition count 1387
Iterating global reduction 6 with 11 rules applied. Total rules applied 1042 place count 690 transition count 1387
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 6 with 10 rules applied. Total rules applied 1052 place count 690 transition count 1377
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1053 place count 689 transition count 1377
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1053 place count 689 transition count 1376
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1055 place count 688 transition count 1376
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1056 place count 687 transition count 1375
Iterating global reduction 8 with 1 rules applied. Total rules applied 1057 place count 687 transition count 1375
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 4 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 8 with 124 rules applied. Total rules applied 1181 place count 625 transition count 1313
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1182 place count 624 transition count 1312
Iterating global reduction 8 with 1 rules applied. Total rules applied 1183 place count 624 transition count 1312
Applied a total of 1183 rules in 338 ms. Remains 624 /1250 variables (removed 626) and now considering 1312/1871 (removed 559) transitions.
// Phase 1: matrix 1312 rows 624 cols
[2021-05-07 19:16:31] [INFO ] Computed 93 place invariants in 14 ms
[2021-05-07 19:16:31] [INFO ] Implicit Places using invariants in 425 ms returned [72, 90, 96, 101, 160, 178, 184, 189, 194, 204, 256, 273, 279, 284, 286, 346, 363, 369, 374, 376, 436, 453, 459, 464, 466, 526, 543, 549, 554, 556, 621]
Discarding 31 places :
Implicit Place search using SMT only with invariants took 429 ms to find 31 implicit places.
[2021-05-07 19:16:31] [INFO ] Redundant transitions in 97 ms returned []
// Phase 1: matrix 1312 rows 593 cols
[2021-05-07 19:16:31] [INFO ] Computed 62 place invariants in 13 ms
[2021-05-07 19:16:32] [INFO ] Dead Transitions using invariants and state equation in 573 ms returned []
Starting structural reductions, iteration 1 : 593/1250 places, 1312/1871 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 593 transition count 1311
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 592 transition count 1311
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 14 place count 580 transition count 1299
Iterating global reduction 2 with 12 rules applied. Total rules applied 26 place count 580 transition count 1299
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 38 place count 568 transition count 1287
Iterating global reduction 2 with 12 rules applied. Total rules applied 50 place count 568 transition count 1287
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 56 place count 562 transition count 1281
Iterating global reduction 2 with 6 rules applied. Total rules applied 62 place count 562 transition count 1281
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 3 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 88 place count 549 transition count 1268
Applied a total of 88 rules in 90 ms. Remains 549 /593 variables (removed 44) and now considering 1268/1312 (removed 44) transitions.
// Phase 1: matrix 1268 rows 549 cols
[2021-05-07 19:16:32] [INFO ] Computed 62 place invariants in 12 ms
[2021-05-07 19:16:32] [INFO ] Implicit Places using invariants in 329 ms returned []
// Phase 1: matrix 1268 rows 549 cols
[2021-05-07 19:16:32] [INFO ] Computed 62 place invariants in 11 ms
[2021-05-07 19:16:33] [INFO ] Implicit Places using invariants and state equation in 1013 ms returned []
Implicit Place search using SMT with State Equation took 1343 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 549/1250 places, 1268/1871 transitions.
Stuttering acceptance computed with spot in 143 ms :[true, (NOT p0)]
Running random walk in product with property : ASLink-PT-06a-00 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s544 1) (EQ s179 0) (EQ s78 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 2 ms.
FORMULA ASLink-PT-06a-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-06a-00 finished in 3070 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 1250 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1250/1250 places, 1871/1871 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1249 transition count 1871
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 3 place count 1247 transition count 1869
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 1247 transition count 1869
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 1246 transition count 1868
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 1246 transition count 1868
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 1245 transition count 1867
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 1245 transition count 1867
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 1244 transition count 1866
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 1244 transition count 1866
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 1243 transition count 1865
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 1243 transition count 1865
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 1242 transition count 1864
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 1242 transition count 1864
Applied a total of 15 rules in 202 ms. Remains 1242 /1250 variables (removed 8) and now considering 1864/1871 (removed 7) transitions.
// Phase 1: matrix 1864 rows 1242 cols
[2021-05-07 19:16:34] [INFO ] Computed 168 place invariants in 17 ms
[2021-05-07 19:16:34] [INFO ] Implicit Places using invariants in 545 ms returned [387]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 548 ms to find 1 implicit places.
// Phase 1: matrix 1864 rows 1241 cols
[2021-05-07 19:16:34] [INFO ] Computed 167 place invariants in 17 ms
[2021-05-07 19:16:35] [INFO ] Dead Transitions using invariants and state equation in 838 ms returned []
Starting structural reductions, iteration 1 : 1241/1250 places, 1864/1871 transitions.
Applied a total of 0 rules in 28 ms. Remains 1241 /1241 variables (removed 0) and now considering 1864/1864 (removed 0) transitions.
// Phase 1: matrix 1864 rows 1241 cols
[2021-05-07 19:16:35] [INFO ] Computed 167 place invariants in 17 ms
[2021-05-07 19:16:36] [INFO ] Dead Transitions using invariants and state equation in 891 ms returned []
Finished structural reductions, in 2 iterations. Remains : 1241/1250 places, 1864/1871 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-06a-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s147 0) (EQ s607 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][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1106 ms.
Product exploration explored 100000 steps with 33333 reset in 986 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 33333 reset in 1057 ms.
Product exploration explored 100000 steps with 33333 reset in 1061 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1241 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1241/1241 places, 1864/1864 transitions.
Performed 243 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 243 rules applied. Total rules applied 243 place count 1241 transition count 1864
Performed 92 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 92 Pre rules applied. Total rules applied 243 place count 1241 transition count 1930
Deduced a syphon composed of 335 places in 2 ms
Iterating global reduction 1 with 92 rules applied. Total rules applied 335 place count 1241 transition count 1930
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 371 place count 1205 transition count 1894
Deduced a syphon composed of 301 places in 1 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 407 place count 1205 transition count 1894
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 407 place count 1205 transition count 1894
Deduced a syphon composed of 302 places in 2 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 408 place count 1205 transition count 1894
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 409 place count 1204 transition count 1893
Deduced a syphon composed of 301 places in 2 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 410 place count 1204 transition count 1893
Performed 157 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 458 places in 2 ms
Iterating global reduction 1 with 157 rules applied. Total rules applied 567 place count 1204 transition count 1914
Discarding 80 places :
Symmetric choice reduction at 1 with 80 rule applications. Total rules 647 place count 1124 transition count 1834
Deduced a syphon composed of 378 places in 2 ms
Iterating global reduction 1 with 80 rules applied. Total rules applied 727 place count 1124 transition count 1834
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 384 places in 2 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 733 place count 1124 transition count 1858
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 385 places in 2 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 734 place count 1124 transition count 1862
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 736 place count 1122 transition count 1856
Deduced a syphon composed of 383 places in 2 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 738 place count 1122 transition count 1856
Deduced a syphon composed of 383 places in 1 ms
Applied a total of 738 rules in 624 ms. Remains 1122 /1241 variables (removed 119) and now considering 1856/1864 (removed 8) transitions.
[2021-05-07 19:16:41] [INFO ] Redundant transitions in 41 ms returned []
// Phase 1: matrix 1856 rows 1122 cols
[2021-05-07 19:16:41] [INFO ] Computed 167 place invariants in 19 ms
[2021-05-07 19:16:42] [INFO ] Dead Transitions using invariants and state equation in 965 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1122/1241 places, 1856/1864 transitions.
Product exploration explored 100000 steps with 33333 reset in 4630 ms.
Product exploration explored 100000 steps with 33333 reset in 4523 ms.
[2021-05-07 19:16:52] [INFO ] Flatten gal took : 165 ms
[2021-05-07 19:16:52] [INFO ] Flatten gal took : 84 ms
[2021-05-07 19:16:52] [INFO ] Time to serialize gal into /tmp/LTL12190648256139112088.gal : 40 ms
[2021-05-07 19:16:52] [INFO ] Time to serialize properties into /tmp/LTL2749797415651697365.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/LTL12190648256139112088.gal, -t, CGAL, -LTL, /tmp/LTL2749797415651697365.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/LTL12190648256139112088.gal -t CGAL -LTL /tmp/LTL2749797415651697365.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(F("((p159==0)||(p658==1))")))))
Formula 0 simplified : !XXF"((p159==0)||(p658==1))"
Detected timeout of ITS tools.
[2021-05-07 19:17:07] [INFO ] Flatten gal took : 99 ms
[2021-05-07 19:17:07] [INFO ] Applying decomposition
[2021-05-07 19:17:07] [INFO ] Flatten gal took : 105 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/graph13449501851345121814.txt, -o, /tmp/graph13449501851345121814.bin, -w, /tmp/graph13449501851345121814.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/graph13449501851345121814.bin, -l, -1, -v, -w, /tmp/graph13449501851345121814.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-07 19:17:07] [INFO ] Decomposing Gal with order
[2021-05-07 19:17:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-07 19:17:08] [INFO ] Removed a total of 2519 redundant transitions.
[2021-05-07 19:17:08] [INFO ] Flatten gal took : 203 ms
[2021-05-07 19:17:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 47 ms.
[2021-05-07 19:17:08] [INFO ] Time to serialize gal into /tmp/LTL4455805777545550018.gal : 16 ms
[2021-05-07 19:17:08] [INFO ] Time to serialize properties into /tmp/LTL14691514889736791293.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/LTL4455805777545550018.gal, -t, CGAL, -LTL, /tmp/LTL14691514889736791293.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/LTL4455805777545550018.gal -t CGAL -LTL /tmp/LTL14691514889736791293.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(F("((i1.u24.p159==0)||(i5.u183.p658==1))")))))
Formula 0 simplified : !XXF"((i1.u24.p159==0)||(i5.u183.p658==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9665217921489721064
[2021-05-07 19:17:23] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9665217921489721064
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/ltsmin9665217921489721064]
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/ltsmin9665217921489721064] 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/ltsmin9665217921489721064] 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-06a-09 finished in 50407 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((X(X(G(p0)))&&G((p1||G(p2))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 1250 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1250/1250 places, 1871/1871 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1249 transition count 1871
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 3 place count 1247 transition count 1869
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 1247 transition count 1869
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 1246 transition count 1868
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 1246 transition count 1868
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 1245 transition count 1867
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 1245 transition count 1867
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 1244 transition count 1866
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 1244 transition count 1866
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 1243 transition count 1865
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 1243 transition count 1865
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 1242 transition count 1864
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 1242 transition count 1864
Applied a total of 15 rules in 305 ms. Remains 1242 /1250 variables (removed 8) and now considering 1864/1871 (removed 7) transitions.
// Phase 1: matrix 1864 rows 1242 cols
[2021-05-07 19:17:24] [INFO ] Computed 168 place invariants in 35 ms
[2021-05-07 19:17:25] [INFO ] Implicit Places using invariants in 541 ms returned []
// Phase 1: matrix 1864 rows 1242 cols
[2021-05-07 19:17:25] [INFO ] Computed 168 place invariants in 23 ms
[2021-05-07 19:17:27] [INFO ] Implicit Places using invariants and state equation in 2235 ms returned []
Implicit Place search using SMT with State Equation took 2777 ms to find 0 implicit places.
// Phase 1: matrix 1864 rows 1242 cols
[2021-05-07 19:17:27] [INFO ] Computed 168 place invariants in 24 ms
[2021-05-07 19:17:28] [INFO ] Dead Transitions using invariants and state equation in 920 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1242/1250 places, 1864/1871 transitions.
Stuttering acceptance computed with spot in 500 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : ASLink-PT-06a-10 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=0 dest: 0}, { cond=(OR p1 p2), acceptance={0, 1, 2} source=0 dest: 1}, { cond=(OR p1 p2), acceptance={0, 2} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={1, 2} source=0 dest: 3}], [{ cond=(OR p1 p2), acceptance={0, 1, 2} source=1 dest: 4}, { cond=(OR p1 p2), acceptance={0, 2} source=1 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={1, 2} source=1 dest: 6}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=1 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=2 dest: 0}, { cond=(OR p1 p2), acceptance={0, 2} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={1, 2} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=3 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0, 1, 2} source=3 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0, 2} source=3 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={1, 2} source=3 dest: 3}, { cond=(AND p1 p2), acceptance={1, 2} source=3 dest: 8}, { cond=(AND p1 p2), acceptance={2} source=3 dest: 9}], [{ cond=(OR (AND p1 (NOT p0)) (AND p2 (NOT p0))), acceptance={0, 1, 2} source=4 dest: 4}, { cond=(OR (AND p1 p0) (AND p2 p0)), acceptance={0, 1} source=4 dest: 4}, { cond=(OR (AND p1 (NOT p0)) (AND p2 (NOT p0))), acceptance={0, 2} source=4 dest: 5}, { cond=(OR (AND p1 p0) (AND p2 p0)), acceptance={0} source=4 dest: 5}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={1, 2} source=4 dest: 6}, { cond=(AND (NOT p1) p2 p0), acceptance={1} source=4 dest: 6}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=4 dest: 7}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=4 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=5 dest: 0}, { cond=(OR (AND p1 (NOT p0)) (AND p2 (NOT p0))), acceptance={0, 2} source=5 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={1, 2} source=5 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=6 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=6 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 2} source=6 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={1, 2} source=6 dest: 3}, { cond=(AND p1 (NOT p2) p0), acceptance={0, 1} source=6 dest: 4}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p1) p2 p0), acceptance={1} source=6 dest: 6}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=6 dest: 7}, { cond=(AND p1 p2 (NOT p0)), acceptance={1, 2} source=6 dest: 8}, { cond=(AND p1 p2 (NOT p0)), acceptance={2} source=6 dest: 9}, { cond=(AND p1 p2 p0), acceptance={1} source=6 dest: 10}, { cond=(AND p1 p2 p0), acceptance={} source=6 dest: 11}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=7 dest: 0}, { cond=(OR (AND p1 (NOT p0)) (AND p2 (NOT p0))), acceptance={0, 1, 2} source=7 dest: 1}, { cond=(OR (AND p1 (NOT p0)) (AND p2 (NOT p0))), acceptance={0, 2} source=7 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={1, 2} source=7 dest: 3}, { cond=(OR (AND p1 p0) (AND p2 p0)), acceptance={0, 1} source=7 dest: 4}, { cond=(OR (AND p1 p0) (AND p2 p0)), acceptance={0} source=7 dest: 5}, { cond=(AND (NOT p1) p2 p0), acceptance={1} source=7 dest: 6}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=7 dest: 7}], [{ cond=(AND p1 (NOT p2)), acceptance={0, 1, 2} source=8 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0, 2} source=8 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={1, 2} source=8 dest: 6}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=8 dest: 7}, { cond=(AND p1 p2), acceptance={1, 2} source=8 dest: 10}, { cond=(AND p1 p2), acceptance={2} source=8 dest: 11}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=9 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0, 2} source=9 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={1, 2} source=9 dest: 3}, { cond=(AND p1 p2), acceptance={2} source=9 dest: 9}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=10 dest: 4}, { cond=(AND p1 (NOT p2) p0), acceptance={0, 1} source=10 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 2} source=10 dest: 5}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=10 dest: 5}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={1, 2} source=10 dest: 6}, { cond=(AND (NOT p1) p2 p0), acceptance={1} source=10 dest: 6}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=10 dest: 7}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=10 dest: 7}, { cond=(AND p1 p2 (NOT p0)), acceptance={1, 2} source=10 dest: 10}, { cond=(AND p1 p2 p0), acceptance={1} source=10 dest: 10}, { cond=(AND p1 p2 (NOT p0)), acceptance={2} source=10 dest: 11}, { cond=(AND p1 p2 p0), acceptance={} source=10 dest: 11}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=11 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 2} source=11 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={1, 2} source=11 dest: 3}, { cond=(AND p1 p2 (NOT p0)), acceptance={2} source=11 dest: 9}]], initial=0, aps=[p1:(AND (NEQ s757 0) (NEQ s470 1)), p2:(AND (NEQ s387 0) (NEQ s188 1)), p0:(OR (EQ s58 0) (EQ s216 1))], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 655 reset in 440 ms.
Product exploration explored 100000 steps with 697 reset in 565 ms.
Knowledge obtained : [(NOT p1), (NOT p2), p0]
Stuttering acceptance computed with spot in 423 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 719 reset in 384 ms.
Product exploration explored 100000 steps with 705 reset in 413 ms.
Applying partial POR strategy [true, true, true, true, true, true, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 389 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Support contains 6 out of 1242 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1242/1242 places, 1864/1864 transitions.
Performed 240 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 240 rules applied. Total rules applied 240 place count 1242 transition count 1864
Performed 92 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 92 Pre rules applied. Total rules applied 240 place count 1242 transition count 1930
Deduced a syphon composed of 332 places in 2 ms
Iterating global reduction 1 with 92 rules applied. Total rules applied 332 place count 1242 transition count 1930
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 366 place count 1208 transition count 1896
Deduced a syphon composed of 300 places in 2 ms
Iterating global reduction 1 with 34 rules applied. Total rules applied 400 place count 1208 transition count 1896
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 400 place count 1208 transition count 1896
Deduced a syphon composed of 301 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 401 place count 1208 transition count 1896
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 402 place count 1207 transition count 1895
Deduced a syphon composed of 300 places in 2 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 403 place count 1207 transition count 1895
Performed 156 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 456 places in 1 ms
Iterating global reduction 1 with 156 rules applied. Total rules applied 559 place count 1207 transition count 1916
Discarding 78 places :
Symmetric choice reduction at 1 with 78 rule applications. Total rules 637 place count 1129 transition count 1838
Deduced a syphon composed of 378 places in 1 ms
Iterating global reduction 1 with 78 rules applied. Total rules applied 715 place count 1129 transition count 1838
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 383 places in 2 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 720 place count 1129 transition count 1858
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 384 places in 2 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 721 place count 1129 transition count 1862
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 723 place count 1127 transition count 1856
Deduced a syphon composed of 382 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 725 place count 1127 transition count 1856
Deduced a syphon composed of 382 places in 2 ms
Applied a total of 725 rules in 317 ms. Remains 1127 /1242 variables (removed 115) and now considering 1856/1864 (removed 8) transitions.
[2021-05-07 19:17:32] [INFO ] Redundant transitions in 36 ms returned []
// Phase 1: matrix 1856 rows 1127 cols
[2021-05-07 19:17:32] [INFO ] Computed 168 place invariants in 18 ms
[2021-05-07 19:17:33] [INFO ] Dead Transitions using invariants and state equation in 889 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1127/1242 places, 1856/1864 transitions.
Product exploration explored 100000 steps with 1394 reset in 493 ms.
Product exploration explored 100000 steps with 1488 reset in 506 ms.
[2021-05-07 19:17:34] [INFO ] Flatten gal took : 67 ms
[2021-05-07 19:17:34] [INFO ] Flatten gal took : 67 ms
[2021-05-07 19:17:34] [INFO ] Time to serialize gal into /tmp/LTL18377072847044074104.gal : 9 ms
[2021-05-07 19:17:34] [INFO ] Time to serialize properties into /tmp/LTL5671011397450733467.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/LTL18377072847044074104.gal, -t, CGAL, -LTL, /tmp/LTL5671011397450733467.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/LTL18377072847044074104.gal -t CGAL -LTL /tmp/LTL5671011397450733467.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((X(X(G("((p67==0)||(p237==1))"))))&&(G(("((p819!=0)&&(p508!=1))")||(G("((p417!=0)&&(p201!=1))")))))))
Formula 0 simplified : !F(XXG"((p67==0)||(p237==1))" & G("((p819!=0)&&(p508!=1))" | G"((p417!=0)&&(p201!=1))"))
Detected timeout of ITS tools.
[2021-05-07 19:17:49] [INFO ] Flatten gal took : 63 ms
[2021-05-07 19:17:49] [INFO ] Applying decomposition
[2021-05-07 19:17:49] [INFO ] Flatten gal took : 66 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/graph6407281278205622574.txt, -o, /tmp/graph6407281278205622574.bin, -w, /tmp/graph6407281278205622574.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/graph6407281278205622574.bin, -l, -1, -v, -w, /tmp/graph6407281278205622574.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-07 19:17:49] [INFO ] Decomposing Gal with order
[2021-05-07 19:17:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-07 19:17:49] [INFO ] Removed a total of 2520 redundant transitions.
[2021-05-07 19:17:49] [INFO ] Flatten gal took : 123 ms
[2021-05-07 19:17:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 25 labels/synchronizations in 27 ms.
[2021-05-07 19:17:49] [INFO ] Time to serialize gal into /tmp/LTL11043660907940673178.gal : 10 ms
[2021-05-07 19:17:49] [INFO ] Time to serialize properties into /tmp/LTL14519670582155933556.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/LTL11043660907940673178.gal, -t, CGAL, -LTL, /tmp/LTL14519670582155933556.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/LTL11043660907940673178.gal -t CGAL -LTL /tmp/LTL14519670582155933556.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F((X(X(G("((i1.u63.p67==0)||(i5.u69.p237==1))"))))&&(G(("((i13.u230.p819!=0)&&(i6.u146.p508!=1))")||(G("((i2.i1.i0.u120.p417!=0)&&(i0.u62.p201!=1))")))))))
Formula 0 simplified : !F(XXG"((i1.u63.p67==0)||(i5.u69.p237==1))" & G("((i13.u230.p819!=0)&&(i6.u146.p508!=1))" | G"((i2.i1.i0.u120.p417!=0)&&(i0.u62.p201!=1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17411069184459127172
[2021-05-07 19:18:04] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17411069184459127172
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/ltsmin17411069184459127172]
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/ltsmin17411069184459127172] 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/ltsmin17411069184459127172] 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-06a-10 finished in 41505 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((G(p1)||p0))))], workingDir=/home/mcc/execution]
Support contains 7 out of 1250 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1250/1250 places, 1871/1871 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1249 transition count 1871
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 3 place count 1247 transition count 1869
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 1247 transition count 1869
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 1246 transition count 1868
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 1246 transition count 1868
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 1245 transition count 1867
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 1245 transition count 1867
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 1244 transition count 1866
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 1244 transition count 1866
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 1243 transition count 1865
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 1243 transition count 1865
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 1242 transition count 1864
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 1242 transition count 1864
Applied a total of 15 rules in 284 ms. Remains 1242 /1250 variables (removed 8) and now considering 1864/1871 (removed 7) transitions.
// Phase 1: matrix 1864 rows 1242 cols
[2021-05-07 19:18:06] [INFO ] Computed 168 place invariants in 31 ms
[2021-05-07 19:18:06] [INFO ] Implicit Places using invariants in 517 ms returned [387]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 522 ms to find 1 implicit places.
// Phase 1: matrix 1864 rows 1241 cols
[2021-05-07 19:18:06] [INFO ] Computed 167 place invariants in 16 ms
[2021-05-07 19:18:07] [INFO ] Dead Transitions using invariants and state equation in 843 ms returned []
Starting structural reductions, iteration 1 : 1241/1250 places, 1864/1871 transitions.
Applied a total of 0 rules in 35 ms. Remains 1241 /1241 variables (removed 0) and now considering 1864/1864 (removed 0) transitions.
// Phase 1: matrix 1864 rows 1241 cols
[2021-05-07 19:18:07] [INFO ] Computed 167 place invariants in 16 ms
[2021-05-07 19:18:08] [INFO ] Dead Transitions using invariants and state equation in 841 ms returned []
Finished structural reductions, in 2 iterations. Remains : 1241/1250 places, 1864/1871 transitions.
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), true]
Running random walk in product with property : ASLink-PT-06a-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (NEQ s1030 0) (NEQ s927 1) (EQ s400 1)), p0:(OR (EQ s79 0) (EQ s613 1) (EQ s309 0) (EQ s623 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 566 reset in 315 ms.
Product exploration explored 100000 steps with 539 reset in 323 ms.
Knowledge obtained : [(NOT p1), p0]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), true]
Product exploration explored 100000 steps with 545 reset in 314 ms.
Product exploration explored 100000 steps with 552 reset in 349 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), true]
Support contains 7 out of 1241 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1241/1241 places, 1864/1864 transitions.
Performed 241 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 241 rules applied. Total rules applied 241 place count 1241 transition count 1864
Performed 92 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 92 Pre rules applied. Total rules applied 241 place count 1241 transition count 1930
Deduced a syphon composed of 333 places in 2 ms
Iterating global reduction 1 with 92 rules applied. Total rules applied 333 place count 1241 transition count 1930
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 369 place count 1205 transition count 1894
Deduced a syphon composed of 299 places in 2 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 405 place count 1205 transition count 1894
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 405 place count 1205 transition count 1894
Deduced a syphon composed of 300 places in 2 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 406 place count 1205 transition count 1894
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 407 place count 1204 transition count 1893
Deduced a syphon composed of 299 places in 2 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 408 place count 1204 transition count 1893
Performed 155 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 454 places in 2 ms
Iterating global reduction 1 with 155 rules applied. Total rules applied 563 place count 1204 transition count 1914
Discarding 78 places :
Symmetric choice reduction at 1 with 78 rule applications. Total rules 641 place count 1126 transition count 1836
Deduced a syphon composed of 376 places in 2 ms
Iterating global reduction 1 with 78 rules applied. Total rules applied 719 place count 1126 transition count 1836
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 380 places in 2 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 723 place count 1126 transition count 1852
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 381 places in 2 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 724 place count 1126 transition count 1856
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 726 place count 1124 transition count 1850
Deduced a syphon composed of 379 places in 2 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 728 place count 1124 transition count 1850
Deduced a syphon composed of 379 places in 2 ms
Applied a total of 728 rules in 332 ms. Remains 1124 /1241 variables (removed 117) and now considering 1850/1864 (removed 14) transitions.
[2021-05-07 19:18:10] [INFO ] Redundant transitions in 35 ms returned []
// Phase 1: matrix 1850 rows 1124 cols
[2021-05-07 19:18:10] [INFO ] Computed 167 place invariants in 19 ms
[2021-05-07 19:18:11] [INFO ] Dead Transitions using invariants and state equation in 915 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1124/1241 places, 1850/1864 transitions.
Product exploration explored 100000 steps with 1106 reset in 508 ms.
Product exploration explored 100000 steps with 1123 reset in 536 ms.
[2021-05-07 19:18:12] [INFO ] Flatten gal took : 61 ms
[2021-05-07 19:18:12] [INFO ] Flatten gal took : 62 ms
[2021-05-07 19:18:12] [INFO ] Time to serialize gal into /tmp/LTL10161005758547910905.gal : 7 ms
[2021-05-07 19:18:12] [INFO ] Time to serialize properties into /tmp/LTL3376961660132391149.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/LTL10161005758547910905.gal, -t, CGAL, -LTL, /tmp/LTL3376961660132391149.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/LTL10161005758547910905.gal -t CGAL -LTL /tmp/LTL3376961660132391149.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(G(("((((p89==0)||(p664==1))||(p334==0))||(p674==1))")||(G("(((p1111!=0)&&(p997!=1))&&(p435==1))"))))))
Formula 0 simplified : !XG("((((p89==0)||(p664==1))||(p334==0))||(p674==1))" | G"(((p1111!=0)&&(p997!=1))&&(p435==1))")
Detected timeout of ITS tools.
[2021-05-07 19:18:27] [INFO ] Flatten gal took : 60 ms
[2021-05-07 19:18:27] [INFO ] Applying decomposition
[2021-05-07 19:18:27] [INFO ] Flatten gal took : 64 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/graph6255268901693806049.txt, -o, /tmp/graph6255268901693806049.bin, -w, /tmp/graph6255268901693806049.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/graph6255268901693806049.bin, -l, -1, -v, -w, /tmp/graph6255268901693806049.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-07 19:18:28] [INFO ] Decomposing Gal with order
[2021-05-07 19:18:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-07 19:18:28] [INFO ] Removed a total of 2504 redundant transitions.
[2021-05-07 19:18:28] [INFO ] Flatten gal took : 115 ms
[2021-05-07 19:18:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 15 ms.
[2021-05-07 19:18:28] [INFO ] Time to serialize gal into /tmp/LTL6293472241081860092.gal : 15 ms
[2021-05-07 19:18:28] [INFO ] Time to serialize properties into /tmp/LTL12089213284816093180.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/LTL6293472241081860092.gal, -t, CGAL, -LTL, /tmp/LTL12089213284816093180.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/LTL6293472241081860092.gal -t CGAL -LTL /tmp/LTL12089213284816093180.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(G(("((((i0.i0.u23.p89==0)||(i6.u184.p664==1))||(i4.i0.u95.p334==0))||(i8.i4.u188.p674==1))")||(G("(((i16.i1.u298.p1111!=0)&&(i13.i3.u278.p997!=1))&&(i6.u123.p435==1))"))))))
Formula 0 simplified : !XG("((((i0.i0.u23.p89==0)||(i6.u184.p664==1))||(i4.i0.u95.p334==0))||(i8.i4.u188.p674==1))" | G"(((i16.i1.u298.p1111!=0)&&(i13.i3.u278.p997!=1))&&(i6.u123.p435==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8099742758665905001
[2021-05-07 19:18:43] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8099742758665905001
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/ltsmin8099742758665905001]
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/ltsmin8099742758665905001] 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/ltsmin8099742758665905001] 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-06a-13 finished in 38380 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F((G(p1)||p0)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 1250 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1250/1250 places, 1871/1871 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1249 transition count 1871
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 3 place count 1247 transition count 1869
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 1247 transition count 1869
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 1246 transition count 1868
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 1246 transition count 1868
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 1245 transition count 1867
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 1245 transition count 1867
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 1244 transition count 1866
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 1244 transition count 1866
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 1243 transition count 1865
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 1243 transition count 1865
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 1242 transition count 1864
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 1242 transition count 1864
Applied a total of 15 rules in 256 ms. Remains 1242 /1250 variables (removed 8) and now considering 1864/1871 (removed 7) transitions.
// Phase 1: matrix 1864 rows 1242 cols
[2021-05-07 19:18:44] [INFO ] Computed 168 place invariants in 75 ms
[2021-05-07 19:18:45] [INFO ] Implicit Places using invariants in 595 ms returned [387]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 625 ms to find 1 implicit places.
// Phase 1: matrix 1864 rows 1241 cols
[2021-05-07 19:18:45] [INFO ] Computed 167 place invariants in 16 ms
[2021-05-07 19:18:46] [INFO ] Dead Transitions using invariants and state equation in 1334 ms returned []
Starting structural reductions, iteration 1 : 1241/1250 places, 1864/1871 transitions.
Applied a total of 0 rules in 44 ms. Remains 1241 /1241 variables (removed 0) and now considering 1864/1864 (removed 0) transitions.
// Phase 1: matrix 1864 rows 1241 cols
[2021-05-07 19:18:46] [INFO ] Computed 167 place invariants in 17 ms
[2021-05-07 19:18:47] [INFO ] Dead Transitions using invariants and state equation in 882 ms returned []
Finished structural reductions, in 2 iterations. Remains : 1241/1250 places, 1864/1871 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ASLink-PT-06a-14 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(OR (EQ s384 0) (EQ s590 1)), p0:(OR (EQ s619 0) (EQ s103 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1083 ms.
Product exploration explored 100000 steps with 33333 reset in 1078 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 33333 reset in 1064 ms.
Product exploration explored 100000 steps with 33333 reset in 1091 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 1241 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1241/1241 places, 1864/1864 transitions.
Performed 243 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 243 rules applied. Total rules applied 243 place count 1241 transition count 1864
Performed 92 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 92 Pre rules applied. Total rules applied 243 place count 1241 transition count 1931
Deduced a syphon composed of 335 places in 2 ms
Iterating global reduction 1 with 92 rules applied. Total rules applied 335 place count 1241 transition count 1931
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 370 place count 1206 transition count 1896
Deduced a syphon composed of 302 places in 2 ms
Iterating global reduction 1 with 35 rules applied. Total rules applied 405 place count 1206 transition count 1896
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 405 place count 1206 transition count 1896
Deduced a syphon composed of 303 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 406 place count 1206 transition count 1896
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 407 place count 1205 transition count 1895
Deduced a syphon composed of 302 places in 2 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 408 place count 1205 transition count 1895
Performed 155 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 457 places in 2 ms
Iterating global reduction 1 with 155 rules applied. Total rules applied 563 place count 1205 transition count 1916
Discarding 80 places :
Symmetric choice reduction at 1 with 80 rule applications. Total rules 643 place count 1125 transition count 1836
Deduced a syphon composed of 377 places in 2 ms
Iterating global reduction 1 with 80 rules applied. Total rules applied 723 place count 1125 transition count 1836
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 383 places in 2 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 729 place count 1125 transition count 1860
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 384 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 730 place count 1125 transition count 1864
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 732 place count 1123 transition count 1858
Deduced a syphon composed of 382 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 734 place count 1123 transition count 1858
Deduced a syphon composed of 382 places in 1 ms
Applied a total of 734 rules in 311 ms. Remains 1123 /1241 variables (removed 118) and now considering 1858/1864 (removed 6) transitions.
[2021-05-07 19:18:52] [INFO ] Redundant transitions in 35 ms returned []
// Phase 1: matrix 1858 rows 1123 cols
[2021-05-07 19:18:52] [INFO ] Computed 167 place invariants in 18 ms
[2021-05-07 19:18:53] [INFO ] Dead Transitions using invariants and state equation in 800 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1123/1241 places, 1858/1864 transitions.
Product exploration explored 100000 steps with 33333 reset in 4668 ms.
Product exploration explored 100000 steps with 33333 reset in 4630 ms.
[2021-05-07 19:19:02] [INFO ] Flatten gal took : 84 ms
[2021-05-07 19:19:02] [INFO ] Flatten gal took : 62 ms
[2021-05-07 19:19:02] [INFO ] Time to serialize gal into /tmp/LTL15677239073616827218.gal : 7 ms
[2021-05-07 19:19:02] [INFO ] Time to serialize properties into /tmp/LTL11479729543535261060.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/LTL15677239073616827218.gal, -t, CGAL, -LTL, /tmp/LTL11479729543535261060.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/LTL15677239073616827218.gal -t CGAL -LTL /tmp/LTL11479729543535261060.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(F(("((p670==0)||(p115==1))")||(G("((p413==0)||(p640==1))")))))))
Formula 0 simplified : !XXF("((p670==0)||(p115==1))" | G"((p413==0)||(p640==1))")
Detected timeout of ITS tools.
[2021-05-07 19:19:17] [INFO ] Flatten gal took : 60 ms
[2021-05-07 19:19:17] [INFO ] Applying decomposition
[2021-05-07 19:19:18] [INFO ] Flatten gal took : 60 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/graph5862997106830549646.txt, -o, /tmp/graph5862997106830549646.bin, -w, /tmp/graph5862997106830549646.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/graph5862997106830549646.bin, -l, -1, -v, -w, /tmp/graph5862997106830549646.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-07 19:19:18] [INFO ] Decomposing Gal with order
[2021-05-07 19:19:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-07 19:19:18] [INFO ] Removed a total of 2537 redundant transitions.
[2021-05-07 19:19:18] [INFO ] Flatten gal took : 101 ms
[2021-05-07 19:19:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 10 ms.
[2021-05-07 19:19:18] [INFO ] Time to serialize gal into /tmp/LTL16495249315003965911.gal : 10 ms
[2021-05-07 19:19:18] [INFO ] Time to serialize properties into /tmp/LTL16000695694738502825.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/LTL16495249315003965911.gal, -t, CGAL, -LTL, /tmp/LTL16000695694738502825.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/LTL16495249315003965911.gal -t CGAL -LTL /tmp/LTL16000695694738502825.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(F(("((i8.u189.p670==0)||(i2.i1.i0.u36.p115==1))")||(G("((i3.u118.p413==0)||(i9.u228.p640==1))")))))))
Formula 0 simplified : !XXF("((i8.u189.p670==0)||(i2.i1.i0.u36.p115==1))" | G"((i3.u118.p413==0)||(i9.u228.p640==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11895885192397855592
[2021-05-07 19:19:33] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11895885192397855592
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/ltsmin11895885192397855592]
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/ltsmin11895885192397855592] 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/ltsmin11895885192397855592] 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-06a-14 finished in 50114 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6191200147572680709
[2021-05-07 19:19:34] [INFO ] Too many transitions (1871) to apply POR reductions. Disabling POR matrices.
[2021-05-07 19:19:34] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6191200147572680709
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/ltsmin6191200147572680709]
[2021-05-07 19:19:34] [INFO ] Applying decomposition
[2021-05-07 19:19:34] [INFO ] Flatten gal took : 57 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/graph11453132019417771878.txt, -o, /tmp/graph11453132019417771878.bin, -w, /tmp/graph11453132019417771878.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/graph11453132019417771878.bin, -l, -1, -v, -w, /tmp/graph11453132019417771878.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-07 19:19:34] [INFO ] Decomposing Gal with order
[2021-05-07 19:19:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-07 19:19:35] [INFO ] Removed a total of 2520 redundant transitions.
[2021-05-07 19:19:35] [INFO ] Flatten gal took : 154 ms
[2021-05-07 19:19:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 10 ms.
[2021-05-07 19:19:35] [INFO ] Time to serialize gal into /tmp/LTLCardinality9756829645600487141.gal : 13 ms
[2021-05-07 19:19:35] [INFO ] Time to serialize properties into /tmp/LTLCardinality3447127221026341599.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/LTLCardinality9756829645600487141.gal, -t, CGAL, -LTL, /tmp/LTLCardinality3447127221026341599.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/LTLCardinality9756829645600487141.gal -t CGAL -LTL /tmp/LTLCardinality3447127221026341599.ltl -c -stutter-deadlock
Read 4 LTL properties
Checking formula 0 : !((X(X(F("((i1.i1.i0.u28.p159==0)||(i8.u183.p658==1))")))))
Formula 0 simplified : !XXF"((i1.i1.i0.u28.p159==0)||(i8.u183.p658==1))"
Compilation finished in 14616 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin6191200147572680709]
Link finished in 66 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X(<>((LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin6191200147572680709]
LTSmin run took 840 ms.
FORMULA ASLink-PT-06a-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, <>((X(X([]((LTLAPp1==true))))&&[](((LTLAPp2==true)||[]((LTLAPp3==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin6191200147572680709]
WARNING : LTSmin timed out (>514 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([]((LTLAPp1==true))))&&[](((LTLAPp2==true)||[]((LTLAPp3==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin6191200147572680709]
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([](([]((LTLAPp5==true))||(LTLAPp4==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin6191200147572680709]
WARNING : LTSmin timed out (>514 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([](([]((LTLAPp5==true))||(LTLAPp4==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin6191200147572680709]
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(<>(([]((LTLAPp7==true))||(LTLAPp6==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin6191200147572680709]
LTSmin run took 517 ms.
FORMULA ASLink-PT-06a-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 4112 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([]((LTLAPp1==true))))&&[](((LTLAPp2==true)||[]((LTLAPp3==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin6191200147572680709]
Detected timeout of ITS tools.
[2021-05-07 19:40:51] [INFO ] Applying decomposition
[2021-05-07 19:40:51] [INFO ] Flatten gal took : 189 ms
[2021-05-07 19:40:51] [INFO ] Decomposing Gal with order
[2021-05-07 19:40:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-07 19:40:52] [INFO ] Removed a total of 2097 redundant transitions.
[2021-05-07 19:40:52] [INFO ] Flatten gal took : 341 ms
[2021-05-07 19:40:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 792 labels/synchronizations in 115 ms.
[2021-05-07 19:40:52] [INFO ] Time to serialize gal into /tmp/LTLCardinality12342251356796646170.gal : 40 ms
[2021-05-07 19:40:52] [INFO ] Time to serialize properties into /tmp/LTLCardinality11311009777473661582.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/LTLCardinality12342251356796646170.gal, -t, CGAL, -LTL, /tmp/LTLCardinality11311009777473661582.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/LTLCardinality12342251356796646170.gal -t CGAL -LTL /tmp/LTLCardinality11311009777473661582.ltl -c -stutter-deadlock
Read 2 LTL properties
Checking formula 0 : !((F((X(X(G("((u5.p67==0)||(u39.p237==1))"))))&&(G((!("((u144.p819==0)||(i21.i1.u82.p508==1))"))||(G(!("((u71.p417==0)||(i5.u31.p201==1))"))))))))
Formula 0 simplified : !F(XXG"((u5.p67==0)||(u39.p237==1))" & G(!"((u144.p819==0)||(i21.i1.u82.p508==1))" | G!"((u71.p417==0)||(i5.u31.p201==1))"))
Detected timeout of ITS tools.
[2021-05-07 20:02:09] [INFO ] Flatten gal took : 210 ms
[2021-05-07 20:02:09] [INFO ] Input system was already deterministic with 1871 transitions.
[2021-05-07 20:02:09] [INFO ] Transformed 1250 places.
[2021-05-07 20:02:09] [INFO ] Transformed 1871 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 20:02:39] [INFO ] Time to serialize gal into /tmp/LTLCardinality2349367110967081193.gal : 6 ms
[2021-05-07 20:02:39] [INFO ] Time to serialize properties into /tmp/LTLCardinality11855536824526865589.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/LTLCardinality2349367110967081193.gal, -t, CGAL, -LTL, /tmp/LTLCardinality11855536824526865589.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/LTLCardinality2349367110967081193.gal -t CGAL -LTL /tmp/LTLCardinality11855536824526865589.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F((X(X(G("((p67==0)||(p237==1))"))))&&(G((!("((p819==0)||(p508==1))"))||(G(!("((p417==0)||(p201==1))"))))))))
Formula 0 simplified : !F(XXG"((p67==0)||(p237==1))" & G(!"((p819==0)||(p508==1))" | G!"((p417==0)||(p201==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-06a"
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-06a, 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-162037989500089"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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