About the Execution of ITS-Tools for ASLink-PT-06a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
8980.155 | 3600000.00 | 13935152.00 | 228.60 | FFTFTF?FFFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2022-input.r006-tajo-165245688800092.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-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 LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-tajo-165245688800092
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 840K
-rw-r--r-- 1 mcc users 7.0K Apr 30 07:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 30 07:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 30 07:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 30 07:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 07:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 07:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 597K May 10 09:33 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-LTLFireability-00
FORMULA_NAME ASLink-PT-06a-LTLFireability-01
FORMULA_NAME ASLink-PT-06a-LTLFireability-02
FORMULA_NAME ASLink-PT-06a-LTLFireability-03
FORMULA_NAME ASLink-PT-06a-LTLFireability-04
FORMULA_NAME ASLink-PT-06a-LTLFireability-05
FORMULA_NAME ASLink-PT-06a-LTLFireability-06
FORMULA_NAME ASLink-PT-06a-LTLFireability-07
FORMULA_NAME ASLink-PT-06a-LTLFireability-08
FORMULA_NAME ASLink-PT-06a-LTLFireability-09
FORMULA_NAME ASLink-PT-06a-LTLFireability-10
FORMULA_NAME ASLink-PT-06a-LTLFireability-11
FORMULA_NAME ASLink-PT-06a-LTLFireability-12
FORMULA_NAME ASLink-PT-06a-LTLFireability-13
FORMULA_NAME ASLink-PT-06a-LTLFireability-14
FORMULA_NAME ASLink-PT-06a-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652648556233
Running Version 202205111006
[2022-05-15 21:02:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 21:02:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 21:02:37] [INFO ] Load time of PNML (sax parser for PT used): 208 ms
[2022-05-15 21:02:37] [INFO ] Transformed 1406 places.
[2022-05-15 21:02:37] [INFO ] Transformed 2100 transitions.
[2022-05-15 21:02:37] [INFO ] Found NUPN structural information;
[2022-05-15 21:02:37] [INFO ] Parsed PT model containing 1406 places and 2100 transitions in 322 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 31 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 22 transitions
Reduce redundant transitions removed 22 transitions.
FORMULA ASLink-PT-06a-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06a-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06a-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 56 out of 1406 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1406/1406 places, 2078/2078 transitions.
Ensure Unique test removed 24 places
Discarding 12 places :
Implicit places reduction removed 12 places
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 1370 transition count 2078
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 45 place count 1361 transition count 2041
Ensure Unique test removed 1 places
Iterating global reduction 1 with 10 rules applied. Total rules applied 55 place count 1360 transition count 2041
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 57 place count 1360 transition count 2039
Applied a total of 57 rules in 225 ms. Remains 1360 /1406 variables (removed 46) and now considering 2039/2078 (removed 39) transitions.
// Phase 1: matrix 2039 rows 1360 cols
[2022-05-15 21:02:38] [INFO ] Computed 233 place invariants in 122 ms
[2022-05-15 21:02:39] [INFO ] Implicit Places using invariants in 1322 ms returned [1, 19, 20, 23, 33, 51, 69, 198, 214, 219, 220, 240, 258, 387, 403, 408, 409, 410, 428, 446, 575, 591, 596, 597, 635, 764, 780, 785, 786, 787, 805, 823, 952, 968, 973, 974, 975, 993, 1011, 1140, 1145, 1157, 1162, 1163, 1198, 1200, 1203, 1221, 1222, 1223, 1224, 1241, 1249, 1257, 1263, 1269, 1275, 1281, 1289, 1295, 1301, 1309]
Discarding 62 places :
Implicit Place search using SMT only with invariants took 1350 ms to find 62 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1298/1406 places, 2039/2078 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1285 transition count 2026
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1285 transition count 2026
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 1275 transition count 2016
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 1275 transition count 2016
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 1270 transition count 2011
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 1270 transition count 2011
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 1268 transition count 2009
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 1268 transition count 2009
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 1266 transition count 2007
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 1266 transition count 2007
Applied a total of 64 rules in 573 ms. Remains 1266 /1298 variables (removed 32) and now considering 2007/2039 (removed 32) transitions.
// Phase 1: matrix 2007 rows 1266 cols
[2022-05-15 21:02:40] [INFO ] Computed 171 place invariants in 142 ms
[2022-05-15 21:02:41] [INFO ] Implicit Places using invariants in 851 ms returned []
// Phase 1: matrix 2007 rows 1266 cols
[2022-05-15 21:02:41] [INFO ] Computed 171 place invariants in 41 ms
[2022-05-15 21:02:43] [INFO ] Implicit Places using invariants and state equation in 2836 ms returned []
Implicit Place search using SMT with State Equation took 3690 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1266/1406 places, 2007/2078 transitions.
Finished structural reductions, in 2 iterations. Remains : 1266/1406 places, 2007/2078 transitions.
Support contains 56 out of 1266 places after structural reductions.
[2022-05-15 21:02:44] [INFO ] Flatten gal took : 216 ms
[2022-05-15 21:02:44] [INFO ] Flatten gal took : 140 ms
[2022-05-15 21:02:44] [INFO ] Input system was already deterministic with 2007 transitions.
Incomplete random walk after 10000 steps, including 55 resets, run finished after 555 ms. (steps per millisecond=18 ) properties (out of 31) seen :9
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 22) seen :0
Running SMT prover for 22 properties.
// Phase 1: matrix 2007 rows 1266 cols
[2022-05-15 21:02:45] [INFO ] Computed 171 place invariants in 12 ms
[2022-05-15 21:02:46] [INFO ] [Real]Absence check using 36 positive place invariants in 14 ms returned sat
[2022-05-15 21:02:46] [INFO ] [Real]Absence check using 36 positive and 135 generalized place invariants in 34 ms returned sat
[2022-05-15 21:02:49] [INFO ] After 3661ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:20
[2022-05-15 21:02:49] [INFO ] [Nat]Absence check using 36 positive place invariants in 22 ms returned sat
[2022-05-15 21:02:50] [INFO ] [Nat]Absence check using 36 positive and 135 generalized place invariants in 64 ms returned sat
[2022-05-15 21:03:14] [INFO ] After 23953ms SMT Verify possible using state equation in natural domain returned unsat :13 sat :6
[2022-05-15 21:03:14] [INFO ] After 23960ms SMT Verify possible using trap constraints in natural domain returned unsat :13 sat :6
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-15 21:03:14] [INFO ] After 25047ms SMT Verify possible using all constraints in natural domain returned unsat :13 sat :6
Fused 22 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 225 ms.
Support contains 17 out of 1266 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1266/1266 places, 2007/2007 transitions.
Drop transitions removed 212 transitions
Trivial Post-agglo rules discarded 212 transitions
Performed 212 trivial Post agglomeration. Transition count delta: 212
Iterating post reduction 0 with 212 rules applied. Total rules applied 212 place count 1266 transition count 1795
Reduce places removed 212 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 213 rules applied. Total rules applied 425 place count 1054 transition count 1794
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 426 place count 1053 transition count 1794
Performed 166 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 166 Pre rules applied. Total rules applied 426 place count 1053 transition count 1628
Deduced a syphon composed of 166 places in 20 ms
Ensure Unique test removed 53 places
Reduce places removed 219 places and 0 transitions.
Iterating global reduction 3 with 385 rules applied. Total rules applied 811 place count 834 transition count 1628
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 9 rules applied. Total rules applied 820 place count 826 transition count 1627
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 821 place count 825 transition count 1627
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 24 Pre rules applied. Total rules applied 821 place count 825 transition count 1603
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 869 place count 801 transition count 1603
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 877 place count 793 transition count 1585
Iterating global reduction 5 with 8 rules applied. Total rules applied 885 place count 793 transition count 1585
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 888 place count 791 transition count 1584
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 889 place count 790 transition count 1584
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 889 place count 790 transition count 1583
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 891 place count 789 transition count 1583
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 895 place count 785 transition count 1579
Iterating global reduction 7 with 4 rules applied. Total rules applied 899 place count 785 transition count 1579
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 902 place count 782 transition count 1576
Iterating global reduction 7 with 3 rules applied. Total rules applied 905 place count 782 transition count 1576
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 908 place count 782 transition count 1573
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 3 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 8 with 132 rules applied. Total rules applied 1040 place count 716 transition count 1507
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1043 place count 713 transition count 1504
Iterating global reduction 8 with 3 rules applied. Total rules applied 1046 place count 713 transition count 1504
Free-agglomeration rule applied 8 times.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1054 place count 713 transition count 1496
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 1062 place count 705 transition count 1496
Free-agglomeration rule (complex) applied 25 times.
Iterating global reduction 9 with 25 rules applied. Total rules applied 1087 place count 705 transition count 1471
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 9 with 25 rules applied. Total rules applied 1112 place count 680 transition count 1471
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 1115 place count 680 transition count 1468
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1116 place count 680 transition count 1467
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1117 place count 679 transition count 1467
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 11 with 20 rules applied. Total rules applied 1137 place count 679 transition count 1467
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 1139 place count 679 transition count 1467
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1140 place count 679 transition count 1466
Applied a total of 1140 rules in 1064 ms. Remains 679 /1266 variables (removed 587) and now considering 1466/2007 (removed 541) transitions.
Finished structural reductions, in 1 iterations. Remains : 679/1266 places, 1466/2007 transitions.
Incomplete random walk after 10000 steps, including 138 resets, run finished after 454 ms. (steps per millisecond=22 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 35 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1466 rows 679 cols
[2022-05-15 21:03:16] [INFO ] Computed 108 place invariants in 16 ms
[2022-05-15 21:03:16] [INFO ] [Real]Absence check using 25 positive place invariants in 7 ms returned sat
[2022-05-15 21:03:16] [INFO ] [Real]Absence check using 25 positive and 83 generalized place invariants in 33 ms returned sat
[2022-05-15 21:03:17] [INFO ] After 988ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-15 21:03:17] [INFO ] [Nat]Absence check using 25 positive place invariants in 6 ms returned sat
[2022-05-15 21:03:17] [INFO ] [Nat]Absence check using 25 positive and 83 generalized place invariants in 21 ms returned sat
[2022-05-15 21:03:29] [INFO ] After 11761ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :1
[2022-05-15 21:03:29] [INFO ] State equation strengthened by 28 read => feed constraints.
[2022-05-15 21:03:29] [INFO ] After 104ms SMT Verify possible using 28 Read/Feed constraints in natural domain returned unsat :3 sat :1
[2022-05-15 21:03:29] [INFO ] After 227ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :1
Attempting to minimize the solution found.
Minimization took 67 ms.
[2022-05-15 21:03:29] [INFO ] After 12264ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :1
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 679 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 679/679 places, 1466/1466 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 679 transition count 1465
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 678 transition count 1465
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 677 transition count 1457
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 677 transition count 1457
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 675 transition count 1455
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 675 transition count 1454
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 10 place count 674 transition count 1454
Applied a total of 10 rules in 119 ms. Remains 674 /679 variables (removed 5) and now considering 1454/1466 (removed 12) transitions.
Finished structural reductions, in 1 iterations. Remains : 674/679 places, 1454/1466 transitions.
Incomplete random walk after 10000 steps, including 142 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 363610 steps, run timeout after 3001 ms. (steps per millisecond=121 ) properties seen :{1=1}
Probabilistic random walk after 363610 steps, saw 98845 distinct states, run finished after 3001 ms. (steps per millisecond=121 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 1454 rows 674 cols
[2022-05-15 21:03:33] [INFO ] Computed 108 place invariants in 36 ms
[2022-05-15 21:03:33] [INFO ] [Real]Absence check using 25 positive place invariants in 8 ms returned sat
[2022-05-15 21:03:33] [INFO ] [Real]Absence check using 25 positive and 83 generalized place invariants in 41 ms returned sat
[2022-05-15 21:03:34] [INFO ] After 778ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 21:03:34] [INFO ] [Nat]Absence check using 25 positive place invariants in 8 ms returned sat
[2022-05-15 21:03:34] [INFO ] [Nat]Absence check using 25 positive and 83 generalized place invariants in 29 ms returned sat
[2022-05-15 21:03:37] [INFO ] After 3667ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 17 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 3 formulas.
FORMULA ASLink-PT-06a-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06a-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06a-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06a-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06a-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06a-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06a-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06a-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X((X(G((X(F(p0))&&p1)))&&p1)))))'
Support contains 3 out of 1266 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1266/1266 places, 2007/2007 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 216 transitions
Trivial Post-agglo rules discarded 216 transitions
Performed 216 trivial Post agglomeration. Transition count delta: 216
Iterating post reduction 0 with 216 rules applied. Total rules applied 216 place count 1265 transition count 1790
Reduce places removed 222 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 226 rules applied. Total rules applied 442 place count 1043 transition count 1786
Reduce places removed 4 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 7 rules applied. Total rules applied 449 place count 1039 transition count 1783
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 452 place count 1036 transition count 1783
Performed 180 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 180 Pre rules applied. Total rules applied 452 place count 1036 transition count 1603
Deduced a syphon composed of 180 places in 1 ms
Ensure Unique test removed 52 places
Reduce places removed 232 places and 0 transitions.
Iterating global reduction 4 with 412 rules applied. Total rules applied 864 place count 804 transition count 1603
Discarding 15 places :
Implicit places reduction removed 15 places
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 4 with 28 rules applied. Total rules applied 892 place count 789 transition count 1590
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 905 place count 776 transition count 1590
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 24 Pre rules applied. Total rules applied 905 place count 776 transition count 1566
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 6 with 48 rules applied. Total rules applied 953 place count 752 transition count 1566
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 967 place count 738 transition count 1535
Iterating global reduction 6 with 14 rules applied. Total rules applied 981 place count 738 transition count 1535
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 6 with 8 rules applied. Total rules applied 989 place count 736 transition count 1529
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 989 place count 736 transition count 1527
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 993 place count 734 transition count 1527
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 997 place count 730 transition count 1516
Iterating global reduction 7 with 4 rules applied. Total rules applied 1001 place count 730 transition count 1516
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1005 place count 726 transition count 1505
Iterating global reduction 7 with 4 rules applied. Total rules applied 1009 place count 726 transition count 1505
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1012 place count 726 transition count 1502
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1013 place count 725 transition count 1494
Iterating global reduction 8 with 1 rules applied. Total rules applied 1014 place count 725 transition count 1494
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1015 place count 724 transition count 1486
Iterating global reduction 8 with 1 rules applied. Total rules applied 1016 place count 724 transition count 1486
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1017 place count 723 transition count 1478
Iterating global reduction 8 with 1 rules applied. Total rules applied 1018 place count 723 transition count 1478
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1019 place count 722 transition count 1470
Iterating global reduction 8 with 1 rules applied. Total rules applied 1020 place count 722 transition count 1470
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1021 place count 721 transition count 1462
Iterating global reduction 8 with 1 rules applied. Total rules applied 1022 place count 721 transition count 1462
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1023 place count 720 transition count 1454
Iterating global reduction 8 with 1 rules applied. Total rules applied 1024 place count 720 transition count 1454
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1025 place count 719 transition count 1446
Iterating global reduction 8 with 1 rules applied. Total rules applied 1026 place count 719 transition count 1446
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1027 place count 718 transition count 1438
Iterating global reduction 8 with 1 rules applied. Total rules applied 1028 place count 718 transition count 1438
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1029 place count 717 transition count 1430
Iterating global reduction 8 with 1 rules applied. Total rules applied 1030 place count 717 transition count 1430
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1031 place count 716 transition count 1422
Iterating global reduction 8 with 1 rules applied. Total rules applied 1032 place count 716 transition count 1422
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1033 place count 715 transition count 1414
Iterating global reduction 8 with 1 rules applied. Total rules applied 1034 place count 715 transition count 1414
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1035 place count 714 transition count 1406
Iterating global reduction 8 with 1 rules applied. Total rules applied 1036 place count 714 transition count 1406
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1037 place count 713 transition count 1398
Iterating global reduction 8 with 1 rules applied. Total rules applied 1038 place count 713 transition count 1398
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 2 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 8 with 128 rules applied. Total rules applied 1166 place count 649 transition count 1334
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1168 place count 647 transition count 1332
Iterating global reduction 8 with 2 rules applied. Total rules applied 1170 place count 647 transition count 1332
Applied a total of 1170 rules in 474 ms. Remains 647 /1266 variables (removed 619) and now considering 1332/2007 (removed 675) transitions.
// Phase 1: matrix 1332 rows 647 cols
[2022-05-15 21:03:38] [INFO ] Computed 96 place invariants in 10 ms
[2022-05-15 21:03:39] [INFO ] Implicit Places using invariants in 680 ms returned [72, 89, 95, 100, 108, 161, 182, 189, 196, 198, 258, 275, 281, 286, 288, 297, 315, 351, 376, 384, 390, 392, 452, 469, 475, 480, 482, 542, 559, 565, 570, 572, 584, 643]
Discarding 34 places :
Implicit Place search using SMT only with invariants took 683 ms to find 34 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 613/1266 places, 1332/2007 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 613 transition count 1314
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 595 transition count 1314
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 47 place count 584 transition count 1303
Iterating global reduction 2 with 11 rules applied. Total rules applied 58 place count 584 transition count 1303
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 69 place count 573 transition count 1292
Iterating global reduction 2 with 11 rules applied. Total rules applied 80 place count 573 transition count 1292
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 85 place count 568 transition count 1287
Iterating global reduction 2 with 5 rules applied. Total rules applied 90 place count 568 transition count 1287
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 126 place count 550 transition count 1269
Applied a total of 126 rules in 72 ms. Remains 550 /613 variables (removed 63) and now considering 1269/1332 (removed 63) transitions.
// Phase 1: matrix 1269 rows 550 cols
[2022-05-15 21:03:39] [INFO ] Computed 62 place invariants in 11 ms
[2022-05-15 21:03:39] [INFO ] Implicit Places using invariants in 273 ms returned []
// Phase 1: matrix 1269 rows 550 cols
[2022-05-15 21:03:39] [INFO ] Computed 62 place invariants in 8 ms
[2022-05-15 21:03:40] [INFO ] Implicit Places using invariants and state equation in 753 ms returned []
Implicit Place search using SMT with State Equation took 1028 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 550/1266 places, 1269/2007 transitions.
Finished structural reductions, in 2 iterations. Remains : 550/1266 places, 1269/2007 transitions.
Stuttering acceptance computed with spot in 235 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ASLink-PT-06a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s514 0) (EQ s545 0)), p0:(EQ s168 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1512 reset in 341 ms.
Product exploration explored 100000 steps with 1590 reset in 303 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND p1 (NOT p0)))), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 4 factoid took 212 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 81 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Finished random walk after 7388 steps, including 97 resets, run visited all 3 properties in 32 ms. (steps per millisecond=230 )
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND p1 (NOT p0)))), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (NOT p1)), (F (NOT p0)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 4 factoid took 218 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Support contains 3 out of 550 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 550/550 places, 1269/1269 transitions.
Applied a total of 0 rules in 18 ms. Remains 550 /550 variables (removed 0) and now considering 1269/1269 (removed 0) transitions.
// Phase 1: matrix 1269 rows 550 cols
[2022-05-15 21:03:42] [INFO ] Computed 62 place invariants in 7 ms
[2022-05-15 21:03:42] [INFO ] Implicit Places using invariants in 425 ms returned []
// Phase 1: matrix 1269 rows 550 cols
[2022-05-15 21:03:42] [INFO ] Computed 62 place invariants in 8 ms
[2022-05-15 21:03:43] [INFO ] Implicit Places using invariants and state equation in 841 ms returned []
Implicit Place search using SMT with State Equation took 1285 ms to find 0 implicit places.
[2022-05-15 21:03:43] [INFO ] Redundant transitions in 64 ms returned []
// Phase 1: matrix 1269 rows 550 cols
[2022-05-15 21:03:43] [INFO ] Computed 62 place invariants in 7 ms
[2022-05-15 21:03:43] [INFO ] Dead Transitions using invariants and state equation in 431 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 550/550 places, 1269/1269 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND (NOT p0) p1))), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 4 factoid took 250 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 76 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Finished random walk after 989 steps, including 13 resets, run visited all 3 properties in 4 ms. (steps per millisecond=247 )
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND (NOT p0) p1))), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (NOT p1)), (F (NOT p0)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 4 factoid took 199 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 1676 reset in 266 ms.
Product exploration explored 100000 steps with 1602 reset in 303 ms.
Built C files in :
/tmp/ltsmin14814746897178663957
[2022-05-15 21:03:45] [INFO ] Computing symmetric may disable matrix : 1269 transitions.
[2022-05-15 21:03:45] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 21:03:45] [INFO ] Computing symmetric may enable matrix : 1269 transitions.
[2022-05-15 21:03:45] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 21:03:45] [INFO ] Computing Do-Not-Accords matrix : 1269 transitions.
[2022-05-15 21:03:45] [INFO ] Computation of Completed DNA matrix. took 52 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 21:03:45] [INFO ] Built C files in 421ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14814746897178663957
Running compilation step : cd /tmp/ltsmin14814746897178663957;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14814746897178663957;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14814746897178663957;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 3 out of 550 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 550/550 places, 1269/1269 transitions.
Applied a total of 0 rules in 30 ms. Remains 550 /550 variables (removed 0) and now considering 1269/1269 (removed 0) transitions.
// Phase 1: matrix 1269 rows 550 cols
[2022-05-15 21:03:48] [INFO ] Computed 62 place invariants in 7 ms
[2022-05-15 21:03:49] [INFO ] Implicit Places using invariants in 468 ms returned []
// Phase 1: matrix 1269 rows 550 cols
[2022-05-15 21:03:49] [INFO ] Computed 62 place invariants in 12 ms
[2022-05-15 21:03:50] [INFO ] Implicit Places using invariants and state equation in 893 ms returned []
Implicit Place search using SMT with State Equation took 1365 ms to find 0 implicit places.
[2022-05-15 21:03:50] [INFO ] Redundant transitions in 183 ms returned []
// Phase 1: matrix 1269 rows 550 cols
[2022-05-15 21:03:50] [INFO ] Computed 62 place invariants in 8 ms
[2022-05-15 21:03:50] [INFO ] Dead Transitions using invariants and state equation in 472 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 550/550 places, 1269/1269 transitions.
Built C files in :
/tmp/ltsmin14526294653273133933
[2022-05-15 21:03:50] [INFO ] Computing symmetric may disable matrix : 1269 transitions.
[2022-05-15 21:03:50] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 21:03:50] [INFO ] Computing symmetric may enable matrix : 1269 transitions.
[2022-05-15 21:03:50] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 21:03:51] [INFO ] Computing Do-Not-Accords matrix : 1269 transitions.
[2022-05-15 21:03:51] [INFO ] Computation of Completed DNA matrix. took 32 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 21:03:51] [INFO ] Built C files in 175ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14526294653273133933
Running compilation step : cd /tmp/ltsmin14526294653273133933;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14526294653273133933;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14526294653273133933;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 21:03:54] [INFO ] Flatten gal took : 70 ms
[2022-05-15 21:03:54] [INFO ] Flatten gal took : 150 ms
[2022-05-15 21:03:54] [INFO ] Time to serialize gal into /tmp/LTL7554096052628490889.gal : 38 ms
[2022-05-15 21:03:54] [INFO ] Time to serialize properties into /tmp/LTL13803250733257590048.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7554096052628490889.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13803250733257590048.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7554096...267
Read 1 LTL properties
Checking formula 0 : !((F(X(X((X(G((X(F("(p360==0)")))&&("((p1243==0)||(p1338==0))"))))&&("((p1243==0)||(p1338==0))"))))))
Formula 0 simplified : !FXX("((p1243==0)||(p1338==0))" & XG("((p1243==0)||(p1338==0))" & XF"(p360==0)"))
Detected timeout of ITS tools.
[2022-05-15 21:04:09] [INFO ] Flatten gal took : 81 ms
[2022-05-15 21:04:09] [INFO ] Applying decomposition
[2022-05-15 21:04:09] [INFO ] Flatten gal took : 157 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14130338749126530676.txt' '-o' '/tmp/graph14130338749126530676.bin' '-w' '/tmp/graph14130338749126530676.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14130338749126530676.bin' '-l' '-1' '-v' '-w' '/tmp/graph14130338749126530676.weights' '-q' '0' '-e' '0.001'
[2022-05-15 21:04:10] [INFO ] Decomposing Gal with order
[2022-05-15 21:04:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 21:04:10] [INFO ] Removed a total of 2509 redundant transitions.
[2022-05-15 21:04:10] [INFO ] Flatten gal took : 255 ms
[2022-05-15 21:04:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 70 labels/synchronizations in 66 ms.
[2022-05-15 21:04:10] [INFO ] Time to serialize gal into /tmp/LTL13463056092240341699.gal : 22 ms
[2022-05-15 21:04:10] [INFO ] Time to serialize properties into /tmp/LTL6173967019216394948.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13463056092240341699.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6173967019216394948.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1346305...246
Read 1 LTL properties
Checking formula 0 : !((F(X(X((X(G((X(F("(i4.u46.p360==0)")))&&("((i11.u137.p1243==0)||(i11.u137.p1338==0))"))))&&("((i11.u137.p1243==0)||(i11.u137.p1338==...165
Formula 0 simplified : !FXX("((i11.u137.p1243==0)||(i11.u137.p1338==0))" & XG("((i11.u137.p1243==0)||(i11.u137.p1338==0))" & XF"(i4.u46.p360==0)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2930260055114712367
[2022-05-15 21:04:25] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2930260055114712367
Running compilation step : cd /tmp/ltsmin2930260055114712367;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2093 ms.
Running link step : cd /tmp/ltsmin2930260055114712367;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin2930260055114712367;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X(X((X([]((X(<>((LTLAPp0==true)))&&(LTLAPp1==true))))&&(LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ASLink-PT-06a-LTLFireability-03 finished in 62740 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(F(X(G(F(G(!(X(p0) U p0))))))))))'
Support contains 1 out of 1266 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1266/1266 places, 2007/2007 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 217 transitions
Trivial Post-agglo rules discarded 217 transitions
Performed 217 trivial Post agglomeration. Transition count delta: 217
Iterating post reduction 0 with 217 rules applied. Total rules applied 217 place count 1265 transition count 1789
Reduce places removed 222 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 226 rules applied. Total rules applied 443 place count 1043 transition count 1785
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 448 place count 1039 transition count 1784
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 449 place count 1038 transition count 1784
Performed 178 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 178 Pre rules applied. Total rules applied 449 place count 1038 transition count 1606
Deduced a syphon composed of 178 places in 2 ms
Ensure Unique test removed 53 places
Reduce places removed 231 places and 0 transitions.
Iterating global reduction 4 with 409 rules applied. Total rules applied 858 place count 807 transition count 1606
Discarding 14 places :
Implicit places reduction removed 14 places
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 4 with 25 rules applied. Total rules applied 883 place count 793 transition count 1595
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 894 place count 782 transition count 1595
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 25 Pre rules applied. Total rules applied 894 place count 782 transition count 1570
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 944 place count 757 transition count 1570
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 958 place count 743 transition count 1539
Iterating global reduction 6 with 14 rules applied. Total rules applied 972 place count 743 transition count 1539
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
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 8 rules applied. Total rules applied 980 place count 741 transition count 1533
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 981 place count 740 transition count 1533
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 981 place count 740 transition count 1532
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 983 place count 739 transition count 1532
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 988 place count 734 transition count 1520
Iterating global reduction 8 with 5 rules applied. Total rules applied 993 place count 734 transition count 1520
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 997 place count 730 transition count 1509
Iterating global reduction 8 with 4 rules applied. Total rules applied 1001 place count 730 transition count 1509
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 1004 place count 730 transition count 1506
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1005 place count 729 transition count 1498
Iterating global reduction 9 with 1 rules applied. Total rules applied 1006 place count 729 transition count 1498
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1007 place count 728 transition count 1490
Iterating global reduction 9 with 1 rules applied. Total rules applied 1008 place count 728 transition count 1490
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1009 place count 727 transition count 1482
Iterating global reduction 9 with 1 rules applied. Total rules applied 1010 place count 727 transition count 1482
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1011 place count 726 transition count 1474
Iterating global reduction 9 with 1 rules applied. Total rules applied 1012 place count 726 transition count 1474
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1013 place count 725 transition count 1466
Iterating global reduction 9 with 1 rules applied. Total rules applied 1014 place count 725 transition count 1466
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1015 place count 724 transition count 1458
Iterating global reduction 9 with 1 rules applied. Total rules applied 1016 place count 724 transition count 1458
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1017 place count 723 transition count 1450
Iterating global reduction 9 with 1 rules applied. Total rules applied 1018 place count 723 transition count 1450
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1019 place count 722 transition count 1442
Iterating global reduction 9 with 1 rules applied. Total rules applied 1020 place count 722 transition count 1442
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1021 place count 721 transition count 1434
Iterating global reduction 9 with 1 rules applied. Total rules applied 1022 place count 721 transition count 1434
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1023 place count 720 transition count 1426
Iterating global reduction 9 with 1 rules applied. Total rules applied 1024 place count 720 transition count 1426
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1025 place count 719 transition count 1418
Iterating global reduction 9 with 1 rules applied. Total rules applied 1026 place count 719 transition count 1418
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1027 place count 718 transition count 1410
Iterating global reduction 9 with 1 rules applied. Total rules applied 1028 place count 718 transition count 1410
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1029 place count 717 transition count 1402
Iterating global reduction 9 with 1 rules applied. Total rules applied 1030 place count 717 transition count 1402
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 9 with 128 rules applied. Total rules applied 1158 place count 653 transition count 1338
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1160 place count 651 transition count 1336
Iterating global reduction 9 with 2 rules applied. Total rules applied 1162 place count 651 transition count 1336
Applied a total of 1162 rules in 436 ms. Remains 651 /1266 variables (removed 615) and now considering 1336/2007 (removed 671) transitions.
// Phase 1: matrix 1336 rows 651 cols
[2022-05-15 21:04:41] [INFO ] Computed 97 place invariants in 8 ms
[2022-05-15 21:04:41] [INFO ] Implicit Places using invariants in 761 ms returned [72, 89, 95, 100, 108, 161, 182, 188, 193, 195, 255, 272, 278, 283, 285, 294, 312, 375, 383, 389, 458, 475, 481, 486, 488, 548, 565, 571, 576, 578, 590, 647]
Discarding 32 places :
Implicit Place search using SMT only with invariants took 775 ms to find 32 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 619/1266 places, 1336/2007 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 619 transition count 1318
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 601 transition count 1318
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 48 place count 589 transition count 1306
Iterating global reduction 2 with 12 rules applied. Total rules applied 60 place count 589 transition count 1306
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 72 place count 577 transition count 1294
Iterating global reduction 2 with 12 rules applied. Total rules applied 84 place count 577 transition count 1294
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 90 place count 571 transition count 1288
Iterating global reduction 2 with 6 rules applied. Total rules applied 96 place count 571 transition count 1288
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 130 place count 554 transition count 1271
Applied a total of 130 rules in 89 ms. Remains 554 /619 variables (removed 65) and now considering 1271/1336 (removed 65) transitions.
// Phase 1: matrix 1271 rows 554 cols
[2022-05-15 21:04:42] [INFO ] Computed 65 place invariants in 21 ms
[2022-05-15 21:04:42] [INFO ] Implicit Places using invariants in 431 ms returned []
// Phase 1: matrix 1271 rows 554 cols
[2022-05-15 21:04:42] [INFO ] Computed 65 place invariants in 7 ms
[2022-05-15 21:04:43] [INFO ] Implicit Places using invariants and state equation in 780 ms returned []
Implicit Place search using SMT with State Equation took 1248 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 554/1266 places, 1271/2007 transitions.
Finished structural reductions, in 2 iterations. Remains : 554/1266 places, 1271/2007 transitions.
Stuttering acceptance computed with spot in 27 ms :[p0]
Running random walk in product with property : ASLink-PT-06a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s305 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1342 reset in 383 ms.
Product exploration explored 100000 steps with 1322 reset in 326 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 37 ms :[p0]
Incomplete random walk after 10000 steps, including 149 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2955 steps, run visited all 1 properties in 16 ms. (steps per millisecond=184 )
Probabilistic random walk after 2955 steps, saw 2832 distinct states, run finished after 17 ms. (steps per millisecond=173 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 20 ms :[p0]
Stuttering acceptance computed with spot in 19 ms :[p0]
Support contains 1 out of 554 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 554/554 places, 1271/1271 transitions.
Applied a total of 0 rules in 15 ms. Remains 554 /554 variables (removed 0) and now considering 1271/1271 (removed 0) transitions.
// Phase 1: matrix 1271 rows 554 cols
[2022-05-15 21:04:44] [INFO ] Computed 65 place invariants in 7 ms
[2022-05-15 21:04:44] [INFO ] Implicit Places using invariants in 260 ms returned []
// Phase 1: matrix 1271 rows 554 cols
[2022-05-15 21:04:44] [INFO ] Computed 65 place invariants in 8 ms
[2022-05-15 21:04:45] [INFO ] Implicit Places using invariants and state equation in 798 ms returned []
Implicit Place search using SMT with State Equation took 1088 ms to find 0 implicit places.
[2022-05-15 21:04:45] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 1271 rows 554 cols
[2022-05-15 21:04:45] [INFO ] Computed 65 place invariants in 7 ms
[2022-05-15 21:04:45] [INFO ] Dead Transitions using invariants and state equation in 395 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 554/554 places, 1271/1271 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 21 ms :[p0]
Incomplete random walk after 10000 steps, including 143 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2955 steps, run visited all 1 properties in 10 ms. (steps per millisecond=295 )
Probabilistic random walk after 2955 steps, saw 2832 distinct states, run finished after 10 ms. (steps per millisecond=295 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 144 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 22 ms :[p0]
Stuttering acceptance computed with spot in 49 ms :[p0]
Stuttering acceptance computed with spot in 44 ms :[p0]
Product exploration explored 100000 steps with 1289 reset in 331 ms.
Product exploration explored 100000 steps with 1367 reset in 336 ms.
Built C files in :
/tmp/ltsmin1564534808863924870
[2022-05-15 21:04:47] [INFO ] Computing symmetric may disable matrix : 1271 transitions.
[2022-05-15 21:04:47] [INFO ] Computation of Complete disable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 21:04:47] [INFO ] Computing symmetric may enable matrix : 1271 transitions.
[2022-05-15 21:04:47] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 21:04:47] [INFO ] Computing Do-Not-Accords matrix : 1271 transitions.
[2022-05-15 21:04:47] [INFO ] Computation of Completed DNA matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 21:04:47] [INFO ] Built C files in 235ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1564534808863924870
Running compilation step : cd /tmp/ltsmin1564534808863924870;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1564534808863924870;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1564534808863924870;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 1 out of 554 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 554/554 places, 1271/1271 transitions.
Applied a total of 0 rules in 39 ms. Remains 554 /554 variables (removed 0) and now considering 1271/1271 (removed 0) transitions.
// Phase 1: matrix 1271 rows 554 cols
[2022-05-15 21:04:50] [INFO ] Computed 65 place invariants in 20 ms
[2022-05-15 21:04:50] [INFO ] Implicit Places using invariants in 409 ms returned []
// Phase 1: matrix 1271 rows 554 cols
[2022-05-15 21:04:50] [INFO ] Computed 65 place invariants in 7 ms
[2022-05-15 21:04:51] [INFO ] Implicit Places using invariants and state equation in 885 ms returned []
Implicit Place search using SMT with State Equation took 1295 ms to find 0 implicit places.
[2022-05-15 21:04:51] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 1271 rows 554 cols
[2022-05-15 21:04:51] [INFO ] Computed 65 place invariants in 9 ms
[2022-05-15 21:04:52] [INFO ] Dead Transitions using invariants and state equation in 399 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 554/554 places, 1271/1271 transitions.
Built C files in :
/tmp/ltsmin391069183278927011
[2022-05-15 21:04:52] [INFO ] Computing symmetric may disable matrix : 1271 transitions.
[2022-05-15 21:04:52] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 21:04:52] [INFO ] Computing symmetric may enable matrix : 1271 transitions.
[2022-05-15 21:04:52] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 21:04:52] [INFO ] Computing Do-Not-Accords matrix : 1271 transitions.
[2022-05-15 21:04:52] [INFO ] Computation of Completed DNA matrix. took 25 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 21:04:52] [INFO ] Built C files in 187ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin391069183278927011
Running compilation step : cd /tmp/ltsmin391069183278927011;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin391069183278927011;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin391069183278927011;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 21:04:55] [INFO ] Flatten gal took : 86 ms
[2022-05-15 21:04:55] [INFO ] Flatten gal took : 106 ms
[2022-05-15 21:04:55] [INFO ] Time to serialize gal into /tmp/LTL18061079764283025489.gal : 22 ms
[2022-05-15 21:04:55] [INFO ] Time to serialize properties into /tmp/LTL13486520274583270584.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18061079764283025489.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13486520274583270584.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1806107...268
Read 1 LTL properties
Checking formula 0 : !((F(X(G(F(X(G(F(G(!((X("(p677==1)"))U("(p677==1)"))))))))))))
Formula 0 simplified : !FXGFXGFG!(X"(p677==1)" U "(p677==1)")
Detected timeout of ITS tools.
[2022-05-15 21:05:10] [INFO ] Flatten gal took : 38 ms
[2022-05-15 21:05:10] [INFO ] Applying decomposition
[2022-05-15 21:05:10] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10764882083026131430.txt' '-o' '/tmp/graph10764882083026131430.bin' '-w' '/tmp/graph10764882083026131430.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10764882083026131430.bin' '-l' '-1' '-v' '-w' '/tmp/graph10764882083026131430.weights' '-q' '0' '-e' '0.001'
[2022-05-15 21:05:10] [INFO ] Decomposing Gal with order
[2022-05-15 21:05:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 21:05:11] [INFO ] Removed a total of 2514 redundant transitions.
[2022-05-15 21:05:11] [INFO ] Flatten gal took : 140 ms
[2022-05-15 21:05:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 48 ms.
[2022-05-15 21:05:11] [INFO ] Time to serialize gal into /tmp/LTL980678886663304721.gal : 20 ms
[2022-05-15 21:05:11] [INFO ] Time to serialize properties into /tmp/LTL15424982644491066958.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL980678886663304721.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15424982644491066958.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9806788...245
Read 1 LTL properties
Checking formula 0 : !((F(X(G(F(X(G(F(G(!((X("(i4.u78.p677==1)"))U("(i4.u78.p677==1)"))))))))))))
Formula 0 simplified : !FXGFXGFG!(X"(i4.u78.p677==1)" U "(i4.u78.p677==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin622596473022738545
[2022-05-15 21:05:26] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin622596473022738545
Running compilation step : cd /tmp/ltsmin622596473022738545;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2200 ms.
Running link step : cd /tmp/ltsmin622596473022738545;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin622596473022738545;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X([](<>(X([](<>([](!(X((LTLAPp0==true)) U (LTLAPp0==true))))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ASLink-PT-06a-LTLFireability-06 finished in 60633 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(X(p0)))))'
Support contains 1 out of 1266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1266/1266 places, 2007/2007 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1262 transition count 1986
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1262 transition count 1986
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 1260 transition count 1977
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 1260 transition count 1977
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 1258 transition count 1968
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 1258 transition count 1968
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1257 transition count 1960
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1257 transition count 1960
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1256 transition count 1952
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1256 transition count 1952
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1255 transition count 1944
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1255 transition count 1944
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1254 transition count 1936
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1254 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1253 transition count 1928
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1253 transition count 1928
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1252 transition count 1920
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1252 transition count 1920
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 1251 transition count 1912
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 1251 transition count 1912
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 1250 transition count 1904
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 1250 transition count 1904
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 1249 transition count 1896
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 1249 transition count 1896
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 1248 transition count 1888
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 1248 transition count 1888
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 1247 transition count 1880
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 1247 transition count 1880
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 1246 transition count 1872
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 1246 transition count 1872
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 1245 transition count 1864
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 1245 transition count 1864
Applied a total of 42 rules in 681 ms. Remains 1245 /1266 variables (removed 21) and now considering 1864/2007 (removed 143) transitions.
// Phase 1: matrix 1864 rows 1245 cols
[2022-05-15 21:05:42] [INFO ] Computed 171 place invariants in 28 ms
[2022-05-15 21:05:42] [INFO ] Implicit Places using invariants in 768 ms returned [210, 573, 591, 1118]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 770 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1241/1266 places, 1864/2007 transitions.
Applied a total of 0 rules in 33 ms. Remains 1241 /1241 variables (removed 0) and now considering 1864/1864 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1241/1266 places, 1864/2007 transitions.
Stuttering acceptance computed with spot in 193 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-06a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(EQ s686 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-06a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-06a-LTLFireability-10 finished in 1715 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(X(p0)))))'
Support contains 2 out of 1266 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1266/1266 places, 2007/2007 transitions.
Drop transitions removed 217 transitions
Trivial Post-agglo rules discarded 217 transitions
Performed 217 trivial Post agglomeration. Transition count delta: 217
Iterating post reduction 0 with 217 rules applied. Total rules applied 217 place count 1266 transition count 1790
Reduce places removed 217 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 218 rules applied. Total rules applied 435 place count 1049 transition count 1789
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 436 place count 1048 transition count 1789
Performed 167 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 167 Pre rules applied. Total rules applied 436 place count 1048 transition count 1622
Deduced a syphon composed of 167 places in 2 ms
Ensure Unique test removed 53 places
Reduce places removed 220 places and 0 transitions.
Iterating global reduction 3 with 387 rules applied. Total rules applied 823 place count 828 transition count 1622
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 9 rules applied. Total rules applied 832 place count 820 transition count 1621
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 833 place count 819 transition count 1621
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 24 Pre rules applied. Total rules applied 833 place count 819 transition count 1597
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 881 place count 795 transition count 1597
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 890 place count 786 transition count 1571
Iterating global reduction 5 with 9 rules applied. Total rules applied 899 place count 786 transition count 1571
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 902 place count 784 transition count 1570
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 903 place count 783 transition count 1570
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 903 place count 783 transition count 1569
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 905 place count 782 transition count 1569
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 910 place count 777 transition count 1557
Iterating global reduction 7 with 5 rules applied. Total rules applied 915 place count 777 transition count 1557
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 919 place count 773 transition count 1546
Iterating global reduction 7 with 4 rules applied. Total rules applied 923 place count 773 transition count 1546
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 926 place count 773 transition count 1543
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 927 place count 772 transition count 1535
Iterating global reduction 8 with 1 rules applied. Total rules applied 928 place count 772 transition count 1535
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 929 place count 771 transition count 1527
Iterating global reduction 8 with 1 rules applied. Total rules applied 930 place count 771 transition count 1527
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 931 place count 770 transition count 1519
Iterating global reduction 8 with 1 rules applied. Total rules applied 932 place count 770 transition count 1519
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 933 place count 769 transition count 1511
Iterating global reduction 8 with 1 rules applied. Total rules applied 934 place count 769 transition count 1511
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 935 place count 768 transition count 1503
Iterating global reduction 8 with 1 rules applied. Total rules applied 936 place count 768 transition count 1503
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 937 place count 767 transition count 1495
Iterating global reduction 8 with 1 rules applied. Total rules applied 938 place count 767 transition count 1495
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 939 place count 766 transition count 1487
Iterating global reduction 8 with 1 rules applied. Total rules applied 940 place count 766 transition count 1487
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 941 place count 765 transition count 1479
Iterating global reduction 8 with 1 rules applied. Total rules applied 942 place count 765 transition count 1479
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 943 place count 764 transition count 1471
Iterating global reduction 8 with 1 rules applied. Total rules applied 944 place count 764 transition count 1471
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 945 place count 763 transition count 1463
Iterating global reduction 8 with 1 rules applied. Total rules applied 946 place count 763 transition count 1463
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 947 place count 762 transition count 1455
Iterating global reduction 8 with 1 rules applied. Total rules applied 948 place count 762 transition count 1455
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 949 place count 761 transition count 1447
Iterating global reduction 8 with 1 rules applied. Total rules applied 950 place count 761 transition count 1447
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 951 place count 760 transition count 1439
Iterating global reduction 8 with 1 rules applied. Total rules applied 952 place count 760 transition count 1439
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 8 with 140 rules applied. Total rules applied 1092 place count 690 transition count 1369
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1094 place count 688 transition count 1367
Iterating global reduction 8 with 2 rules applied. Total rules applied 1096 place count 688 transition count 1367
Applied a total of 1096 rules in 645 ms. Remains 688 /1266 variables (removed 578) and now considering 1367/2007 (removed 640) transitions.
// Phase 1: matrix 1367 rows 688 cols
[2022-05-15 21:05:43] [INFO ] Computed 108 place invariants in 10 ms
[2022-05-15 21:05:44] [INFO ] Implicit Places using invariants in 365 ms returned [90, 96, 101, 117, 118, 193, 199, 204, 220, 290, 296, 301, 317, 318, 336, 398, 406, 412, 428, 498, 504, 509, 526, 596, 602, 607, 626, 627, 684]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 379 ms to find 29 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 659/1266 places, 1367/2007 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 659 transition count 1349
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 641 transition count 1349
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 36 place count 641 transition count 1337
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 60 place count 629 transition count 1337
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 72 place count 617 transition count 1325
Iterating global reduction 2 with 12 rules applied. Total rules applied 84 place count 617 transition count 1325
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 96 place count 605 transition count 1313
Iterating global reduction 2 with 12 rules applied. Total rules applied 108 place count 605 transition count 1313
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 114 place count 599 transition count 1307
Iterating global reduction 2 with 6 rules applied. Total rules applied 120 place count 599 transition count 1307
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 5 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 156 place count 581 transition count 1289
Applied a total of 156 rules in 76 ms. Remains 581 /659 variables (removed 78) and now considering 1289/1367 (removed 78) transitions.
// Phase 1: matrix 1289 rows 581 cols
[2022-05-15 21:05:44] [INFO ] Computed 79 place invariants in 7 ms
[2022-05-15 21:05:44] [INFO ] Implicit Places using invariants in 273 ms returned [93, 96, 177, 180, 261, 264, 345, 348, 429, 432, 514, 517]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 287 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 569/1266 places, 1289/2007 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 0 with 6 rules applied. Total rules applied 6 place count 569 transition count 1283
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 563 transition count 1283
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 18 place count 557 transition count 1277
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 557 transition count 1277
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 30 place count 557 transition count 1271
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 556 transition count 1270
Applied a total of 32 rules in 45 ms. Remains 556 /569 variables (removed 13) and now considering 1270/1289 (removed 19) transitions.
// Phase 1: matrix 1270 rows 556 cols
[2022-05-15 21:05:44] [INFO ] Computed 67 place invariants in 7 ms
[2022-05-15 21:05:44] [INFO ] Implicit Places using invariants in 360 ms returned [72, 151, 231, 311, 391, 472]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 361 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 550/1266 places, 1270/2007 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 544 transition count 1264
Applied a total of 12 rules in 25 ms. Remains 544 /550 variables (removed 6) and now considering 1264/1270 (removed 6) transitions.
// Phase 1: matrix 1264 rows 544 cols
[2022-05-15 21:05:44] [INFO ] Computed 61 place invariants in 11 ms
[2022-05-15 21:05:45] [INFO ] Implicit Places using invariants in 273 ms returned []
// Phase 1: matrix 1264 rows 544 cols
[2022-05-15 21:05:45] [INFO ] Computed 61 place invariants in 11 ms
[2022-05-15 21:05:45] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-15 21:05:46] [INFO ] Implicit Places using invariants and state equation in 1111 ms returned []
Implicit Place search using SMT with State Equation took 1397 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 544/1266 places, 1264/2007 transitions.
Finished structural reductions, in 4 iterations. Remains : 544/1266 places, 1264/2007 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-06a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s361 1) (EQ s404 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 251 steps with 1 reset in 1 ms.
FORMULA ASLink-PT-06a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-06a-LTLFireability-12 finished in 3281 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U p1))&&X(G(G(p2)))))'
Support contains 5 out of 1266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1266/1266 places, 2007/2007 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1263 transition count 1994
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1263 transition count 1994
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1262 transition count 1993
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1262 transition count 1993
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1261 transition count 1992
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1261 transition count 1992
Applied a total of 10 rules in 123 ms. Remains 1261 /1266 variables (removed 5) and now considering 1992/2007 (removed 15) transitions.
// Phase 1: matrix 1992 rows 1261 cols
[2022-05-15 21:05:46] [INFO ] Computed 171 place invariants in 33 ms
[2022-05-15 21:05:46] [INFO ] Implicit Places using invariants in 494 ms returned [210, 573, 591, 1118]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 496 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1257/1266 places, 1992/2007 transitions.
Applied a total of 0 rules in 26 ms. Remains 1257 /1257 variables (removed 0) and now considering 1992/1992 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1257/1266 places, 1992/2007 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p2))]
Running random walk in product with property : ASLink-PT-06a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p2), acceptance={0} source=3 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p2:(AND (EQ s498 1) (EQ s509 1)), p1:(AND (EQ s678 1) (EQ s935 1) (EQ s1132 1)), p0:(AND (EQ s935 1) (EQ s1132 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-06a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-06a-LTLFireability-14 finished in 788 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X((X(G((X(F(p0))&&p1)))&&p1)))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(F(X(G(F(G(!(X(p0) U p0))))))))))'
[2022-05-15 21:05:47] [INFO ] Flatten gal took : 112 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14928815509202056434
[2022-05-15 21:05:47] [INFO ] Too many transitions (2007) to apply POR reductions. Disabling POR matrices.
[2022-05-15 21:05:47] [INFO ] Applying decomposition
[2022-05-15 21:05:47] [INFO ] Built C files in 82ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14928815509202056434
Running compilation step : cd /tmp/ltsmin14928815509202056434;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-15 21:05:47] [INFO ] Flatten gal took : 112 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12260557773645867280.txt' '-o' '/tmp/graph12260557773645867280.bin' '-w' '/tmp/graph12260557773645867280.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12260557773645867280.bin' '-l' '-1' '-v' '-w' '/tmp/graph12260557773645867280.weights' '-q' '0' '-e' '0.001'
[2022-05-15 21:05:47] [INFO ] Decomposing Gal with order
[2022-05-15 21:05:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 21:05:48] [INFO ] Removed a total of 2842 redundant transitions.
[2022-05-15 21:05:48] [INFO ] Flatten gal took : 147 ms
[2022-05-15 21:05:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 23 labels/synchronizations in 27 ms.
[2022-05-15 21:05:48] [INFO ] Time to serialize gal into /tmp/LTLFireability12818541206458489084.gal : 14 ms
[2022-05-15 21:05:48] [INFO ] Time to serialize properties into /tmp/LTLFireability15733365768171429037.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12818541206458489084.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15733365768171429037.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...269
Read 2 LTL properties
Checking formula 0 : !((F(X(X((X(G((X(F("(i4.u102.p360==0)")))&&("((i15.u348.p1243==0)||(i15.u359.p1338==0))"))))&&("((i15.u348.p1243==0)||(i15.u359.p1338=...166
Formula 0 simplified : !FXX("((i15.u348.p1243==0)||(i15.u359.p1338==0))" & XG("((i15.u348.p1243==0)||(i15.u359.p1338==0))" & XF"(i4.u102.p360==0)"))
Compilation finished in 3860 ms.
Running link step : cd /tmp/ltsmin14928815509202056434;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin14928815509202056434;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X(X((X([]((X(<>((LTLAPp0==true)))&&(LTLAPp1==true))))&&(LTLAPp1==true)))))' '--buchi-type=spotba'
LTSmin run took 12316 ms.
FORMULA ASLink-PT-06a-LTLFireability-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin14928815509202056434;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X([](<>(X([](<>([](!(X((LTLAPp2==true)) U (LTLAPp2==true))))))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-15 21:26:51] [INFO ] Applying decomposition
[2022-05-15 21:26:51] [INFO ] Flatten gal took : 165 ms
[2022-05-15 21:26:51] [INFO ] Decomposing Gal with order
[2022-05-15 21:26:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 21:26:52] [INFO ] Removed a total of 2353 redundant transitions.
[2022-05-15 21:26:52] [INFO ] Flatten gal took : 403 ms
[2022-05-15 21:26:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 813 labels/synchronizations in 166 ms.
[2022-05-15 21:26:52] [INFO ] Time to serialize gal into /tmp/LTLFireability8271737644881590693.gal : 23 ms
[2022-05-15 21:26:52] [INFO ] Time to serialize properties into /tmp/LTLFireability8138541825150598657.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8271737644881590693.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8138541825150598657.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...267
Read 1 LTL properties
Checking formula 0 : !((F(X(G(F(X(G(F(G(!((X("(i29.u275.p677==1)"))U("(i29.u275.p677==1)"))))))))))))
Formula 0 simplified : !FXGFXGFG!(X"(i29.u275.p677==1)" U "(i29.u275.p677==1)")
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin14928815509202056434;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X([](<>(X([](<>([](!(X((LTLAPp2==true)) U (LTLAPp2==true))))))))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin14928815509202056434;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X([](<>(X([](<>([](!(X((LTLAPp2==true)) U (LTLAPp2==true))))))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-15 21:47:56] [INFO ] Flatten gal took : 182 ms
[2022-05-15 21:47:56] [INFO ] Input system was already deterministic with 2007 transitions.
[2022-05-15 21:47:56] [INFO ] Transformed 1266 places.
[2022-05-15 21:47:56] [INFO ] Transformed 2007 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-15 21:48:26] [INFO ] Time to serialize gal into /tmp/LTLFireability4298758989608048630.gal : 21 ms
[2022-05-15 21:48:26] [INFO ] Time to serialize properties into /tmp/LTLFireability10909990636383439549.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4298758989608048630.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10909990636383439549.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...334
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(X(G(F(X(G(F(G(!((X("(p677==1)"))U("(p677==1)"))))))))))))
Formula 0 simplified : !FXGFXGFG!(X"(p677==1)" U "(p677==1)")
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-06a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ASLink-PT-06a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r006-tajo-165245688800092"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;