About the Execution of ITS-Tools for ASLink-PT-04a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15045.747 | 3600000.00 | 11218214.00 | 32150.30 | TFFFFF?FFFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r007-tall-162037989500058.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ASLink-PT-04a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-tall-162037989500058
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 752K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 15:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 15:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 15:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 15:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 01:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 01:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 09:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 22 09:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 436K May 5 16:51 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ASLink-PT-04a-00
FORMULA_NAME ASLink-PT-04a-01
FORMULA_NAME ASLink-PT-04a-02
FORMULA_NAME ASLink-PT-04a-03
FORMULA_NAME ASLink-PT-04a-04
FORMULA_NAME ASLink-PT-04a-05
FORMULA_NAME ASLink-PT-04a-06
FORMULA_NAME ASLink-PT-04a-07
FORMULA_NAME ASLink-PT-04a-08
FORMULA_NAME ASLink-PT-04a-09
FORMULA_NAME ASLink-PT-04a-10
FORMULA_NAME ASLink-PT-04a-11
FORMULA_NAME ASLink-PT-04a-12
FORMULA_NAME ASLink-PT-04a-13
FORMULA_NAME ASLink-PT-04a-14
FORMULA_NAME ASLink-PT-04a-15
=== Now, execution of the tool begins
BK_START 1620403574136
Running Version 0
[2021-05-07 16:06:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-07 16:06:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-07 16:06:15] [INFO ] Load time of PNML (sax parser for PT used): 129 ms
[2021-05-07 16:06:15] [INFO ] Transformed 1016 places.
[2021-05-07 16:06:15] [INFO ] Transformed 1554 transitions.
[2021-05-07 16:06:15] [INFO ] Found NUPN structural information;
[2021-05-07 16:06:15] [INFO ] Parsed PT model containing 1016 places and 1554 transitions in 185 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-07 16:06:15] [INFO ] Initial state test concluded for 2 properties.
Ensure Unique test removed 16 transitions
Reduce redundant transitions removed 16 transitions.
FORMULA ASLink-PT-04a-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 52 out of 1016 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1016/1016 places, 1538/1538 transitions.
Ensure Unique test removed 16 places
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 992 transition count 1538
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 32 place count 984 transition count 1507
Ensure Unique test removed 1 places
Iterating global reduction 1 with 9 rules applied. Total rules applied 41 place count 983 transition count 1507
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 43 place count 983 transition count 1505
Applied a total of 43 rules in 180 ms. Remains 983 /1016 variables (removed 33) and now considering 1505/1538 (removed 33) transitions.
// Phase 1: matrix 1505 rows 983 cols
[2021-05-07 16:06:16] [INFO ] Computed 169 place invariants in 151 ms
[2021-05-07 16:06:17] [INFO ] Implicit Places using invariants in 917 ms returned [1, 19, 20, 23, 33, 51, 69, 198, 214, 219, 220, 221, 239, 257, 386, 402, 407, 408, 428, 446, 575, 591, 596, 597, 598, 634, 763, 768, 780, 785, 786, 787, 821, 823, 826, 845, 846, 864, 872, 880, 886, 892, 898, 904, 912, 918, 924, 932]
Discarding 48 places :
Implicit Place search using SMT only with invariants took 953 ms to find 48 implicit places.
// Phase 1: matrix 1505 rows 935 cols
[2021-05-07 16:06:17] [INFO ] Computed 121 place invariants in 79 ms
[2021-05-07 16:06:17] [INFO ] Dead Transitions using invariants and state equation in 743 ms returned []
Starting structural reductions, iteration 1 : 935/1016 places, 1505/1538 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 922 transition count 1492
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 922 transition count 1492
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 912 transition count 1482
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 912 transition count 1482
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 907 transition count 1477
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 907 transition count 1477
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 906 transition count 1476
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 906 transition count 1476
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 905 transition count 1475
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 905 transition count 1475
Applied a total of 60 rules in 116 ms. Remains 905 /935 variables (removed 30) and now considering 1475/1505 (removed 30) transitions.
// Phase 1: matrix 1475 rows 905 cols
[2021-05-07 16:06:18] [INFO ] Computed 121 place invariants in 43 ms
[2021-05-07 16:06:18] [INFO ] Implicit Places using invariants in 458 ms returned []
// Phase 1: matrix 1475 rows 905 cols
[2021-05-07 16:06:18] [INFO ] Computed 121 place invariants in 15 ms
[2021-05-07 16:06:19] [INFO ] Implicit Places using invariants and state equation in 1355 ms returned []
Implicit Place search using SMT with State Equation took 1815 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 905/1016 places, 1475/1538 transitions.
[2021-05-07 16:06:20] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-07 16:06:20] [INFO ] Flatten gal took : 151 ms
FORMULA ASLink-PT-04a-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-07 16:06:20] [INFO ] Flatten gal took : 96 ms
[2021-05-07 16:06:20] [INFO ] Input system was already deterministic with 1475 transitions.
Incomplete random walk after 100000 steps, including 697 resets, run finished after 588 ms. (steps per millisecond=170 ) properties (out of 26) seen :8
Running SMT prover for 18 properties.
// Phase 1: matrix 1475 rows 905 cols
[2021-05-07 16:06:21] [INFO ] Computed 121 place invariants in 17 ms
[2021-05-07 16:06:21] [INFO ] [Real]Absence check using 28 positive place invariants in 13 ms returned sat
[2021-05-07 16:06:21] [INFO ] [Real]Absence check using 28 positive and 93 generalized place invariants in 20 ms returned sat
[2021-05-07 16:06:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 16:06:21] [INFO ] [Real]Absence check using state equation in 494 ms returned sat
[2021-05-07 16:06:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 16:06:21] [INFO ] [Nat]Absence check using 28 positive place invariants in 14 ms returned sat
[2021-05-07 16:06:21] [INFO ] [Nat]Absence check using 28 positive and 93 generalized place invariants in 20 ms returned sat
[2021-05-07 16:06:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 16:06:22] [INFO ] [Nat]Absence check using state equation in 463 ms returned unsat
[2021-05-07 16:06:22] [INFO ] [Real]Absence check using 28 positive place invariants in 17 ms returned sat
[2021-05-07 16:06:22] [INFO ] [Real]Absence check using 28 positive and 93 generalized place invariants in 28 ms returned sat
[2021-05-07 16:06:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 16:06:22] [INFO ] [Real]Absence check using state equation in 476 ms returned sat
[2021-05-07 16:06:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 16:06:23] [INFO ] [Nat]Absence check using 28 positive place invariants in 13 ms returned sat
[2021-05-07 16:06:23] [INFO ] [Nat]Absence check using 28 positive and 93 generalized place invariants in 18 ms returned sat
[2021-05-07 16:06:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 16:06:29] [INFO ] [Nat]Absence check using state equation in 6187 ms returned unknown
[2021-05-07 16:06:29] [INFO ] [Real]Absence check using 28 positive place invariants in 13 ms returned sat
[2021-05-07 16:06:29] [INFO ] [Real]Absence check using 28 positive and 93 generalized place invariants in 19 ms returned sat
[2021-05-07 16:06:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 16:06:29] [INFO ] [Real]Absence check using state equation in 560 ms returned sat
[2021-05-07 16:06:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 16:06:30] [INFO ] [Nat]Absence check using 28 positive place invariants in 14 ms returned sat
[2021-05-07 16:06:30] [INFO ] [Nat]Absence check using 28 positive and 93 generalized place invariants in 19 ms returned sat
[2021-05-07 16:06:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 16:06:31] [INFO ] [Nat]Absence check using state equation in 1014 ms returned unsat
[2021-05-07 16:06:31] [INFO ] [Real]Absence check using 28 positive place invariants in 12 ms returned sat
[2021-05-07 16:06:31] [INFO ] [Real]Absence check using 28 positive and 93 generalized place invariants in 19 ms returned sat
[2021-05-07 16:06:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 16:06:31] [INFO ] [Real]Absence check using state equation in 363 ms returned sat
[2021-05-07 16:06:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 16:06:31] [INFO ] [Nat]Absence check using 28 positive place invariants in 13 ms returned sat
[2021-05-07 16:06:31] [INFO ] [Nat]Absence check using 28 positive and 93 generalized place invariants in 17 ms returned unsat
[2021-05-07 16:06:31] [INFO ] [Real]Absence check using 28 positive place invariants in 18 ms returned sat
[2021-05-07 16:06:31] [INFO ] [Real]Absence check using 28 positive and 93 generalized place invariants in 19 ms returned sat
[2021-05-07 16:06:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 16:06:32] [INFO ] [Real]Absence check using state equation in 502 ms returned sat
[2021-05-07 16:06:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 16:06:32] [INFO ] [Nat]Absence check using 28 positive place invariants in 14 ms returned sat
[2021-05-07 16:06:32] [INFO ] [Nat]Absence check using 28 positive and 93 generalized place invariants in 19 ms returned sat
[2021-05-07 16:06:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 16:06:35] [INFO ] [Nat]Absence check using state equation in 2796 ms returned unsat
[2021-05-07 16:06:35] [INFO ] [Real]Absence check using 28 positive place invariants in 14 ms returned sat
[2021-05-07 16:06:35] [INFO ] [Real]Absence check using 28 positive and 93 generalized place invariants in 20 ms returned sat
[2021-05-07 16:06:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 16:06:35] [INFO ] [Real]Absence check using state equation in 381 ms returned sat
[2021-05-07 16:06:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 16:06:36] [INFO ] [Nat]Absence check using 28 positive place invariants in 14 ms returned sat
[2021-05-07 16:06:36] [INFO ] [Nat]Absence check using 28 positive and 93 generalized place invariants in 20 ms returned sat
[2021-05-07 16:06:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 16:06:42] [INFO ] [Nat]Absence check using state equation in 6261 ms returned unknown
[2021-05-07 16:06:42] [INFO ] [Real]Absence check using 28 positive place invariants in 23 ms returned sat
[2021-05-07 16:06:42] [INFO ] [Real]Absence check using 28 positive and 93 generalized place invariants in 35 ms returned sat
[2021-05-07 16:06:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 16:06:43] [INFO ] [Real]Absence check using state equation in 428 ms returned sat
[2021-05-07 16:06:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 16:06:43] [INFO ] [Nat]Absence check using 28 positive place invariants in 14 ms returned sat
[2021-05-07 16:06:43] [INFO ] [Nat]Absence check using 28 positive and 93 generalized place invariants in 20 ms returned sat
[2021-05-07 16:06:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 16:06:49] [INFO ] [Nat]Absence check using state equation in 6303 ms returned unknown
[2021-05-07 16:06:49] [INFO ] [Real]Absence check using 28 positive place invariants in 13 ms returned sat
[2021-05-07 16:06:49] [INFO ] [Real]Absence check using 28 positive and 93 generalized place invariants in 20 ms returned sat
[2021-05-07 16:06:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 16:06:49] [INFO ] [Real]Absence check using state equation in 339 ms returned sat
[2021-05-07 16:06:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 16:06:50] [INFO ] [Nat]Absence check using 28 positive place invariants in 13 ms returned sat
[2021-05-07 16:06:50] [INFO ] [Nat]Absence check using 28 positive and 93 generalized place invariants in 18 ms returned sat
[2021-05-07 16:06:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 16:06:56] [INFO ] [Nat]Absence check using state equation in 6272 ms returned unknown
[2021-05-07 16:06:56] [INFO ] [Real]Absence check using 28 positive place invariants in 12 ms returned sat
[2021-05-07 16:06:56] [INFO ] [Real]Absence check using 28 positive and 93 generalized place invariants in 19 ms returned sat
[2021-05-07 16:06:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 16:06:56] [INFO ] [Real]Absence check using state equation in 428 ms returned sat
[2021-05-07 16:06:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 16:06:57] [INFO ] [Nat]Absence check using 28 positive place invariants in 13 ms returned sat
[2021-05-07 16:06:57] [INFO ] [Nat]Absence check using 28 positive and 93 generalized place invariants in 18 ms returned sat
[2021-05-07 16:06:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 16:07:03] [INFO ] [Nat]Absence check using state equation in 6166 ms returned unknown
[2021-05-07 16:07:03] [INFO ] [Real]Absence check using 28 positive place invariants in 13 ms returned sat
[2021-05-07 16:07:03] [INFO ] [Real]Absence check using 28 positive and 93 generalized place invariants in 19 ms returned sat
[2021-05-07 16:07:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 16:07:03] [INFO ] [Real]Absence check using state equation in 462 ms returned sat
[2021-05-07 16:07:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 16:07:03] [INFO ] [Nat]Absence check using 28 positive place invariants in 13 ms returned sat
[2021-05-07 16:07:04] [INFO ] [Nat]Absence check using 28 positive and 93 generalized place invariants in 19 ms returned sat
[2021-05-07 16:07:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 16:07:08] [INFO ] [Nat]Absence check using state equation in 4310 ms returned unsat
[2021-05-07 16:07:08] [INFO ] [Real]Absence check using 28 positive place invariants in 13 ms returned sat
[2021-05-07 16:07:08] [INFO ] [Real]Absence check using 28 positive and 93 generalized place invariants in 19 ms returned sat
[2021-05-07 16:07:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 16:07:08] [INFO ] [Real]Absence check using state equation in 479 ms returned sat
[2021-05-07 16:07:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 16:07:09] [INFO ] [Nat]Absence check using 28 positive place invariants in 13 ms returned sat
[2021-05-07 16:07:09] [INFO ] [Nat]Absence check using 28 positive and 93 generalized place invariants in 19 ms returned sat
[2021-05-07 16:07:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 16:07:15] [INFO ] [Nat]Absence check using state equation in 6453 ms returned unknown
[2021-05-07 16:07:15] [INFO ] [Real]Absence check using 28 positive place invariants in 12 ms returned sat
[2021-05-07 16:07:15] [INFO ] [Real]Absence check using 28 positive and 93 generalized place invariants in 19 ms returned sat
[2021-05-07 16:07:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 16:07:16] [INFO ] [Real]Absence check using state equation in 353 ms returned sat
[2021-05-07 16:07:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 16:07:16] [INFO ] [Nat]Absence check using 28 positive place invariants in 12 ms returned sat
[2021-05-07 16:07:16] [INFO ] [Nat]Absence check using 28 positive and 93 generalized place invariants in 18 ms returned sat
[2021-05-07 16:07:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 16:07:17] [INFO ] [Nat]Absence check using state equation in 1800 ms returned unsat
[2021-05-07 16:07:18] [INFO ] [Real]Absence check using 28 positive place invariants in 13 ms returned sat
[2021-05-07 16:07:18] [INFO ] [Real]Absence check using 28 positive and 93 generalized place invariants in 19 ms returned sat
[2021-05-07 16:07:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 16:07:18] [INFO ] [Real]Absence check using state equation in 460 ms returned sat
[2021-05-07 16:07:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 16:07:18] [INFO ] [Nat]Absence check using 28 positive place invariants in 14 ms returned sat
[2021-05-07 16:07:18] [INFO ] [Nat]Absence check using 28 positive and 93 generalized place invariants in 19 ms returned sat
[2021-05-07 16:07:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 16:07:24] [INFO ] [Nat]Absence check using state equation in 6200 ms returned unknown
[2021-05-07 16:07:25] [INFO ] [Real]Absence check using 28 positive place invariants in 12 ms returned sat
[2021-05-07 16:07:25] [INFO ] [Real]Absence check using 28 positive and 93 generalized place invariants in 18 ms returned sat
[2021-05-07 16:07:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 16:07:25] [INFO ] [Real]Absence check using state equation in 471 ms returned sat
[2021-05-07 16:07:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 16:07:25] [INFO ] [Nat]Absence check using 28 positive place invariants in 14 ms returned sat
[2021-05-07 16:07:25] [INFO ] [Nat]Absence check using 28 positive and 93 generalized place invariants in 19 ms returned sat
[2021-05-07 16:07:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 16:07:32] [INFO ] [Nat]Absence check using state equation in 6471 ms returned unknown
[2021-05-07 16:07:32] [INFO ] [Real]Absence check using 28 positive place invariants in 12 ms returned sat
[2021-05-07 16:07:32] [INFO ] [Real]Absence check using 28 positive and 93 generalized place invariants in 19 ms returned sat
[2021-05-07 16:07:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 16:07:32] [INFO ] [Real]Absence check using state equation in 448 ms returned sat
[2021-05-07 16:07:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 16:07:32] [INFO ] [Nat]Absence check using 28 positive place invariants in 13 ms returned sat
[2021-05-07 16:07:32] [INFO ] [Nat]Absence check using 28 positive and 93 generalized place invariants in 19 ms returned sat
[2021-05-07 16:07:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 16:07:39] [INFO ] [Nat]Absence check using state equation in 6469 ms returned unknown
[2021-05-07 16:07:39] [INFO ] [Real]Absence check using 28 positive place invariants in 12 ms returned sat
[2021-05-07 16:07:39] [INFO ] [Real]Absence check using 28 positive and 93 generalized place invariants in 19 ms returned sat
[2021-05-07 16:07:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 16:07:39] [INFO ] [Real]Absence check using state equation in 453 ms returned sat
[2021-05-07 16:07:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 16:07:40] [INFO ] [Nat]Absence check using 28 positive place invariants in 14 ms returned sat
[2021-05-07 16:07:40] [INFO ] [Nat]Absence check using 28 positive and 93 generalized place invariants in 19 ms returned sat
[2021-05-07 16:07:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 16:07:40] [INFO ] [Nat]Absence check using state equation in 642 ms returned sat
[2021-05-07 16:07:40] [INFO ] Computed and/alt/rep : 585/1445/585 causal constraints (skipped 889 transitions) in 103 ms.
[2021-05-07 16:07:47] [INFO ] Added : 481 causal constraints over 97 iterations in 6672 ms. Result :sat
[2021-05-07 16:07:47] [INFO ] [Real]Absence check using 28 positive place invariants in 15 ms returned sat
[2021-05-07 16:07:47] [INFO ] [Real]Absence check using 28 positive and 93 generalized place invariants in 20 ms returned sat
[2021-05-07 16:07:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 16:07:48] [INFO ] [Real]Absence check using state equation in 461 ms returned sat
[2021-05-07 16:07:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 16:07:48] [INFO ] [Nat]Absence check using 28 positive place invariants in 13 ms returned sat
[2021-05-07 16:07:48] [INFO ] [Nat]Absence check using 28 positive and 93 generalized place invariants in 20 ms returned sat
[2021-05-07 16:07:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 16:07:54] [INFO ] [Nat]Absence check using state equation in 6389 ms returned unknown
[2021-05-07 16:07:54] [INFO ] [Real]Absence check using 28 positive place invariants in 12 ms returned sat
[2021-05-07 16:07:54] [INFO ] [Real]Absence check using 28 positive and 93 generalized place invariants in 20 ms returned sat
[2021-05-07 16:07:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 16:07:55] [INFO ] [Real]Absence check using state equation in 516 ms returned sat
[2021-05-07 16:07:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 16:07:55] [INFO ] [Nat]Absence check using 28 positive place invariants in 13 ms returned sat
[2021-05-07 16:07:55] [INFO ] [Nat]Absence check using 28 positive and 93 generalized place invariants in 19 ms returned sat
[2021-05-07 16:07:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 16:07:58] [INFO ] [Nat]Absence check using state equation in 3575 ms returned unsat
Successfully simplified 7 atomic propositions for a total of 11 simplifications.
[2021-05-07 16:07:58] [INFO ] Initial state test concluded for 2 properties.
FORMULA ASLink-PT-04a-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U X(p1)))], workingDir=/home/mcc/execution]
Support contains 4 out of 905 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 905/905 places, 1475/1475 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 902 transition count 1460
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 902 transition count 1460
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 900 transition count 1451
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 900 transition count 1451
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 898 transition count 1442
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 898 transition count 1442
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 896 transition count 1433
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 896 transition count 1433
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 894 transition count 1424
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 894 transition count 1424
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 893 transition count 1416
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 893 transition count 1416
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 892 transition count 1408
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 892 transition count 1408
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 891 transition count 1400
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 891 transition count 1400
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 890 transition count 1392
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 890 transition count 1392
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 889 transition count 1384
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 889 transition count 1384
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 888 transition count 1376
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 888 transition count 1376
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 887 transition count 1368
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 887 transition count 1368
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 886 transition count 1360
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 886 transition count 1360
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 885 transition count 1352
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 885 transition count 1352
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 884 transition count 1344
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 884 transition count 1344
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 883 transition count 1336
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 883 transition count 1336
Applied a total of 44 rules in 297 ms. Remains 883 /905 variables (removed 22) and now considering 1336/1475 (removed 139) transitions.
// Phase 1: matrix 1336 rows 883 cols
[2021-05-07 16:07:59] [INFO ] Computed 121 place invariants in 11 ms
[2021-05-07 16:07:59] [INFO ] Implicit Places using invariants in 410 ms returned [391, 590, 792, 793]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 411 ms to find 4 implicit places.
// Phase 1: matrix 1336 rows 879 cols
[2021-05-07 16:07:59] [INFO ] Computed 117 place invariants in 12 ms
[2021-05-07 16:08:00] [INFO ] Dead Transitions using invariants and state equation in 581 ms returned []
Starting structural reductions, iteration 1 : 879/905 places, 1336/1475 transitions.
Applied a total of 0 rules in 23 ms. Remains 879 /879 variables (removed 0) and now considering 1336/1336 (removed 0) transitions.
// Phase 1: matrix 1336 rows 879 cols
[2021-05-07 16:08:00] [INFO ] Computed 117 place invariants in 11 ms
[2021-05-07 16:08:00] [INFO ] Dead Transitions using invariants and state equation in 588 ms returned []
Finished structural reductions, in 2 iterations. Remains : 879/905 places, 1336/1475 transitions.
Stuttering acceptance computed with spot in 229 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : ASLink-PT-04a-02 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(OR (EQ s4 0) (EQ s70 0)), p1:(AND (EQ s744 1) (EQ s777 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 113 steps with 0 reset in 3 ms.
FORMULA ASLink-PT-04a-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-04a-02 finished in 2200 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 905 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 905/905 places, 1475/1475 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 902 transition count 1460
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 902 transition count 1460
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 900 transition count 1451
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 900 transition count 1451
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 898 transition count 1442
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 898 transition count 1442
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 896 transition count 1433
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 896 transition count 1433
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 894 transition count 1424
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 894 transition count 1424
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 893 transition count 1416
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 893 transition count 1416
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 892 transition count 1408
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 892 transition count 1408
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 891 transition count 1400
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 891 transition count 1400
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 890 transition count 1392
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 890 transition count 1392
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 889 transition count 1384
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 889 transition count 1384
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 888 transition count 1376
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 888 transition count 1376
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 887 transition count 1368
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 887 transition count 1368
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 886 transition count 1360
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 886 transition count 1360
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 885 transition count 1352
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 885 transition count 1352
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 884 transition count 1344
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 884 transition count 1344
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 883 transition count 1336
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 883 transition count 1336
Applied a total of 44 rules in 367 ms. Remains 883 /905 variables (removed 22) and now considering 1336/1475 (removed 139) transitions.
// Phase 1: matrix 1336 rows 883 cols
[2021-05-07 16:08:01] [INFO ] Computed 121 place invariants in 12 ms
[2021-05-07 16:08:01] [INFO ] Implicit Places using invariants in 411 ms returned [391, 590, 792, 793]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 412 ms to find 4 implicit places.
// Phase 1: matrix 1336 rows 879 cols
[2021-05-07 16:08:01] [INFO ] Computed 117 place invariants in 11 ms
[2021-05-07 16:08:02] [INFO ] Dead Transitions using invariants and state equation in 588 ms returned []
Starting structural reductions, iteration 1 : 879/905 places, 1336/1475 transitions.
Applied a total of 0 rules in 22 ms. Remains 879 /879 variables (removed 0) and now considering 1336/1336 (removed 0) transitions.
// Phase 1: matrix 1336 rows 879 cols
[2021-05-07 16:08:02] [INFO ] Computed 117 place invariants in 11 ms
[2021-05-07 16:08:03] [INFO ] Dead Transitions using invariants and state equation in 571 ms returned []
Finished structural reductions, in 2 iterations. Remains : 879/905 places, 1336/1475 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-04a-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s212 1) (EQ s431 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 90 steps with 0 reset in 2 ms.
FORMULA ASLink-PT-04a-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-04a-03 finished in 2028 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 905 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 905/905 places, 1475/1475 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 903 transition count 1461
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 903 transition count 1461
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 902 transition count 1453
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 902 transition count 1453
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 901 transition count 1445
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 901 transition count 1445
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 900 transition count 1437
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 900 transition count 1437
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 899 transition count 1429
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 899 transition count 1429
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 898 transition count 1421
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 898 transition count 1421
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 897 transition count 1413
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 897 transition count 1413
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 896 transition count 1405
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 896 transition count 1405
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 895 transition count 1397
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 895 transition count 1397
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 894 transition count 1389
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 894 transition count 1389
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 893 transition count 1381
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 893 transition count 1381
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 892 transition count 1373
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 892 transition count 1373
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 891 transition count 1365
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 891 transition count 1365
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 890 transition count 1357
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 890 transition count 1357
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 889 transition count 1349
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 889 transition count 1349
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 888 transition count 1341
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 888 transition count 1341
Applied a total of 34 rules in 365 ms. Remains 888 /905 variables (removed 17) and now considering 1341/1475 (removed 134) transitions.
// Phase 1: matrix 1341 rows 888 cols
[2021-05-07 16:08:03] [INFO ] Computed 121 place invariants in 11 ms
[2021-05-07 16:08:03] [INFO ] Implicit Places using invariants in 377 ms returned [391, 590, 792, 793]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 379 ms to find 4 implicit places.
// Phase 1: matrix 1341 rows 884 cols
[2021-05-07 16:08:03] [INFO ] Computed 117 place invariants in 10 ms
[2021-05-07 16:08:04] [INFO ] Dead Transitions using invariants and state equation in 571 ms returned []
Starting structural reductions, iteration 1 : 884/905 places, 1341/1475 transitions.
Applied a total of 0 rules in 22 ms. Remains 884 /884 variables (removed 0) and now considering 1341/1341 (removed 0) transitions.
// Phase 1: matrix 1341 rows 884 cols
[2021-05-07 16:08:04] [INFO ] Computed 117 place invariants in 11 ms
[2021-05-07 16:08:05] [INFO ] Dead Transitions using invariants and state equation in 575 ms returned []
Finished structural reductions, in 2 iterations. Remains : 884/905 places, 1341/1475 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ASLink-PT-04a-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s773 1) (EQ s828 1)), p1:(OR (NEQ s374 1) (NEQ s376 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 163 steps with 0 reset in 2 ms.
FORMULA ASLink-PT-04a-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-04a-04 finished in 2007 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 905 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 905/905 places, 1475/1475 transitions.
Drop transitions removed 152 transitions
Trivial Post-agglo rules discarded 152 transitions
Performed 152 trivial Post agglomeration. Transition count delta: 152
Iterating post reduction 0 with 152 rules applied. Total rules applied 152 place count 905 transition count 1323
Reduce places removed 152 places and 0 transitions.
Iterating post reduction 1 with 152 rules applied. Total rules applied 304 place count 753 transition count 1323
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 111 Pre rules applied. Total rules applied 304 place count 753 transition count 1212
Deduced a syphon composed of 111 places in 1 ms
Ensure Unique test removed 36 places
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 2 with 258 rules applied. Total rules applied 562 place count 606 transition count 1212
Discarding 3 places :
Implicit places reduction removed 3 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 2 with 4 rules applied. Total rules applied 566 place count 603 transition count 1211
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 567 place count 602 transition count 1211
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 567 place count 602 transition count 1195
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 599 place count 586 transition count 1195
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 603 place count 582 transition count 1179
Iterating global reduction 4 with 4 rules applied. Total rules applied 607 place count 582 transition count 1179
Discarding 1 places :
Implicit places reduction removed 1 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 4 with 2 rules applied. Total rules applied 609 place count 581 transition count 1178
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 610 place count 580 transition count 1178
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 610 place count 580 transition count 1177
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 612 place count 579 transition count 1177
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 614 place count 577 transition count 1168
Iterating global reduction 6 with 2 rules applied. Total rules applied 616 place count 577 transition count 1168
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 617 place count 577 transition count 1167
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 618 place count 576 transition count 1167
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 619 place count 575 transition count 1159
Iterating global reduction 8 with 1 rules applied. Total rules applied 620 place count 575 transition count 1159
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 621 place count 574 transition count 1151
Iterating global reduction 8 with 1 rules applied. Total rules applied 622 place count 574 transition count 1151
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 623 place count 573 transition count 1143
Iterating global reduction 8 with 1 rules applied. Total rules applied 624 place count 573 transition count 1143
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 625 place count 572 transition count 1135
Iterating global reduction 8 with 1 rules applied. Total rules applied 626 place count 572 transition count 1135
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 627 place count 571 transition count 1127
Iterating global reduction 8 with 1 rules applied. Total rules applied 628 place count 571 transition count 1127
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 629 place count 570 transition count 1119
Iterating global reduction 8 with 1 rules applied. Total rules applied 630 place count 570 transition count 1119
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 631 place count 569 transition count 1111
Iterating global reduction 8 with 1 rules applied. Total rules applied 632 place count 569 transition count 1111
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 633 place count 568 transition count 1103
Iterating global reduction 8 with 1 rules applied. Total rules applied 634 place count 568 transition count 1103
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 635 place count 567 transition count 1095
Iterating global reduction 8 with 1 rules applied. Total rules applied 636 place count 567 transition count 1095
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 637 place count 566 transition count 1087
Iterating global reduction 8 with 1 rules applied. Total rules applied 638 place count 566 transition count 1087
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 639 place count 565 transition count 1079
Iterating global reduction 8 with 1 rules applied. Total rules applied 640 place count 565 transition count 1079
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 641 place count 564 transition count 1071
Iterating global reduction 8 with 1 rules applied. Total rules applied 642 place count 564 transition count 1071
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 643 place count 563 transition count 1063
Iterating global reduction 8 with 1 rules applied. Total rules applied 644 place count 563 transition count 1063
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 645 place count 562 transition count 1055
Iterating global reduction 8 with 1 rules applied. Total rules applied 646 place count 562 transition count 1055
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 2 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 8 with 122 rules applied. Total rules applied 768 place count 501 transition count 994
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 770 place count 499 transition count 992
Iterating global reduction 8 with 2 rules applied. Total rules applied 772 place count 499 transition count 992
Applied a total of 772 rules in 394 ms. Remains 499 /905 variables (removed 406) and now considering 992/1475 (removed 483) transitions.
// Phase 1: matrix 992 rows 499 cols
[2021-05-07 16:08:05] [INFO ] Computed 81 place invariants in 10 ms
[2021-05-07 16:08:05] [INFO ] Implicit Places using invariants in 282 ms returned [90, 96, 101, 117, 187, 193, 198, 214, 215, 290, 296, 301, 317, 392, 400, 406, 425, 462, 463, 492]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 284 ms to find 20 implicit places.
[2021-05-07 16:08:05] [INFO ] Redundant transitions in 59 ms returned []
// Phase 1: matrix 992 rows 479 cols
[2021-05-07 16:08:05] [INFO ] Computed 61 place invariants in 9 ms
[2021-05-07 16:08:06] [INFO ] Dead Transitions using invariants and state equation in 405 ms returned []
Starting structural reductions, iteration 1 : 479/905 places, 992/1475 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 479 transition count 987
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 474 transition count 987
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 10 place count 474 transition count 974
Deduced a syphon composed of 13 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 27 rules applied. Total rules applied 37 place count 460 transition count 974
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 45 place count 452 transition count 966
Iterating global reduction 2 with 8 rules applied. Total rules applied 53 place count 452 transition count 966
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 61 place count 444 transition count 958
Iterating global reduction 2 with 8 rules applied. Total rules applied 69 place count 444 transition count 958
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 73 place count 440 transition count 954
Iterating global reduction 2 with 4 rules applied. Total rules applied 77 place count 440 transition count 954
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 95 place count 431 transition count 945
Applied a total of 95 rules in 73 ms. Remains 431 /479 variables (removed 48) and now considering 945/992 (removed 47) transitions.
// Phase 1: matrix 945 rows 431 cols
[2021-05-07 16:08:06] [INFO ] Computed 60 place invariants in 11 ms
[2021-05-07 16:08:06] [INFO ] Implicit Places using invariants in 280 ms returned [93, 96, 177, 180, 261, 264, 353, 356, 418, 421, 424, 428]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 281 ms to find 12 implicit places.
Starting structural reductions, iteration 2 : 419/905 places, 945/1475 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 419 transition count 937
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 411 transition count 937
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 23 place count 404 transition count 930
Iterating global reduction 2 with 7 rules applied. Total rules applied 30 place count 404 transition count 930
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 37 place count 404 transition count 923
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 39 place count 403 transition count 922
Applied a total of 39 rules in 43 ms. Remains 403 /419 variables (removed 16) and now considering 922/945 (removed 23) transitions.
// Phase 1: matrix 922 rows 403 cols
[2021-05-07 16:08:06] [INFO ] Computed 48 place invariants in 41 ms
[2021-05-07 16:08:07] [INFO ] Implicit Places using invariants in 279 ms returned [72, 151, 231, 312]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 281 ms to find 4 implicit places.
Starting structural reductions, iteration 3 : 399/905 places, 922/1475 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 395 transition count 918
Applied a total of 8 rules in 30 ms. Remains 395 /399 variables (removed 4) and now considering 918/922 (removed 4) transitions.
// Phase 1: matrix 918 rows 395 cols
[2021-05-07 16:08:07] [INFO ] Computed 44 place invariants in 8 ms
[2021-05-07 16:08:07] [INFO ] Implicit Places using invariants in 246 ms returned []
// Phase 1: matrix 918 rows 395 cols
[2021-05-07 16:08:07] [INFO ] Computed 44 place invariants in 7 ms
[2021-05-07 16:08:07] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-07 16:08:08] [INFO ] Implicit Places using invariants and state equation in 858 ms returned []
Implicit Place search using SMT with State Equation took 1105 ms to find 0 implicit places.
Finished structural reductions, in 4 iterations. Remains : 395/905 places, 918/1475 transitions.
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ASLink-PT-04a-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s271 1) (EQ s325 1)), p1:(OR (NEQ s342 1) (NEQ s376 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 75 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-04a-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-04a-05 finished in 3180 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(p0) U ((X(p0)&&p1)||X(G(p0)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 905 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 905/905 places, 1475/1475 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 902 transition count 1460
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 902 transition count 1460
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 900 transition count 1451
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 900 transition count 1451
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 898 transition count 1442
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 898 transition count 1442
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 896 transition count 1433
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 896 transition count 1433
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 894 transition count 1424
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 894 transition count 1424
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 893 transition count 1416
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 893 transition count 1416
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 892 transition count 1408
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 892 transition count 1408
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 891 transition count 1400
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 891 transition count 1400
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 890 transition count 1392
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 890 transition count 1392
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 889 transition count 1384
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 889 transition count 1384
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 888 transition count 1376
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 888 transition count 1376
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 887 transition count 1368
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 887 transition count 1368
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 886 transition count 1360
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 886 transition count 1360
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 885 transition count 1352
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 885 transition count 1352
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 884 transition count 1344
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 884 transition count 1344
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 883 transition count 1336
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 883 transition count 1336
Applied a total of 44 rules in 371 ms. Remains 883 /905 variables (removed 22) and now considering 1336/1475 (removed 139) transitions.
// Phase 1: matrix 1336 rows 883 cols
[2021-05-07 16:08:08] [INFO ] Computed 121 place invariants in 10 ms
[2021-05-07 16:08:09] [INFO ] Implicit Places using invariants in 379 ms returned [391, 590, 792, 793]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 400 ms to find 4 implicit places.
// Phase 1: matrix 1336 rows 879 cols
[2021-05-07 16:08:09] [INFO ] Computed 117 place invariants in 13 ms
[2021-05-07 16:08:09] [INFO ] Dead Transitions using invariants and state equation in 590 ms returned []
Starting structural reductions, iteration 1 : 879/905 places, 1336/1475 transitions.
Applied a total of 0 rules in 22 ms. Remains 879 /879 variables (removed 0) and now considering 1336/1336 (removed 0) transitions.
// Phase 1: matrix 1336 rows 879 cols
[2021-05-07 16:08:09] [INFO ] Computed 117 place invariants in 10 ms
[2021-05-07 16:08:10] [INFO ] Dead Transitions using invariants and state equation in 576 ms returned []
Finished structural reductions, in 2 iterations. Remains : 879/905 places, 1336/1475 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ASLink-PT-04a-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (NEQ s392 1) (NEQ s615 1)), p1:(AND (NEQ s392 0) (NEQ s615 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33312 reset in 778 ms.
Product exploration explored 100000 steps with 33435 reset in 749 ms.
Knowledge obtained : [p0, (NOT p1)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 33171 reset in 724 ms.
Product exploration explored 100000 steps with 33394 reset in 741 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0), true]
Support contains 2 out of 879 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 879/879 places, 1336/1336 transitions.
Performed 169 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 169 rules applied. Total rules applied 169 place count 879 transition count 1336
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 66 Pre rules applied. Total rules applied 169 place count 879 transition count 1395
Deduced a syphon composed of 235 places in 1 ms
Iterating global reduction 1 with 66 rules applied. Total rules applied 235 place count 879 transition count 1395
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 262 place count 852 transition count 1368
Deduced a syphon composed of 210 places in 1 ms
Iterating global reduction 1 with 27 rules applied. Total rules applied 289 place count 852 transition count 1368
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 289 place count 852 transition count 1368
Deduced a syphon composed of 211 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 290 place count 852 transition count 1368
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 291 place count 851 transition count 1367
Deduced a syphon composed of 210 places in 4 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 292 place count 851 transition count 1367
Performed 112 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 322 places in 1 ms
Iterating global reduction 1 with 112 rules applied. Total rules applied 404 place count 851 transition count 1382
Discarding 55 places :
Symmetric choice reduction at 1 with 55 rule applications. Total rules 459 place count 796 transition count 1327
Deduced a syphon composed of 267 places in 1 ms
Iterating global reduction 1 with 55 rules applied. Total rules applied 514 place count 796 transition count 1327
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 271 places in 1 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 518 place count 796 transition count 1343
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 272 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 519 place count 796 transition count 1347
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 521 place count 794 transition count 1341
Deduced a syphon composed of 270 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 523 place count 794 transition count 1341
Deduced a syphon composed of 270 places in 1 ms
Applied a total of 523 rules in 274 ms. Remains 794 /879 variables (removed 85) and now considering 1341/1336 (removed -5) transitions.
[2021-05-07 16:08:14] [INFO ] Redundant transitions in 293 ms returned []
// Phase 1: matrix 1341 rows 794 cols
[2021-05-07 16:08:14] [INFO ] Computed 117 place invariants in 12 ms
[2021-05-07 16:08:14] [INFO ] Dead Transitions using invariants and state equation in 622 ms returned []
Finished structural reductions, in 1 iterations. Remains : 794/879 places, 1341/1336 transitions.
Product exploration explored 100000 steps with 33276 reset in 3113 ms.
Product exploration explored 100000 steps with 33255 reset in 3006 ms.
[2021-05-07 16:08:21] [INFO ] Flatten gal took : 75 ms
[2021-05-07 16:08:21] [INFO ] Flatten gal took : 80 ms
[2021-05-07 16:08:21] [INFO ] Time to serialize gal into /tmp/LTL1105393023995216620.gal : 64 ms
[2021-05-07 16:08:21] [INFO ] Time to serialize properties into /tmp/LTL15289791944683827940.ltl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL1105393023995216620.gal, -t, CGAL, -LTL, /tmp/LTL15289791944683827940.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1105393023995216620.gal -t CGAL -LTL /tmp/LTL15289791944683827940.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X("((p427!=1)||(p666!=1))"))U((X(G("((p427!=1)||(p666!=1))")))||(("((p427!=0)&&(p666!=0))")&&(X("((p427!=1)||(p666!=1))"))))))
Formula 0 simplified : !(X"((p427!=1)||(p666!=1))" U (XG"((p427!=1)||(p666!=1))" | ("((p427!=0)&&(p666!=0))" & X"((p427!=1)||(p666!=1))")))
Detected timeout of ITS tools.
[2021-05-07 16:08:36] [INFO ] Flatten gal took : 54 ms
[2021-05-07 16:08:36] [INFO ] Applying decomposition
[2021-05-07 16:08:36] [INFO ] Flatten gal took : 52 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph17532731771506074362.txt, -o, /tmp/graph17532731771506074362.bin, -w, /tmp/graph17532731771506074362.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph17532731771506074362.bin, -l, -1, -v, -w, /tmp/graph17532731771506074362.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-07 16:08:36] [INFO ] Decomposing Gal with order
[2021-05-07 16:08:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-07 16:08:37] [INFO ] Removed a total of 1847 redundant transitions.
[2021-05-07 16:08:37] [INFO ] Flatten gal took : 136 ms
[2021-05-07 16:08:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 29 ms.
[2021-05-07 16:08:37] [INFO ] Time to serialize gal into /tmp/LTL3818664458509432711.gal : 18 ms
[2021-05-07 16:08:37] [INFO ] Time to serialize properties into /tmp/LTL14430336012590436020.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL3818664458509432711.gal, -t, CGAL, -LTL, /tmp/LTL14430336012590436020.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3818664458509432711.gal -t CGAL -LTL /tmp/LTL14430336012590436020.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((X("((i9.u120.p427!=1)||(i9.u187.p666!=1))"))U((X(G("((i9.u120.p427!=1)||(i9.u187.p666!=1))")))||(("((i9.u120.p427!=0)&&(i9.u187.p666!=0))")&&(X("((i9.u120.p427!=1)||(i9.u187.p666!=1))"))))))
Formula 0 simplified : !(X"((i9.u120.p427!=1)||(i9.u187.p666!=1))" U (XG"((i9.u120.p427!=1)||(i9.u187.p666!=1))" | ("((i9.u120.p427!=0)&&(i9.u187.p666!=0))" & X"((i9.u120.p427!=1)||(i9.u187.p666!=1))")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7764153222825147039
[2021-05-07 16:08:52] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7764153222825147039
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7764153222825147039]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7764153222825147039] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7764153222825147039] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property ASLink-PT-04a-06 finished in 44775 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(p0) U G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 905 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 905/905 places, 1475/1475 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 902 transition count 1460
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 902 transition count 1460
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 900 transition count 1451
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 900 transition count 1451
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 898 transition count 1442
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 898 transition count 1442
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 896 transition count 1433
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 896 transition count 1433
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 894 transition count 1424
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 894 transition count 1424
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 893 transition count 1416
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 893 transition count 1416
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 892 transition count 1408
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 892 transition count 1408
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 891 transition count 1400
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 891 transition count 1400
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 890 transition count 1392
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 890 transition count 1392
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 889 transition count 1384
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 889 transition count 1384
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 888 transition count 1376
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 888 transition count 1376
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 887 transition count 1368
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 887 transition count 1368
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 886 transition count 1360
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 886 transition count 1360
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 885 transition count 1352
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 885 transition count 1352
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 884 transition count 1344
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 884 transition count 1344
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 883 transition count 1336
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 883 transition count 1336
Applied a total of 44 rules in 434 ms. Remains 883 /905 variables (removed 22) and now considering 1336/1475 (removed 139) transitions.
// Phase 1: matrix 1336 rows 883 cols
[2021-05-07 16:08:53] [INFO ] Computed 121 place invariants in 10 ms
[2021-05-07 16:08:53] [INFO ] Implicit Places using invariants in 366 ms returned [391, 590, 792]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 373 ms to find 3 implicit places.
// Phase 1: matrix 1336 rows 880 cols
[2021-05-07 16:08:54] [INFO ] Computed 118 place invariants in 10 ms
[2021-05-07 16:08:54] [INFO ] Dead Transitions using invariants and state equation in 637 ms returned []
Starting structural reductions, iteration 1 : 880/905 places, 1336/1475 transitions.
Applied a total of 0 rules in 34 ms. Remains 880 /880 variables (removed 0) and now considering 1336/1336 (removed 0) transitions.
// Phase 1: matrix 1336 rows 880 cols
[2021-05-07 16:08:54] [INFO ] Computed 118 place invariants in 10 ms
[2021-05-07 16:08:55] [INFO ] Dead Transitions using invariants and state equation in 749 ms returned []
Finished structural reductions, in 2 iterations. Remains : 880/905 places, 1336/1475 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-04a-07 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (NEQ s790 1) (NEQ s805 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-04a-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-04a-07 finished in 2333 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 905 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 905/905 places, 1475/1475 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 152 transitions
Trivial Post-agglo rules discarded 152 transitions
Performed 152 trivial Post agglomeration. Transition count delta: 152
Iterating post reduction 0 with 152 rules applied. Total rules applied 152 place count 904 transition count 1322
Reduce places removed 156 places and 0 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 159 rules applied. Total rules applied 311 place count 748 transition count 1319
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 314 place count 745 transition count 1319
Performed 120 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 120 Pre rules applied. Total rules applied 314 place count 745 transition count 1199
Deduced a syphon composed of 120 places in 1 ms
Ensure Unique test removed 36 places
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 3 with 276 rules applied. Total rules applied 590 place count 589 transition count 1199
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 17 rules applied. Total rules applied 607 place count 581 transition count 1190
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 616 place count 572 transition count 1190
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 17 Pre rules applied. Total rules applied 616 place count 572 transition count 1173
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 650 place count 555 transition count 1173
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 658 place count 547 transition count 1153
Iterating global reduction 5 with 8 rules applied. Total rules applied 666 place count 547 transition count 1153
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Discarding 1 places :
Implicit places reduction removed 1 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 6 rules applied. Total rules applied 672 place count 546 transition count 1148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 673 place count 545 transition count 1148
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 673 place count 545 transition count 1147
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 675 place count 544 transition count 1147
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 677 place count 542 transition count 1138
Iterating global reduction 7 with 2 rules applied. Total rules applied 679 place count 542 transition count 1138
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 680 place count 542 transition count 1137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 681 place count 541 transition count 1137
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 682 place count 540 transition count 1129
Iterating global reduction 9 with 1 rules applied. Total rules applied 683 place count 540 transition count 1129
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 684 place count 539 transition count 1121
Iterating global reduction 9 with 1 rules applied. Total rules applied 685 place count 539 transition count 1121
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 686 place count 538 transition count 1113
Iterating global reduction 9 with 1 rules applied. Total rules applied 687 place count 538 transition count 1113
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 688 place count 537 transition count 1105
Iterating global reduction 9 with 1 rules applied. Total rules applied 689 place count 537 transition count 1105
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 690 place count 536 transition count 1097
Iterating global reduction 9 with 1 rules applied. Total rules applied 691 place count 536 transition count 1097
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 692 place count 535 transition count 1089
Iterating global reduction 9 with 1 rules applied. Total rules applied 693 place count 535 transition count 1089
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 694 place count 534 transition count 1081
Iterating global reduction 9 with 1 rules applied. Total rules applied 695 place count 534 transition count 1081
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 696 place count 533 transition count 1073
Iterating global reduction 9 with 1 rules applied. Total rules applied 697 place count 533 transition count 1073
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 9 with 114 rules applied. Total rules applied 811 place count 476 transition count 1016
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 813 place count 474 transition count 1014
Iterating global reduction 9 with 2 rules applied. Total rules applied 815 place count 474 transition count 1014
Applied a total of 815 rules in 169 ms. Remains 474 /905 variables (removed 431) and now considering 1014/1475 (removed 461) transitions.
// Phase 1: matrix 1014 rows 474 cols
[2021-05-07 16:08:55] [INFO ] Computed 72 place invariants in 8 ms
[2021-05-07 16:08:55] [INFO ] Implicit Places using invariants in 255 ms returned [72, 89, 95, 100, 159, 176, 182, 187, 189, 198, 251, 272, 278, 283, 285, 311, 346, 367, 375, 381, 383, 437, 438, 467]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 256 ms to find 24 implicit places.
[2021-05-07 16:08:55] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 1014 rows 450 cols
[2021-05-07 16:08:55] [INFO ] Computed 48 place invariants in 8 ms
[2021-05-07 16:08:56] [INFO ] Dead Transitions using invariants and state equation in 375 ms returned []
Starting structural reductions, iteration 1 : 450/905 places, 1014/1475 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 450 transition count 1005
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 441 transition count 1005
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 18 place count 441 transition count 1000
Deduced a syphon composed of 5 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 11 rules applied. Total rules applied 29 place count 435 transition count 1000
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 37 place count 427 transition count 992
Iterating global reduction 2 with 8 rules applied. Total rules applied 45 place count 427 transition count 992
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 53 place count 419 transition count 984
Iterating global reduction 2 with 8 rules applied. Total rules applied 61 place count 419 transition count 984
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 65 place count 415 transition count 980
Iterating global reduction 2 with 4 rules applied. Total rules applied 69 place count 415 transition count 980
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 93 place count 403 transition count 968
Applied a total of 93 rules in 57 ms. Remains 403 /450 variables (removed 47) and now considering 968/1014 (removed 46) transitions.
// Phase 1: matrix 968 rows 403 cols
[2021-05-07 16:08:56] [INFO ] Computed 47 place invariants in 7 ms
[2021-05-07 16:08:56] [INFO ] Implicit Places using invariants in 240 ms returned [390, 393, 396, 400]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 241 ms to find 4 implicit places.
Starting structural reductions, iteration 2 : 399/905 places, 968/1475 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 0 with 4 rules applied. Total rules applied 4 place count 399 transition count 964
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 395 transition count 964
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 11 place count 392 transition count 961
Iterating global reduction 2 with 3 rules applied. Total rules applied 14 place count 392 transition count 961
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 17 place count 392 transition count 958
Applied a total of 17 rules in 26 ms. Remains 392 /399 variables (removed 7) and now considering 958/968 (removed 10) transitions.
// Phase 1: matrix 958 rows 392 cols
[2021-05-07 16:08:56] [INFO ] Computed 43 place invariants in 7 ms
[2021-05-07 16:08:56] [INFO ] Implicit Places using invariants in 213 ms returned []
// Phase 1: matrix 958 rows 392 cols
[2021-05-07 16:08:56] [INFO ] Computed 43 place invariants in 28 ms
[2021-05-07 16:08:57] [INFO ] Implicit Places using invariants and state equation in 755 ms returned []
Implicit Place search using SMT with State Equation took 969 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 392/905 places, 958/1475 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-04a-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s266 1) (EQ s345 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-04a-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-04a-09 finished in 2170 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 905 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 905/905 places, 1475/1475 transitions.
Drop transitions removed 147 transitions
Trivial Post-agglo rules discarded 147 transitions
Performed 147 trivial Post agglomeration. Transition count delta: 147
Iterating post reduction 0 with 147 rules applied. Total rules applied 147 place count 905 transition count 1328
Reduce places removed 147 places and 0 transitions.
Iterating post reduction 1 with 147 rules applied. Total rules applied 294 place count 758 transition count 1328
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 111 Pre rules applied. Total rules applied 294 place count 758 transition count 1217
Deduced a syphon composed of 111 places in 1 ms
Ensure Unique test removed 36 places
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 2 with 258 rules applied. Total rules applied 552 place count 611 transition count 1217
Discarding 3 places :
Implicit places reduction removed 3 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 2 with 4 rules applied. Total rules applied 556 place count 608 transition count 1216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 557 place count 607 transition count 1216
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 557 place count 607 transition count 1200
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 589 place count 591 transition count 1200
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 593 place count 587 transition count 1184
Iterating global reduction 4 with 4 rules applied. Total rules applied 597 place count 587 transition count 1184
Discarding 1 places :
Implicit places reduction removed 1 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 4 with 2 rules applied. Total rules applied 599 place count 586 transition count 1183
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 600 place count 585 transition count 1183
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 600 place count 585 transition count 1182
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 602 place count 584 transition count 1182
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 604 place count 582 transition count 1173
Iterating global reduction 6 with 2 rules applied. Total rules applied 606 place count 582 transition count 1173
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 607 place count 582 transition count 1172
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 608 place count 581 transition count 1172
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 609 place count 580 transition count 1164
Iterating global reduction 8 with 1 rules applied. Total rules applied 610 place count 580 transition count 1164
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 611 place count 579 transition count 1156
Iterating global reduction 8 with 1 rules applied. Total rules applied 612 place count 579 transition count 1156
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 613 place count 578 transition count 1148
Iterating global reduction 8 with 1 rules applied. Total rules applied 614 place count 578 transition count 1148
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 615 place count 577 transition count 1140
Iterating global reduction 8 with 1 rules applied. Total rules applied 616 place count 577 transition count 1140
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 617 place count 576 transition count 1132
Iterating global reduction 8 with 1 rules applied. Total rules applied 618 place count 576 transition count 1132
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 619 place count 575 transition count 1124
Iterating global reduction 8 with 1 rules applied. Total rules applied 620 place count 575 transition count 1124
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 621 place count 574 transition count 1116
Iterating global reduction 8 with 1 rules applied. Total rules applied 622 place count 574 transition count 1116
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 623 place count 573 transition count 1108
Iterating global reduction 8 with 1 rules applied. Total rules applied 624 place count 573 transition count 1108
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 625 place count 572 transition count 1100
Iterating global reduction 8 with 1 rules applied. Total rules applied 626 place count 572 transition count 1100
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 627 place count 571 transition count 1092
Iterating global reduction 8 with 1 rules applied. Total rules applied 628 place count 571 transition count 1092
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 629 place count 570 transition count 1084
Iterating global reduction 8 with 1 rules applied. Total rules applied 630 place count 570 transition count 1084
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 631 place count 569 transition count 1076
Iterating global reduction 8 with 1 rules applied. Total rules applied 632 place count 569 transition count 1076
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 633 place count 568 transition count 1068
Iterating global reduction 8 with 1 rules applied. Total rules applied 634 place count 568 transition count 1068
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 635 place count 567 transition count 1060
Iterating global reduction 8 with 1 rules applied. Total rules applied 636 place count 567 transition count 1060
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 8 with 120 rules applied. Total rules applied 756 place count 507 transition count 1000
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 759 place count 504 transition count 997
Iterating global reduction 8 with 3 rules applied. Total rules applied 762 place count 504 transition count 997
Applied a total of 762 rules in 254 ms. Remains 504 /905 variables (removed 401) and now considering 997/1475 (removed 478) transitions.
// Phase 1: matrix 997 rows 504 cols
[2021-05-07 16:08:57] [INFO ] Computed 81 place invariants in 8 ms
[2021-05-07 16:08:58] [INFO ] Implicit Places using invariants in 290 ms returned [95, 101, 106, 122, 192, 198, 203, 219, 220, 295, 301, 306, 322, 340, 397, 405, 411, 430, 467, 468, 497]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 292 ms to find 21 implicit places.
[2021-05-07 16:08:58] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 997 rows 483 cols
[2021-05-07 16:08:58] [INFO ] Computed 60 place invariants in 8 ms
[2021-05-07 16:08:58] [INFO ] Dead Transitions using invariants and state equation in 374 ms returned []
Starting structural reductions, iteration 1 : 483/905 places, 997/1475 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 483 transition count 988
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 474 transition count 988
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 18 place count 474 transition count 975
Deduced a syphon composed of 13 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 27 rules applied. Total rules applied 45 place count 460 transition count 975
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 53 place count 452 transition count 967
Iterating global reduction 2 with 8 rules applied. Total rules applied 61 place count 452 transition count 967
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 69 place count 444 transition count 959
Iterating global reduction 2 with 8 rules applied. Total rules applied 77 place count 444 transition count 959
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 81 place count 440 transition count 955
Iterating global reduction 2 with 4 rules applied. Total rules applied 85 place count 440 transition count 955
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 109 place count 428 transition count 943
Applied a total of 109 rules in 53 ms. Remains 428 /483 variables (removed 55) and now considering 943/997 (removed 54) transitions.
// Phase 1: matrix 943 rows 428 cols
[2021-05-07 16:08:58] [INFO ] Computed 59 place invariants in 7 ms
[2021-05-07 16:08:58] [INFO ] Implicit Places using invariants in 235 ms returned [98, 101, 182, 185, 266, 269, 350, 353, 415, 418, 421, 425]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 237 ms to find 12 implicit places.
Starting structural reductions, iteration 2 : 416/905 places, 943/1475 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 416 transition count 935
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 408 transition count 935
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 23 place count 401 transition count 928
Iterating global reduction 2 with 7 rules applied. Total rules applied 30 place count 401 transition count 928
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 37 place count 401 transition count 921
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 39 place count 400 transition count 920
Applied a total of 39 rules in 35 ms. Remains 400 /416 variables (removed 16) and now considering 920/943 (removed 23) transitions.
// Phase 1: matrix 920 rows 400 cols
[2021-05-07 16:08:58] [INFO ] Computed 47 place invariants in 11 ms
[2021-05-07 16:08:59] [INFO ] Implicit Places using invariants in 221 ms returned [73, 156, 236, 316]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 222 ms to find 4 implicit places.
Starting structural reductions, iteration 3 : 396/905 places, 920/1475 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 392 transition count 916
Applied a total of 8 rules in 20 ms. Remains 392 /396 variables (removed 4) and now considering 916/920 (removed 4) transitions.
// Phase 1: matrix 916 rows 392 cols
[2021-05-07 16:08:59] [INFO ] Computed 43 place invariants in 7 ms
[2021-05-07 16:08:59] [INFO ] Implicit Places using invariants in 212 ms returned []
// Phase 1: matrix 916 rows 392 cols
[2021-05-07 16:08:59] [INFO ] Computed 43 place invariants in 7 ms
[2021-05-07 16:08:59] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-07 16:09:00] [INFO ] Implicit Places using invariants and state equation in 823 ms returned []
Implicit Place search using SMT with State Equation took 1036 ms to find 0 implicit places.
Finished structural reductions, in 4 iterations. Remains : 392/905 places, 916/1475 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-04a-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s37 1) (EQ s140 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-04a-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-04a-10 finished in 2580 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X((p1||X((p2&&X(F(p2))))))&&p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 905 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 905/905 places, 1475/1475 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 903 transition count 1468
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 903 transition count 1468
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 902 transition count 1467
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 902 transition count 1467
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 901 transition count 1466
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 901 transition count 1466
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 900 transition count 1465
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 900 transition count 1465
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 899 transition count 1464
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 899 transition count 1464
Applied a total of 12 rules in 150 ms. Remains 899 /905 variables (removed 6) and now considering 1464/1475 (removed 11) transitions.
// Phase 1: matrix 1464 rows 899 cols
[2021-05-07 16:09:00] [INFO ] Computed 121 place invariants in 12 ms
[2021-05-07 16:09:00] [INFO ] Implicit Places using invariants in 389 ms returned [391, 590, 808, 809]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 391 ms to find 4 implicit places.
// Phase 1: matrix 1464 rows 895 cols
[2021-05-07 16:09:00] [INFO ] Computed 117 place invariants in 11 ms
[2021-05-07 16:09:01] [INFO ] Dead Transitions using invariants and state equation in 613 ms returned []
Starting structural reductions, iteration 1 : 895/905 places, 1464/1475 transitions.
Applied a total of 0 rules in 22 ms. Remains 895 /895 variables (removed 0) and now considering 1464/1464 (removed 0) transitions.
// Phase 1: matrix 1464 rows 895 cols
[2021-05-07 16:09:01] [INFO ] Computed 117 place invariants in 40 ms
[2021-05-07 16:09:02] [INFO ] Dead Transitions using invariants and state equation in 688 ms returned []
Finished structural reductions, in 2 iterations. Remains : 895/905 places, 1464/1475 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2), true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ASLink-PT-04a-11 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=p2, acceptance={} source=3 dest: 0}, { cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 2}]], initial=5, aps=[p2:(EQ s287 1), p1:(AND (EQ s583 1) (EQ s754 1)), p0:(AND (EQ s583 1) (EQ s756 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-04a-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-04a-11 finished in 2024 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14015881959711160744
[2021-05-07 16:09:02] [INFO ] Computing symmetric may disable matrix : 1475 transitions.
[2021-05-07 16:09:02] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-07 16:09:02] [INFO ] Computing symmetric may enable matrix : 1475 transitions.
[2021-05-07 16:09:02] [INFO ] Applying decomposition
[2021-05-07 16:09:02] [INFO ] Computation of Complete enable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-07 16:09:02] [INFO ] Flatten gal took : 51 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph2342123547149313239.txt, -o, /tmp/graph2342123547149313239.bin, -w, /tmp/graph2342123547149313239.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph2342123547149313239.bin, -l, -1, -v, -w, /tmp/graph2342123547149313239.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-07 16:09:02] [INFO ] Decomposing Gal with order
[2021-05-07 16:09:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-07 16:09:02] [INFO ] Removed a total of 2172 redundant transitions.
[2021-05-07 16:09:02] [INFO ] Flatten gal took : 120 ms
[2021-05-07 16:09:02] [INFO ] Computing Do-Not-Accords matrix : 1475 transitions.
[2021-05-07 16:09:02] [INFO ] Computation of Completed DNA matrix. took 64 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-07 16:09:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 53 labels/synchronizations in 34 ms.
[2021-05-07 16:09:02] [INFO ] Time to serialize gal into /tmp/LTLFireability8163353337744469601.gal : 10 ms
[2021-05-07 16:09:02] [INFO ] Time to serialize properties into /tmp/LTLFireability9996778934713344677.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability8163353337744469601.gal, -t, CGAL, -LTL, /tmp/LTLFireability9996778934713344677.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
[2021-05-07 16:09:02] [INFO ] Built C files in 520ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14015881959711160744
its-ltl command run as :
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin14015881959711160744]
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability8163353337744469601.gal -t CGAL -LTL /tmp/LTLFireability9996778934713344677.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((X(!("((i12.u117.p427==1)&&(i12.u180.p666==1))")))U(((!("((i12.u117.p427==0)||(i12.u180.p666==0))"))&&(X(!("((i12.u117.p427==1)&&(i12.u180.p666==1))"))))||(G(X(!("((i12.u117.p427==1)&&(i12.u180.p666==1))")))))))
Formula 0 simplified : !(X!"((i12.u117.p427==1)&&(i12.u180.p666==1))" U ((!"((i12.u117.p427==0)||(i12.u180.p666==0))" & X!"((i12.u117.p427==1)&&(i12.u180.p666==1))") | GX!"((i12.u117.p427==1)&&(i12.u180.p666==1))"))
Compilation finished in 12835 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin14015881959711160744]
Link finished in 94 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (X((LTLAPp0==true)) U ((X((LTLAPp0==true))&&(LTLAPp1==true))||X([]((LTLAPp0==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin14015881959711160744]
WARNING : LTSmin timed out (>327 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (X((LTLAPp0==true)) U ((X((LTLAPp0==true))&&(LTLAPp1==true))||X([]((LTLAPp0==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin14015881959711160744]
Retrying LTSmin with larger timeout 2616 s
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (X((LTLAPp0==true)) U ((X((LTLAPp0==true))&&(LTLAPp1==true))||X([]((LTLAPp0==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin14015881959711160744]
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t6, t7, t8, t9, t13, t14, t15, t16, t19, t20, t21, t35, t1220, t1279, t1302, t1360, t1361, t1384, t1439, t1466, t1525, i1.i0.u37.t193, i1.i1.u45.t203, i1.i2.u51.t213, i2.t4, i2.i1.t0, i3.t5, i5.i0.u89.t174, i5.i2.u99.t164, i5.i3.u106.t154, i6.t10, i6.i3.t11, i7.i0.t12, i9.t23, i10.i0.u139.t231, i10.i1.u147.t241, i10.i2.u155.t251, i11.t17, i12.t1355, i13.t22, i13.i0.t18, i14.i0.u196.t136, i14.i1.u201.t126, i14.i2.u208.t116, i15.i1.t993, i15.i1.t1121, i16.t872, i16.t871, i16.t870, i16.i2.t279, i16.i2.t286, i16.i2.t1181, i16.i2.t1182, i16.i2.t1187, i16.i2.t1194, i16.i2.t1211, i16.i2.u253.t282, i17.t37, i17.t34, i17.t33, i17.t32, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :676/704/64/1444
Computing Next relation with stutter on 1.60785e+11 deadlock states
Detected timeout of ITS tools.
[2021-05-07 16:29:58] [INFO ] Applying decomposition
[2021-05-07 16:29:58] [INFO ] Flatten gal took : 165 ms
[2021-05-07 16:29:58] [INFO ] Decomposing Gal with order
[2021-05-07 16:29:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-07 16:29:58] [INFO ] Removed a total of 1778 redundant transitions.
[2021-05-07 16:29:58] [INFO ] Flatten gal took : 319 ms
[2021-05-07 16:29:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 588 labels/synchronizations in 95 ms.
[2021-05-07 16:29:58] [INFO ] Time to serialize gal into /tmp/LTLFireability18294998447530654272.gal : 21 ms
[2021-05-07 16:29:58] [INFO ] Time to serialize properties into /tmp/LTLFireability9972127154183518247.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability18294998447530654272.gal, -t, CGAL, -LTL, /tmp/LTLFireability9972127154183518247.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability18294998447530654272.gal -t CGAL -LTL /tmp/LTLFireability9972127154183518247.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((X(!("((u74.p427==1)&&(u111.p666==1))")))U(((!("((u74.p427==0)||(u111.p666==0))"))&&(X(!("((u74.p427==1)&&(u111.p666==1))"))))||(G(X(!("((u74.p427==1)&&(u111.p666==1))")))))))
Formula 0 simplified : !(X!"((u74.p427==1)&&(u111.p666==1))" U ((!"((u74.p427==0)||(u111.p666==0))" & X!"((u74.p427==1)&&(u111.p666==1))") | GX!"((u74.p427==1)&&(u111.p666==1))"))
Reverse transition relation is NOT exact ! Due to transitions t864, t1064, t1181, t1182, t1187, t1194, t1211, t1220, t1279, t1302, t1337, t1357, t1384, t1443, t1466, t1525, i5.t5, i5.t4, i5.t3, i5.t2, i5.t1, i5.t0, i5.u13.t193, i5.u18.t203, i5.u23.t213, i13.t11, i13.t10, i13.t9, i13.t8, i13.t7, i13.t6, i13.u48.t174, i13.u53.t164, i13.u58.t154, i21.t17, i21.t16, i21.t15, i21.t14, i21.t13, i21.t12, i21.u83.t231, i21.u88.t241, i21.u93.t251, i29.t23, i29.t22, i29.t21, i29.t20, i29.t19, i29.t18, i29.u118.t136, i29.u123.t126, i29.u128.t116, i38.t37, i38.t35, i38.t34, i38.t33, i38.t32, i38.u149.t286, i38.u151.t282, i38.u209.t279, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/396/60/456
Computing Next relation with stutter on 1.60785e+11 deadlock states
Detected timeout of ITS tools.
[2021-05-07 16:50:54] [INFO ] Flatten gal took : 132 ms
[2021-05-07 16:50:55] [INFO ] Input system was already deterministic with 1475 transitions.
[2021-05-07 16:50:55] [INFO ] Transformed 905 places.
[2021-05-07 16:50:55] [INFO ] Transformed 1475 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-07 16:51:23] [INFO ] Time to serialize gal into /tmp/LTLFireability18026729677071767967.gal : 77 ms
[2021-05-07 16:51:23] [INFO ] Time to serialize properties into /tmp/LTLFireability7986872619322833452.ltl : 8 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability18026729677071767967.gal, -t, CGAL, -LTL, /tmp/LTLFireability7986872619322833452.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability18026729677071767967.gal -t CGAL -LTL /tmp/LTLFireability7986872619322833452.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((X(!("((p427==1)&&(p666==1))")))U(((!("((p427==0)||(p666==0))"))&&(X(!("((p427==1)&&(p666==1))"))))||(G(X(!("((p427==1)&&(p666==1))")))))))
Formula 0 simplified : !(X!"((p427==1)&&(p666==1))" U ((!"((p427==0)||(p666==0))" & X!"((p427==1)&&(p666==1))") | GX!"((p427==1)&&(p666==1))"))
WARNING : LTSmin timed out (>2616 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (X((LTLAPp0==true)) U ((X((LTLAPp0==true))&&(LTLAPp1==true))||X([]((LTLAPp0==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin14015881959711160744]
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-04a"
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-04a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r007-tall-162037989500058"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-04a.tgz
mv ASLink-PT-04a 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 ;