Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r197-tall-171640625100197.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is FunctionPointer-PT-c064, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-tall-171640625100197
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 19 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 11 16:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 11 16:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 4.2M May 18 16:42 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 FunctionPointer-PT-c064-LTLCardinality-00
FORMULA_NAME FunctionPointer-PT-c064-LTLCardinality-01
FORMULA_NAME FunctionPointer-PT-c064-LTLCardinality-02
FORMULA_NAME FunctionPointer-PT-c064-LTLCardinality-03
FORMULA_NAME FunctionPointer-PT-c064-LTLCardinality-04
FORMULA_NAME FunctionPointer-PT-c064-LTLCardinality-05
FORMULA_NAME FunctionPointer-PT-c064-LTLCardinality-06
FORMULA_NAME FunctionPointer-PT-c064-LTLCardinality-07
FORMULA_NAME FunctionPointer-PT-c064-LTLCardinality-08
FORMULA_NAME FunctionPointer-PT-c064-LTLCardinality-09
FORMULA_NAME FunctionPointer-PT-c064-LTLCardinality-10
FORMULA_NAME FunctionPointer-PT-c064-LTLCardinality-11
FORMULA_NAME FunctionPointer-PT-c064-LTLCardinality-12
FORMULA_NAME FunctionPointer-PT-c064-LTLCardinality-13
FORMULA_NAME FunctionPointer-PT-c064-LTLCardinality-14
FORMULA_NAME FunctionPointer-PT-c064-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716537147890

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c064
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-24 07:52:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 07:52:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 07:52:29] [INFO ] Load time of PNML (sax parser for PT used): 328 ms
[2024-05-24 07:52:29] [INFO ] Transformed 2826 places.
[2024-05-24 07:52:29] [INFO ] Transformed 8960 transitions.
[2024-05-24 07:52:29] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 528 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 1198 places in 38 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c064-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 9 out of 1628 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 1612 transition count 5962
Discarding 299 places :
Symmetric choice reduction at 1 with 299 rule applications. Total rules 315 place count 1313 transition count 3682
Iterating global reduction 1 with 299 rules applied. Total rules applied 614 place count 1313 transition count 3682
Ensure Unique test removed 360 transitions
Reduce isomorphic transitions removed 360 transitions.
Iterating post reduction 1 with 360 rules applied. Total rules applied 974 place count 1313 transition count 3322
Discarding 156 places :
Symmetric choice reduction at 2 with 156 rule applications. Total rules 1130 place count 1157 transition count 3010
Iterating global reduction 2 with 156 rules applied. Total rules applied 1286 place count 1157 transition count 3010
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 2 with 68 rules applied. Total rules applied 1354 place count 1157 transition count 2942
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1367 place count 1144 transition count 2916
Iterating global reduction 3 with 13 rules applied. Total rules applied 1380 place count 1144 transition count 2916
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1393 place count 1131 transition count 2890
Iterating global reduction 3 with 13 rules applied. Total rules applied 1406 place count 1131 transition count 2890
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1419 place count 1118 transition count 2864
Iterating global reduction 3 with 13 rules applied. Total rules applied 1432 place count 1118 transition count 2864
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1445 place count 1105 transition count 2838
Iterating global reduction 3 with 13 rules applied. Total rules applied 1458 place count 1105 transition count 2838
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1471 place count 1092 transition count 2812
Iterating global reduction 3 with 13 rules applied. Total rules applied 1484 place count 1092 transition count 2812
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1497 place count 1079 transition count 2786
Iterating global reduction 3 with 13 rules applied. Total rules applied 1510 place count 1079 transition count 2786
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1523 place count 1066 transition count 2760
Iterating global reduction 3 with 13 rules applied. Total rules applied 1536 place count 1066 transition count 2760
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 1588 place count 1014 transition count 2566
Iterating global reduction 3 with 52 rules applied. Total rules applied 1640 place count 1014 transition count 2566
Discarding 59 places :
Symmetric choice reduction at 3 with 59 rule applications. Total rules 1699 place count 955 transition count 2330
Iterating global reduction 3 with 59 rules applied. Total rules applied 1758 place count 955 transition count 2330
Discarding 59 places :
Symmetric choice reduction at 3 with 59 rule applications. Total rules 1817 place count 896 transition count 2184
Iterating global reduction 3 with 59 rules applied. Total rules applied 1876 place count 896 transition count 2184
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 1934 place count 838 transition count 2068
Iterating global reduction 3 with 58 rules applied. Total rules applied 1992 place count 838 transition count 2068
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 2050 place count 780 transition count 1952
Iterating global reduction 3 with 58 rules applied. Total rules applied 2108 place count 780 transition count 1952
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 2166 place count 722 transition count 1836
Iterating global reduction 3 with 58 rules applied. Total rules applied 2224 place count 722 transition count 1836
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 2280 place count 666 transition count 1724
Iterating global reduction 3 with 56 rules applied. Total rules applied 2336 place count 666 transition count 1724
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 2350 place count 652 transition count 1696
Iterating global reduction 3 with 14 rules applied. Total rules applied 2364 place count 652 transition count 1696
Applied a total of 2364 rules in 1877 ms. Remains 652 /1628 variables (removed 976) and now considering 1696/5962 (removed 4266) transitions.
[2024-05-24 07:52:32] [INFO ] Flow matrix only has 1139 transitions (discarded 557 similar events)
// Phase 1: matrix 1139 rows 652 cols
[2024-05-24 07:52:32] [INFO ] Computed 2 invariants in 27 ms
[2024-05-24 07:52:32] [INFO ] Implicit Places using invariants in 605 ms returned []
[2024-05-24 07:52:32] [INFO ] Flow matrix only has 1139 transitions (discarded 557 similar events)
[2024-05-24 07:52:32] [INFO ] Invariant cache hit.
[2024-05-24 07:52:33] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-24 07:52:35] [INFO ] Implicit Places using invariants and state equation in 2985 ms returned []
Implicit Place search using SMT with State Equation took 3615 ms to find 0 implicit places.
[2024-05-24 07:52:35] [INFO ] Flow matrix only has 1139 transitions (discarded 557 similar events)
[2024-05-24 07:52:35] [INFO ] Invariant cache hit.
[2024-05-24 07:52:36] [INFO ] Dead Transitions using invariants and state equation in 521 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 652/1628 places, 1696/5962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6016 ms. Remains : 652/1628 places, 1696/5962 transitions.
Support contains 9 out of 652 places after structural reductions.
[2024-05-24 07:52:36] [INFO ] Flatten gal took : 160 ms
[2024-05-24 07:52:36] [INFO ] Flatten gal took : 83 ms
[2024-05-24 07:52:36] [INFO ] Input system was already deterministic with 1696 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-24 07:52:37] [INFO ] Flow matrix only has 1139 transitions (discarded 557 similar events)
[2024-05-24 07:52:37] [INFO ] Invariant cache hit.
[2024-05-24 07:52:37] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-24 07:52:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-24 07:52:37] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 07:52:37] [INFO ] After 402ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-24 07:52:37] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-24 07:52:38] [INFO ] After 242ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-24 07:52:38] [INFO ] After 601ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 202 ms.
[2024-05-24 07:52:38] [INFO ] After 1428ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 135 ms.
Support contains 6 out of 652 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 652/652 places, 1696/1696 transitions.
Graph (complete) has 2821 edges and 652 vertex of which 460 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.5 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 460 transition count 1312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 386 place count 459 transition count 1310
Iterating global reduction 1 with 1 rules applied. Total rules applied 387 place count 459 transition count 1310
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 397 place count 459 transition count 1300
Applied a total of 397 rules in 222 ms. Remains 459 /652 variables (removed 193) and now considering 1300/1696 (removed 396) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 223 ms. Remains : 459/652 places, 1300/1696 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-24 07:52:39] [INFO ] Flow matrix only has 749 transitions (discarded 551 similar events)
// Phase 1: matrix 749 rows 459 cols
[2024-05-24 07:52:39] [INFO ] Computed 3 invariants in 4 ms
[2024-05-24 07:52:39] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-24 07:52:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-24 07:52:39] [INFO ] After 250ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-24 07:52:39] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-24 07:52:39] [INFO ] After 162ms SMT Verify possible using 91 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-24 07:52:40] [INFO ] After 359ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 118 ms.
[2024-05-24 07:52:40] [INFO ] After 859ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 83 ms.
Support contains 5 out of 459 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 459/459 places, 1300/1300 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 458 transition count 1296
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 458 transition count 1296
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 457 transition count 1294
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 457 transition count 1294
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 456 transition count 1292
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 456 transition count 1292
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 455 transition count 1290
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 455 transition count 1290
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 454 transition count 1288
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 454 transition count 1288
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 453 transition count 1286
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 453 transition count 1286
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 452 transition count 1284
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 452 transition count 1284
Applied a total of 14 rules in 132 ms. Remains 452 /459 variables (removed 7) and now considering 1284/1300 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 452/459 places, 1284/1300 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :1
Running SMT prover for 4 properties.
[2024-05-24 07:52:40] [INFO ] Flow matrix only has 737 transitions (discarded 547 similar events)
// Phase 1: matrix 737 rows 452 cols
[2024-05-24 07:52:40] [INFO ] Computed 3 invariants in 11 ms
[2024-05-24 07:52:40] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 07:52:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 07:52:41] [INFO ] After 240ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 07:52:41] [INFO ] State equation strengthened by 88 read => feed constraints.
[2024-05-24 07:52:41] [INFO ] After 116ms SMT Verify possible using 88 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-24 07:52:41] [INFO ] After 264ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 89 ms.
[2024-05-24 07:52:41] [INFO ] After 713ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 46 ms.
Support contains 4 out of 452 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 452/452 places, 1284/1284 transitions.
Graph (complete) has 2211 edges and 452 vertex of which 451 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 450 transition count 1282
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 450 transition count 1282
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 449 transition count 1280
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 449 transition count 1280
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6 place count 448 transition count 1278
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 448 transition count 1278
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 8 place count 447 transition count 1276
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 447 transition count 1276
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 10 place count 446 transition count 1274
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 446 transition count 1274
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 12 place count 445 transition count 1272
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 445 transition count 1272
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 14 place count 444 transition count 1270
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 444 transition count 1270
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 16 place count 443 transition count 1268
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 443 transition count 1268
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 442 transition count 1266
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 442 transition count 1266
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 20 place count 441 transition count 1262
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 441 transition count 1262
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 22 place count 440 transition count 1260
Iterating global reduction 0 with 1 rules applied. Total rules applied 23 place count 440 transition count 1260
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 24 place count 439 transition count 1258
Iterating global reduction 0 with 1 rules applied. Total rules applied 25 place count 439 transition count 1258
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 26 place count 438 transition count 1256
Iterating global reduction 0 with 1 rules applied. Total rules applied 27 place count 438 transition count 1256
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 28 place count 437 transition count 1254
Iterating global reduction 0 with 1 rules applied. Total rules applied 29 place count 437 transition count 1254
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 30 place count 436 transition count 1252
Iterating global reduction 0 with 1 rules applied. Total rules applied 31 place count 436 transition count 1252
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 32 place count 435 transition count 1250
Iterating global reduction 0 with 1 rules applied. Total rules applied 33 place count 435 transition count 1250
Applied a total of 33 rules in 199 ms. Remains 435 /452 variables (removed 17) and now considering 1250/1284 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 199 ms. Remains : 435/452 places, 1250/1284 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 247092 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :{}
Probabilistic random walk after 247092 steps, saw 151528 distinct states, run finished after 3002 ms. (steps per millisecond=82 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-24 07:52:44] [INFO ] Flow matrix only has 713 transitions (discarded 537 similar events)
// Phase 1: matrix 713 rows 435 cols
[2024-05-24 07:52:44] [INFO ] Computed 3 invariants in 14 ms
[2024-05-24 07:52:45] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 07:52:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-24 07:52:45] [INFO ] After 224ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 07:52:45] [INFO ] State equation strengthened by 83 read => feed constraints.
[2024-05-24 07:52:45] [INFO ] After 103ms SMT Verify possible using 83 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-24 07:52:45] [INFO ] After 245ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 90 ms.
[2024-05-24 07:52:45] [INFO ] After 665ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 42 ms.
Support contains 4 out of 435 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 435/435 places, 1250/1250 transitions.
Applied a total of 0 rules in 70 ms. Remains 435 /435 variables (removed 0) and now considering 1250/1250 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 435/435 places, 1250/1250 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 435/435 places, 1250/1250 transitions.
Applied a total of 0 rules in 72 ms. Remains 435 /435 variables (removed 0) and now considering 1250/1250 (removed 0) transitions.
[2024-05-24 07:52:45] [INFO ] Flow matrix only has 713 transitions (discarded 537 similar events)
[2024-05-24 07:52:45] [INFO ] Invariant cache hit.
[2024-05-24 07:52:46] [INFO ] Implicit Places using invariants in 290 ms returned []
[2024-05-24 07:52:46] [INFO ] Flow matrix only has 713 transitions (discarded 537 similar events)
[2024-05-24 07:52:46] [INFO ] Invariant cache hit.
[2024-05-24 07:52:46] [INFO ] State equation strengthened by 83 read => feed constraints.
[2024-05-24 07:52:47] [INFO ] Implicit Places using invariants and state equation in 933 ms returned []
Implicit Place search using SMT with State Equation took 1225 ms to find 0 implicit places.
[2024-05-24 07:52:47] [INFO ] Redundant transitions in 80 ms returned []
[2024-05-24 07:52:47] [INFO ] Flow matrix only has 713 transitions (discarded 537 similar events)
[2024-05-24 07:52:47] [INFO ] Invariant cache hit.
[2024-05-24 07:52:47] [INFO ] Dead Transitions using invariants and state equation in 409 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1794 ms. Remains : 435/435 places, 1250/1250 transitions.
Ensure Unique test removed 537 transitions
Reduce isomorphic transitions removed 537 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 547 rules applied. Total rules applied 547 place count 435 transition count 703
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 557 place count 425 transition count 703
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 74 Pre rules applied. Total rules applied 557 place count 425 transition count 629
Deduced a syphon composed of 74 places in 1 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 705 place count 351 transition count 629
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 131
Deduced a syphon composed of 131 places in 0 ms
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 2 with 262 rules applied. Total rules applied 967 place count 220 transition count 498
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1031 place count 156 transition count 370
Iterating global reduction 2 with 64 rules applied. Total rules applied 1095 place count 156 transition count 370
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1097 place count 156 transition count 368
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1160 place count 93 transition count 242
Iterating global reduction 3 with 63 rules applied. Total rules applied 1223 place count 93 transition count 242
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1286 place count 30 transition count 116
Iterating global reduction 3 with 63 rules applied. Total rules applied 1349 place count 30 transition count 116
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1412 place count 30 transition count 53
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1412 place count 30 transition count 52
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1414 place count 29 transition count 52
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 4 with 2 rules applied. Total rules applied 1416 place count 28 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1418 place count 27 transition count 51
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 1421 place count 27 transition count 48
Applied a total of 1421 rules in 51 ms. Remains 27 /435 variables (removed 408) and now considering 48/1250 (removed 1202) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 48 rows 27 cols
[2024-05-24 07:52:47] [INFO ] Computed 3 invariants in 0 ms
[2024-05-24 07:52:47] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 07:52:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 07:52:47] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 07:52:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 07:52:47] [INFO ] After 9ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-24 07:52:47] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-24 07:52:47] [INFO ] After 75ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Computed a total of 192 stabilizing places and 512 stable transitions
Graph (complete) has 3757 edges and 652 vertex of which 651 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.20 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 652 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 652/652 places, 1696/1696 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 646 transition count 1680
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 646 transition count 1680
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 646 transition count 1678
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 19 place count 641 transition count 1664
Iterating global reduction 1 with 5 rules applied. Total rules applied 24 place count 641 transition count 1664
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 28 place count 637 transition count 1654
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 637 transition count 1654
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 36 place count 633 transition count 1644
Iterating global reduction 1 with 4 rules applied. Total rules applied 40 place count 633 transition count 1644
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 43 place count 630 transition count 1638
Iterating global reduction 1 with 3 rules applied. Total rules applied 46 place count 630 transition count 1638
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 627 transition count 1632
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 place count 627 transition count 1632
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 55 place count 624 transition count 1626
Iterating global reduction 1 with 3 rules applied. Total rules applied 58 place count 624 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 623 transition count 1624
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 623 transition count 1624
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 622 transition count 1622
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 622 transition count 1622
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 66 place count 622 transition count 1618
Applied a total of 66 rules in 730 ms. Remains 622 /652 variables (removed 30) and now considering 1618/1696 (removed 78) transitions.
[2024-05-24 07:52:48] [INFO ] Flow matrix only has 1081 transitions (discarded 537 similar events)
// Phase 1: matrix 1081 rows 622 cols
[2024-05-24 07:52:48] [INFO ] Computed 2 invariants in 9 ms
[2024-05-24 07:52:48] [INFO ] Implicit Places using invariants in 392 ms returned []
[2024-05-24 07:52:48] [INFO ] Flow matrix only has 1081 transitions (discarded 537 similar events)
[2024-05-24 07:52:48] [INFO ] Invariant cache hit.
[2024-05-24 07:52:49] [INFO ] State equation strengthened by 267 read => feed constraints.
[2024-05-24 07:52:50] [INFO ] Implicit Places using invariants and state equation in 1852 ms returned []
Implicit Place search using SMT with State Equation took 2248 ms to find 0 implicit places.
[2024-05-24 07:52:50] [INFO ] Redundant transitions in 35 ms returned []
[2024-05-24 07:52:50] [INFO ] Flow matrix only has 1081 transitions (discarded 537 similar events)
[2024-05-24 07:52:50] [INFO ] Invariant cache hit.
[2024-05-24 07:52:51] [INFO ] Dead Transitions using invariants and state equation in 506 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 622/652 places, 1618/1696 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3528 ms. Remains : 622/652 places, 1618/1696 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c064-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s557 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 17295 steps with 125 reset in 180 ms.
FORMULA FunctionPointer-PT-c064-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c064-LTLCardinality-01 finished in 3941 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 652 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 652/652 places, 1696/1696 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 651 transition count 1696
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 646 transition count 1682
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 646 transition count 1682
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 15 place count 642 transition count 1670
Iterating global reduction 1 with 4 rules applied. Total rules applied 19 place count 642 transition count 1670
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 23 place count 638 transition count 1660
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 638 transition count 1660
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 31 place count 634 transition count 1650
Iterating global reduction 1 with 4 rules applied. Total rules applied 35 place count 634 transition count 1650
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 39 place count 630 transition count 1642
Iterating global reduction 1 with 4 rules applied. Total rules applied 43 place count 630 transition count 1642
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 47 place count 626 transition count 1634
Iterating global reduction 1 with 4 rules applied. Total rules applied 51 place count 626 transition count 1634
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 55 place count 622 transition count 1626
Iterating global reduction 1 with 4 rules applied. Total rules applied 59 place count 622 transition count 1626
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 620 transition count 1622
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 620 transition count 1622
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 65 place count 618 transition count 1618
Iterating global reduction 1 with 2 rules applied. Total rules applied 67 place count 618 transition count 1618
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 617 transition count 1614
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 616 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 616 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 615 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 615 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 74 place count 614 transition count 1606
Iterating global reduction 1 with 1 rules applied. Total rules applied 75 place count 614 transition count 1606
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 76 place count 613 transition count 1604
Iterating global reduction 1 with 1 rules applied. Total rules applied 77 place count 613 transition count 1604
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 78 place count 612 transition count 1602
Iterating global reduction 1 with 1 rules applied. Total rules applied 79 place count 612 transition count 1602
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 80 place count 611 transition count 1600
Iterating global reduction 1 with 1 rules applied. Total rules applied 81 place count 611 transition count 1600
Applied a total of 81 rules in 187 ms. Remains 611 /652 variables (removed 41) and now considering 1600/1696 (removed 96) transitions.
[2024-05-24 07:52:51] [INFO ] Flow matrix only has 1070 transitions (discarded 530 similar events)
// Phase 1: matrix 1070 rows 611 cols
[2024-05-24 07:52:51] [INFO ] Computed 2 invariants in 18 ms
[2024-05-24 07:52:52] [INFO ] Implicit Places using invariants in 393 ms returned []
[2024-05-24 07:52:52] [INFO ] Flow matrix only has 1070 transitions (discarded 530 similar events)
[2024-05-24 07:52:52] [INFO ] Invariant cache hit.
[2024-05-24 07:52:52] [INFO ] State equation strengthened by 267 read => feed constraints.
[2024-05-24 07:52:54] [INFO ] Implicit Places using invariants and state equation in 1754 ms returned []
Implicit Place search using SMT with State Equation took 2149 ms to find 0 implicit places.
[2024-05-24 07:52:54] [INFO ] Flow matrix only has 1070 transitions (discarded 530 similar events)
[2024-05-24 07:52:54] [INFO ] Invariant cache hit.
[2024-05-24 07:52:54] [INFO ] Dead Transitions using invariants and state equation in 490 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 611/652 places, 1600/1696 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2827 ms. Remains : 611/652 places, 1600/1696 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c064-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ 2 s523) (LEQ s527 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 927 ms.
Product exploration explored 100000 steps with 50000 reset in 916 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 15 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-c064-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c064-LTLCardinality-07 finished in 4794 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 652 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 652/652 places, 1696/1696 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 651 transition count 1696
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 645 transition count 1682
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 645 transition count 1682
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 645 transition count 1680
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 20 place count 640 transition count 1668
Iterating global reduction 2 with 5 rules applied. Total rules applied 25 place count 640 transition count 1668
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 29 place count 636 transition count 1658
Iterating global reduction 2 with 4 rules applied. Total rules applied 33 place count 636 transition count 1658
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 37 place count 632 transition count 1648
Iterating global reduction 2 with 4 rules applied. Total rules applied 41 place count 632 transition count 1648
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 44 place count 629 transition count 1642
Iterating global reduction 2 with 3 rules applied. Total rules applied 47 place count 629 transition count 1642
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 50 place count 626 transition count 1636
Iterating global reduction 2 with 3 rules applied. Total rules applied 53 place count 626 transition count 1636
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 56 place count 623 transition count 1630
Iterating global reduction 2 with 3 rules applied. Total rules applied 59 place count 623 transition count 1630
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 61 place count 621 transition count 1626
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 621 transition count 1626
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 65 place count 619 transition count 1622
Iterating global reduction 2 with 2 rules applied. Total rules applied 67 place count 619 transition count 1622
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 68 place count 618 transition count 1618
Iterating global reduction 2 with 1 rules applied. Total rules applied 69 place count 618 transition count 1618
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 70 place count 617 transition count 1614
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 72 place count 616 transition count 1612
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 74 place count 615 transition count 1610
Iterating global reduction 2 with 1 rules applied. Total rules applied 75 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 76 place count 614 transition count 1608
Iterating global reduction 2 with 1 rules applied. Total rules applied 77 place count 614 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 78 place count 613 transition count 1606
Iterating global reduction 2 with 1 rules applied. Total rules applied 79 place count 613 transition count 1606
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 80 place count 612 transition count 1604
Iterating global reduction 2 with 1 rules applied. Total rules applied 81 place count 612 transition count 1604
Applied a total of 81 rules in 193 ms. Remains 612 /652 variables (removed 40) and now considering 1604/1696 (removed 92) transitions.
[2024-05-24 07:52:56] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 612 cols
[2024-05-24 07:52:56] [INFO ] Computed 2 invariants in 9 ms
[2024-05-24 07:52:57] [INFO ] Implicit Places using invariants in 395 ms returned []
[2024-05-24 07:52:57] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 07:52:57] [INFO ] Invariant cache hit.
[2024-05-24 07:52:57] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 07:52:59] [INFO ] Implicit Places using invariants and state equation in 1907 ms returned []
Implicit Place search using SMT with State Equation took 2314 ms to find 0 implicit places.
[2024-05-24 07:52:59] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 07:52:59] [INFO ] Invariant cache hit.
[2024-05-24 07:52:59] [INFO ] Dead Transitions using invariants and state equation in 489 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 612/652 places, 1604/1696 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2998 ms. Remains : 612/652 places, 1604/1696 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c064-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s531 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 838 ms.
Product exploration explored 100000 steps with 50000 reset in 832 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 15 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-c064-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c064-LTLCardinality-08 finished in 4785 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 652 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 652/652 places, 1696/1696 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 651 transition count 1696
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 645 transition count 1680
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 645 transition count 1680
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 645 transition count 1678
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 21 place count 639 transition count 1662
Iterating global reduction 2 with 6 rules applied. Total rules applied 27 place count 639 transition count 1662
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 32 place count 634 transition count 1650
Iterating global reduction 2 with 5 rules applied. Total rules applied 37 place count 634 transition count 1650
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 42 place count 629 transition count 1638
Iterating global reduction 2 with 5 rules applied. Total rules applied 47 place count 629 transition count 1638
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 51 place count 625 transition count 1630
Iterating global reduction 2 with 4 rules applied. Total rules applied 55 place count 625 transition count 1630
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 59 place count 621 transition count 1622
Iterating global reduction 2 with 4 rules applied. Total rules applied 63 place count 621 transition count 1622
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 67 place count 617 transition count 1614
Iterating global reduction 2 with 4 rules applied. Total rules applied 71 place count 617 transition count 1614
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 73 place count 615 transition count 1610
Iterating global reduction 2 with 2 rules applied. Total rules applied 75 place count 615 transition count 1610
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 77 place count 613 transition count 1606
Iterating global reduction 2 with 2 rules applied. Total rules applied 79 place count 613 transition count 1606
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 80 place count 612 transition count 1602
Iterating global reduction 2 with 1 rules applied. Total rules applied 81 place count 612 transition count 1602
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 82 place count 611 transition count 1598
Iterating global reduction 2 with 1 rules applied. Total rules applied 83 place count 611 transition count 1598
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 84 place count 610 transition count 1596
Iterating global reduction 2 with 1 rules applied. Total rules applied 85 place count 610 transition count 1596
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 86 place count 609 transition count 1594
Iterating global reduction 2 with 1 rules applied. Total rules applied 87 place count 609 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 88 place count 608 transition count 1592
Iterating global reduction 2 with 1 rules applied. Total rules applied 89 place count 608 transition count 1592
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 90 place count 607 transition count 1590
Iterating global reduction 2 with 1 rules applied. Total rules applied 91 place count 607 transition count 1590
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 92 place count 606 transition count 1588
Iterating global reduction 2 with 1 rules applied. Total rules applied 93 place count 606 transition count 1588
Applied a total of 93 rules in 203 ms. Remains 606 /652 variables (removed 46) and now considering 1588/1696 (removed 108) transitions.
[2024-05-24 07:53:01] [INFO ] Flow matrix only has 1061 transitions (discarded 527 similar events)
// Phase 1: matrix 1061 rows 606 cols
[2024-05-24 07:53:01] [INFO ] Computed 2 invariants in 15 ms
[2024-05-24 07:53:01] [INFO ] Implicit Places using invariants in 390 ms returned []
[2024-05-24 07:53:01] [INFO ] Flow matrix only has 1061 transitions (discarded 527 similar events)
[2024-05-24 07:53:01] [INFO ] Invariant cache hit.
[2024-05-24 07:53:02] [INFO ] State equation strengthened by 264 read => feed constraints.
[2024-05-24 07:53:04] [INFO ] Implicit Places using invariants and state equation in 2987 ms returned []
Implicit Place search using SMT with State Equation took 3379 ms to find 0 implicit places.
[2024-05-24 07:53:04] [INFO ] Flow matrix only has 1061 transitions (discarded 527 similar events)
[2024-05-24 07:53:04] [INFO ] Invariant cache hit.
[2024-05-24 07:53:05] [INFO ] Dead Transitions using invariants and state equation in 486 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 606/652 places, 1588/1696 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4081 ms. Remains : 606/652 places, 1588/1696 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c064-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s519 s476)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 831 ms.
Product exploration explored 100000 steps with 50000 reset in 828 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 14 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-c064-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c064-LTLCardinality-09 finished in 5878 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 652 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 652/652 places, 1696/1696 transitions.
Graph (complete) has 3757 edges and 652 vertex of which 651 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 644 transition count 1678
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 644 transition count 1678
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 17 place count 644 transition count 1676
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 23 place count 638 transition count 1660
Iterating global reduction 1 with 6 rules applied. Total rules applied 29 place count 638 transition count 1660
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 633 transition count 1648
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 633 transition count 1648
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 44 place count 628 transition count 1636
Iterating global reduction 1 with 5 rules applied. Total rules applied 49 place count 628 transition count 1636
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 53 place count 624 transition count 1628
Iterating global reduction 1 with 4 rules applied. Total rules applied 57 place count 624 transition count 1628
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 61 place count 620 transition count 1620
Iterating global reduction 1 with 4 rules applied. Total rules applied 65 place count 620 transition count 1620
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 69 place count 616 transition count 1612
Iterating global reduction 1 with 4 rules applied. Total rules applied 73 place count 616 transition count 1612
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 75 place count 614 transition count 1608
Iterating global reduction 1 with 2 rules applied. Total rules applied 77 place count 614 transition count 1608
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 79 place count 612 transition count 1604
Iterating global reduction 1 with 2 rules applied. Total rules applied 81 place count 612 transition count 1604
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 82 place count 611 transition count 1600
Iterating global reduction 1 with 1 rules applied. Total rules applied 83 place count 611 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 84 place count 610 transition count 1596
Iterating global reduction 1 with 1 rules applied. Total rules applied 85 place count 610 transition count 1596
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 86 place count 609 transition count 1594
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 609 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 88 place count 608 transition count 1592
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 608 transition count 1592
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 90 place count 607 transition count 1590
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 607 transition count 1590
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 92 place count 606 transition count 1588
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 606 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 94 place count 605 transition count 1586
Iterating global reduction 1 with 1 rules applied. Total rules applied 95 place count 605 transition count 1586
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 97 place count 605 transition count 1584
Applied a total of 97 rules in 457 ms. Remains 605 /652 variables (removed 47) and now considering 1584/1696 (removed 112) transitions.
[2024-05-24 07:53:07] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
// Phase 1: matrix 1057 rows 605 cols
[2024-05-24 07:53:07] [INFO ] Computed 2 invariants in 16 ms
[2024-05-24 07:53:08] [INFO ] Implicit Places using invariants in 384 ms returned []
[2024-05-24 07:53:08] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-24 07:53:08] [INFO ] Invariant cache hit.
[2024-05-24 07:53:08] [INFO ] State equation strengthened by 262 read => feed constraints.
[2024-05-24 07:53:09] [INFO ] Implicit Places using invariants and state equation in 1724 ms returned []
Implicit Place search using SMT with State Equation took 2109 ms to find 0 implicit places.
[2024-05-24 07:53:09] [INFO ] Redundant transitions in 33 ms returned []
[2024-05-24 07:53:09] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-24 07:53:09] [INFO ] Invariant cache hit.
[2024-05-24 07:53:10] [INFO ] Dead Transitions using invariants and state equation in 498 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 605/652 places, 1584/1696 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3110 ms. Remains : 605/652 places, 1584/1696 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c064-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 s101)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 414 steps with 3 reset in 4 ms.
FORMULA FunctionPointer-PT-c064-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c064-LTLCardinality-10 finished in 3206 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G((p1&&F(G(p2))))||p0))))'
Support contains 2 out of 652 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 652/652 places, 1696/1696 transitions.
Graph (complete) has 3757 edges and 652 vertex of which 651 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 646 transition count 1684
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 646 transition count 1684
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 13 place count 646 transition count 1682
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 642 transition count 1672
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 642 transition count 1672
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 639 transition count 1666
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 639 transition count 1666
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 30 place count 636 transition count 1660
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 636 transition count 1660
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 634 transition count 1656
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 634 transition count 1656
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 632 transition count 1652
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 632 transition count 1652
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 630 transition count 1648
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 630 transition count 1648
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 629 transition count 1646
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 629 transition count 1646
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 628 transition count 1644
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 628 transition count 1644
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 627 transition count 1640
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 627 transition count 1640
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 626 transition count 1636
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 626 transition count 1636
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 625 transition count 1634
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 625 transition count 1634
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 624 transition count 1632
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 624 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 623 transition count 1630
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 623 transition count 1630
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 622 transition count 1628
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 622 transition count 1628
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 621 transition count 1626
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 621 transition count 1626
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 67 place count 621 transition count 1622
Applied a total of 67 rules in 353 ms. Remains 621 /652 variables (removed 31) and now considering 1622/1696 (removed 74) transitions.
[2024-05-24 07:53:10] [INFO ] Flow matrix only has 1084 transitions (discarded 538 similar events)
// Phase 1: matrix 1084 rows 621 cols
[2024-05-24 07:53:10] [INFO ] Computed 2 invariants in 13 ms
[2024-05-24 07:53:11] [INFO ] Implicit Places using invariants in 403 ms returned []
[2024-05-24 07:53:11] [INFO ] Flow matrix only has 1084 transitions (discarded 538 similar events)
[2024-05-24 07:53:11] [INFO ] Invariant cache hit.
[2024-05-24 07:53:11] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 07:53:13] [INFO ] Implicit Places using invariants and state equation in 2522 ms returned []
Implicit Place search using SMT with State Equation took 2926 ms to find 0 implicit places.
[2024-05-24 07:53:13] [INFO ] Redundant transitions in 30 ms returned []
[2024-05-24 07:53:13] [INFO ] Flow matrix only has 1084 transitions (discarded 538 similar events)
[2024-05-24 07:53:13] [INFO ] Invariant cache hit.
[2024-05-24 07:53:14] [INFO ] Dead Transitions using invariants and state equation in 498 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 621/652 places, 1622/1696 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3821 ms. Remains : 621/652 places, 1622/1696 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FunctionPointer-PT-c064-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 2 s541), p0:(OR (GT 2 s538) (GT 2 s541)), p2:(GT 2 s538)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 759 reset in 545 ms.
Product exploration explored 100000 steps with 754 reset in 564 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 132 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10032 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 218363 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :{}
Probabilistic random walk after 218363 steps, saw 141748 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-24 07:53:18] [INFO ] Flow matrix only has 1084 transitions (discarded 538 similar events)
[2024-05-24 07:53:18] [INFO ] Invariant cache hit.
[2024-05-24 07:53:19] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 07:53:19] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 07:53:19] [INFO ] After 304ms SMT Verify possible using state equation in real domain returned unsat :2 sat :3
[2024-05-24 07:53:19] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 07:53:19] [INFO ] After 148ms SMT Verify possible using 268 Read/Feed constraints in real domain returned unsat :2 sat :0 real:3
[2024-05-24 07:53:19] [INFO ] After 580ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:3
[2024-05-24 07:53:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-24 07:53:19] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 07:53:19] [INFO ] After 304ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2024-05-24 07:53:20] [INFO ] After 172ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :2 sat :3
[2024-05-24 07:53:20] [INFO ] After 326ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 96 ms.
[2024-05-24 07:53:20] [INFO ] After 844ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 27 ms.
Support contains 2 out of 621 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 621/621 places, 1622/1622 transitions.
Graph (complete) has 2707 edges and 621 vertex of which 429 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.1 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 429 transition count 1238
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 387 place count 429 transition count 1236
Applied a total of 387 rules in 93 ms. Remains 429 /621 variables (removed 192) and now considering 1236/1622 (removed 386) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 429/621 places, 1236/1622 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 326316 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :{}
Probabilistic random walk after 326316 steps, saw 200102 distinct states, run finished after 3001 ms. (steps per millisecond=108 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-24 07:53:23] [INFO ] Flow matrix only has 701 transitions (discarded 535 similar events)
// Phase 1: matrix 701 rows 429 cols
[2024-05-24 07:53:23] [INFO ] Computed 3 invariants in 4 ms
[2024-05-24 07:53:23] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-24 07:53:23] [INFO ] After 189ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2024-05-24 07:53:23] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-24 07:53:24] [INFO ] After 122ms SMT Verify possible using 78 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 07:53:24] [INFO ] After 408ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 07:53:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-24 07:53:24] [INFO ] After 194ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 07:53:24] [INFO ] After 78ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 07:53:24] [INFO ] After 185ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 71 ms.
[2024-05-24 07:53:24] [INFO ] After 539ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 19 ms.
Support contains 2 out of 429 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 429/429 places, 1236/1236 transitions.
Applied a total of 0 rules in 42 ms. Remains 429 /429 variables (removed 0) and now considering 1236/1236 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 429/429 places, 1236/1236 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 429/429 places, 1236/1236 transitions.
Applied a total of 0 rules in 44 ms. Remains 429 /429 variables (removed 0) and now considering 1236/1236 (removed 0) transitions.
[2024-05-24 07:53:24] [INFO ] Flow matrix only has 701 transitions (discarded 535 similar events)
[2024-05-24 07:53:24] [INFO ] Invariant cache hit.
[2024-05-24 07:53:24] [INFO ] Implicit Places using invariants in 274 ms returned []
[2024-05-24 07:53:24] [INFO ] Flow matrix only has 701 transitions (discarded 535 similar events)
[2024-05-24 07:53:24] [INFO ] Invariant cache hit.
[2024-05-24 07:53:25] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-24 07:53:27] [INFO ] Implicit Places using invariants and state equation in 2676 ms returned []
Implicit Place search using SMT with State Equation took 2951 ms to find 0 implicit places.
[2024-05-24 07:53:27] [INFO ] Redundant transitions in 20 ms returned []
[2024-05-24 07:53:27] [INFO ] Flow matrix only has 701 transitions (discarded 535 similar events)
[2024-05-24 07:53:27] [INFO ] Invariant cache hit.
[2024-05-24 07:53:28] [INFO ] Dead Transitions using invariants and state equation in 370 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3391 ms. Remains : 429/429 places, 1236/1236 transitions.
Ensure Unique test removed 535 transitions
Reduce isomorphic transitions removed 535 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 545 rules applied. Total rules applied 545 place count 429 transition count 691
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 555 place count 419 transition count 691
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 75 Pre rules applied. Total rules applied 555 place count 419 transition count 616
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 150 rules applied. Total rules applied 705 place count 344 transition count 616
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 1 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 961 place count 216 transition count 488
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1025 place count 152 transition count 360
Iterating global reduction 2 with 64 rules applied. Total rules applied 1089 place count 152 transition count 360
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1091 place count 152 transition count 358
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1154 place count 89 transition count 232
Iterating global reduction 3 with 63 rules applied. Total rules applied 1217 place count 89 transition count 232
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1280 place count 26 transition count 106
Iterating global reduction 3 with 63 rules applied. Total rules applied 1343 place count 26 transition count 106
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1406 place count 26 transition count 43
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1406 place count 26 transition count 42
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1408 place count 25 transition count 42
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 4 with 2 rules applied. Total rules applied 1410 place count 24 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1412 place count 23 transition count 41
Applied a total of 1412 rules in 24 ms. Remains 23 /429 variables (removed 406) and now considering 41/1236 (removed 1195) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 41 rows 23 cols
[2024-05-24 07:53:28] [INFO ] Computed 3 invariants in 1 ms
[2024-05-24 07:53:28] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-24 07:53:28] [INFO ] After 26ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2024-05-24 07:53:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 07:53:28] [INFO ] After 7ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 07:53:28] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 07:53:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-24 07:53:28] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 07:53:28] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 07:53:28] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-24 07:53:28] [INFO ] After 54ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0))))), (G (NOT (AND (NOT p0) p2))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 141 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 621 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 621/621 places, 1622/1622 transitions.
Applied a total of 0 rules in 86 ms. Remains 621 /621 variables (removed 0) and now considering 1622/1622 (removed 0) transitions.
[2024-05-24 07:53:28] [INFO ] Flow matrix only has 1084 transitions (discarded 538 similar events)
// Phase 1: matrix 1084 rows 621 cols
[2024-05-24 07:53:28] [INFO ] Computed 2 invariants in 13 ms
[2024-05-24 07:53:28] [INFO ] Implicit Places using invariants in 405 ms returned []
[2024-05-24 07:53:28] [INFO ] Flow matrix only has 1084 transitions (discarded 538 similar events)
[2024-05-24 07:53:28] [INFO ] Invariant cache hit.
[2024-05-24 07:53:29] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 07:53:30] [INFO ] Implicit Places using invariants and state equation in 1931 ms returned []
Implicit Place search using SMT with State Equation took 2337 ms to find 0 implicit places.
[2024-05-24 07:53:30] [INFO ] Redundant transitions in 31 ms returned []
[2024-05-24 07:53:30] [INFO ] Flow matrix only has 1084 transitions (discarded 538 similar events)
[2024-05-24 07:53:30] [INFO ] Invariant cache hit.
[2024-05-24 07:53:31] [INFO ] Dead Transitions using invariants and state equation in 495 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2957 ms. Remains : 621/621 places, 1622/1622 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 511143 steps, run timeout after 3001 ms. (steps per millisecond=170 ) properties seen :{}
Probabilistic random walk after 511143 steps, saw 331763 distinct states, run finished after 3001 ms. (steps per millisecond=170 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 07:53:34] [INFO ] Flow matrix only has 1084 transitions (discarded 538 similar events)
[2024-05-24 07:53:34] [INFO ] Invariant cache hit.
[2024-05-24 07:53:34] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 07:53:34] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 07:53:35] [INFO ] After 251ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-24 07:53:35] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 07:53:35] [INFO ] After 77ms SMT Verify possible using 268 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 07:53:35] [INFO ] After 417ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 07:53:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 07:53:35] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 07:53:35] [INFO ] After 249ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 07:53:35] [INFO ] After 103ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 07:53:35] [INFO ] After 156ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2024-05-24 07:53:35] [INFO ] After 546ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 621 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 621/621 places, 1622/1622 transitions.
Graph (complete) has 2707 edges and 621 vertex of which 429 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.0 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 429 transition count 1238
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 387 place count 429 transition count 1236
Applied a total of 387 rules in 106 ms. Remains 429 /621 variables (removed 192) and now considering 1236/1622 (removed 386) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 429/621 places, 1236/1622 transitions.
Incomplete random walk after 10004 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 588276 steps, run timeout after 3001 ms. (steps per millisecond=196 ) properties seen :{}
Probabilistic random walk after 588276 steps, saw 360722 distinct states, run finished after 3001 ms. (steps per millisecond=196 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 07:53:38] [INFO ] Flow matrix only has 701 transitions (discarded 535 similar events)
// Phase 1: matrix 701 rows 429 cols
[2024-05-24 07:53:38] [INFO ] Computed 3 invariants in 8 ms
[2024-05-24 07:53:38] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-24 07:53:39] [INFO ] After 159ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-24 07:53:39] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-24 07:53:39] [INFO ] After 63ms SMT Verify possible using 78 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 07:53:39] [INFO ] After 299ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 07:53:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-24 07:53:39] [INFO ] After 154ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 07:53:39] [INFO ] After 39ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 07:53:39] [INFO ] After 80ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2024-05-24 07:53:39] [INFO ] After 329ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 429 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 429/429 places, 1236/1236 transitions.
Applied a total of 0 rules in 44 ms. Remains 429 /429 variables (removed 0) and now considering 1236/1236 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 429/429 places, 1236/1236 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 429/429 places, 1236/1236 transitions.
Applied a total of 0 rules in 43 ms. Remains 429 /429 variables (removed 0) and now considering 1236/1236 (removed 0) transitions.
[2024-05-24 07:53:39] [INFO ] Flow matrix only has 701 transitions (discarded 535 similar events)
[2024-05-24 07:53:39] [INFO ] Invariant cache hit.
[2024-05-24 07:53:39] [INFO ] Implicit Places using invariants in 276 ms returned []
[2024-05-24 07:53:39] [INFO ] Flow matrix only has 701 transitions (discarded 535 similar events)
[2024-05-24 07:53:39] [INFO ] Invariant cache hit.
[2024-05-24 07:53:39] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-24 07:53:41] [INFO ] Implicit Places using invariants and state equation in 1672 ms returned []
Implicit Place search using SMT with State Equation took 1954 ms to find 0 implicit places.
[2024-05-24 07:53:41] [INFO ] Redundant transitions in 16 ms returned []
[2024-05-24 07:53:41] [INFO ] Flow matrix only has 701 transitions (discarded 535 similar events)
[2024-05-24 07:53:41] [INFO ] Invariant cache hit.
[2024-05-24 07:53:41] [INFO ] Dead Transitions using invariants and state equation in 371 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2396 ms. Remains : 429/429 places, 1236/1236 transitions.
Ensure Unique test removed 535 transitions
Reduce isomorphic transitions removed 535 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 545 rules applied. Total rules applied 545 place count 429 transition count 691
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 555 place count 419 transition count 691
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 75 Pre rules applied. Total rules applied 555 place count 419 transition count 616
Deduced a syphon composed of 75 places in 1 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 150 rules applied. Total rules applied 705 place count 344 transition count 616
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 1 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 961 place count 216 transition count 488
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1025 place count 152 transition count 360
Iterating global reduction 2 with 64 rules applied. Total rules applied 1089 place count 152 transition count 360
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1091 place count 152 transition count 358
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1154 place count 89 transition count 232
Iterating global reduction 3 with 63 rules applied. Total rules applied 1217 place count 89 transition count 232
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1280 place count 26 transition count 106
Iterating global reduction 3 with 63 rules applied. Total rules applied 1343 place count 26 transition count 106
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1406 place count 26 transition count 43
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1406 place count 26 transition count 42
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1408 place count 25 transition count 42
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 4 with 2 rules applied. Total rules applied 1410 place count 24 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1412 place count 23 transition count 41
Applied a total of 1412 rules in 22 ms. Remains 23 /429 variables (removed 406) and now considering 41/1236 (removed 1195) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 41 rows 23 cols
[2024-05-24 07:53:41] [INFO ] Computed 3 invariants in 1 ms
[2024-05-24 07:53:41] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-24 07:53:41] [INFO ] After 9ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-24 07:53:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 07:53:41] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 07:53:41] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 07:53:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 07:53:41] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 07:53:41] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 07:53:41] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-24 07:53:41] [INFO ] After 34ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 769 reset in 500 ms.
Product exploration explored 100000 steps with 755 reset in 511 ms.
Built C files in :
/tmp/ltsmin3773957453336811834
[2024-05-24 07:53:43] [INFO ] Too many transitions (1622) to apply POR reductions. Disabling POR matrices.
[2024-05-24 07:53:43] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3773957453336811834
Running compilation step : cd /tmp/ltsmin3773957453336811834;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2971 ms.
Running link step : cd /tmp/ltsmin3773957453336811834;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin3773957453336811834;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased249505330454439841.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 621 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 621/621 places, 1622/1622 transitions.
Applied a total of 0 rules in 70 ms. Remains 621 /621 variables (removed 0) and now considering 1622/1622 (removed 0) transitions.
[2024-05-24 07:53:58] [INFO ] Flow matrix only has 1084 transitions (discarded 538 similar events)
// Phase 1: matrix 1084 rows 621 cols
[2024-05-24 07:53:58] [INFO ] Computed 2 invariants in 15 ms
[2024-05-24 07:53:58] [INFO ] Implicit Places using invariants in 401 ms returned []
[2024-05-24 07:53:58] [INFO ] Flow matrix only has 1084 transitions (discarded 538 similar events)
[2024-05-24 07:53:58] [INFO ] Invariant cache hit.
[2024-05-24 07:53:59] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 07:54:00] [INFO ] Implicit Places using invariants and state equation in 1849 ms returned []
Implicit Place search using SMT with State Equation took 2252 ms to find 0 implicit places.
[2024-05-24 07:54:00] [INFO ] Redundant transitions in 30 ms returned []
[2024-05-24 07:54:00] [INFO ] Flow matrix only has 1084 transitions (discarded 538 similar events)
[2024-05-24 07:54:00] [INFO ] Invariant cache hit.
[2024-05-24 07:54:01] [INFO ] Dead Transitions using invariants and state equation in 490 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2848 ms. Remains : 621/621 places, 1622/1622 transitions.
Built C files in :
/tmp/ltsmin10040634830220682017
[2024-05-24 07:54:01] [INFO ] Too many transitions (1622) to apply POR reductions. Disabling POR matrices.
[2024-05-24 07:54:01] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10040634830220682017
Running compilation step : cd /tmp/ltsmin10040634830220682017;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2833 ms.
Running link step : cd /tmp/ltsmin10040634830220682017;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin10040634830220682017;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6535226344811102005.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 07:54:16] [INFO ] Flatten gal took : 67 ms
[2024-05-24 07:54:16] [INFO ] Flatten gal took : 66 ms
[2024-05-24 07:54:16] [INFO ] Time to serialize gal into /tmp/LTL9888069171316009578.gal : 13 ms
[2024-05-24 07:54:16] [INFO ] Time to serialize properties into /tmp/LTL4758357708431561356.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9888069171316009578.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15673952249943125837.hoa' '-atoms' '/tmp/LTL4758357708431561356.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4758357708431561356.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15673952249943125837.hoa
Detected timeout of ITS tools.
[2024-05-24 07:54:31] [INFO ] Flatten gal took : 69 ms
[2024-05-24 07:54:31] [INFO ] Flatten gal took : 76 ms
[2024-05-24 07:54:31] [INFO ] Time to serialize gal into /tmp/LTL4953174079869182206.gal : 7 ms
[2024-05-24 07:54:31] [INFO ] Time to serialize properties into /tmp/LTL9040585562527144289.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4953174079869182206.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9040585562527144289.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F(("((l1515<2)||(p1609<2))")||(G(("(p1609>=2)")&&(F(G("(l1515<2)")))))))))
Formula 0 simplified : G(F(!"(p1609>=2)" | GF!"(l1515<2)") & FG!"((l1515<2)||(p1609<2))")
Detected timeout of ITS tools.
[2024-05-24 07:54:46] [INFO ] Flatten gal took : 50 ms
[2024-05-24 07:54:46] [INFO ] Applying decomposition
[2024-05-24 07:54:46] [INFO ] Flatten gal took : 49 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph5947631584570863575.txt' '-o' '/tmp/graph5947631584570863575.bin' '-w' '/tmp/graph5947631584570863575.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5947631584570863575.bin' '-l' '-1' '-v' '-w' '/tmp/graph5947631584570863575.weights' '-q' '0' '-e' '0.001'
[2024-05-24 07:54:46] [INFO ] Decomposing Gal with order
[2024-05-24 07:54:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 07:54:47] [INFO ] Removed a total of 2694 redundant transitions.
[2024-05-24 07:54:47] [INFO ] Flatten gal took : 147 ms
[2024-05-24 07:54:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 1184 labels/synchronizations in 92 ms.
[2024-05-24 07:54:47] [INFO ] Time to serialize gal into /tmp/LTL3845257660227994312.gal : 14 ms
[2024-05-24 07:54:47] [INFO ] Time to serialize properties into /tmp/LTL9863584531401266278.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3845257660227994312.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9863584531401266278.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i29.i0.u146.l1515<2)||(i29.i1.u147.p1609<2))")||(G(("(i29.i1.u147.p1609>=2)")&&(F(G("(i29.i0.u146.l1515<2)")))))))))
Formula 0 simplified : G(F(!"(i29.i1.u147.p1609>=2)" | GF!"(i29.i0.u146.l1515<2)") & FG!"((i29.i0.u146.l1515<2)||(i29.i1.u147.p1609<2))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6851118295853146641
[2024-05-24 07:55:02] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6851118295853146641
Running compilation step : cd /tmp/ltsmin6851118295853146641;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2887 ms.
Running link step : cd /tmp/ltsmin6851118295853146641;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin6851118295853146641;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(([](((LTLAPp1==true)&&<>([]((LTLAPp2==true)))))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FunctionPointer-PT-c064-LTLCardinality-11 finished in 127094 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G((p1&&F(G(p2))))||p0))))'
[2024-05-24 07:55:17] [INFO ] Flatten gal took : 47 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10230241205072458538
[2024-05-24 07:55:17] [INFO ] Too many transitions (1696) to apply POR reductions. Disabling POR matrices.
[2024-05-24 07:55:17] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10230241205072458538
Running compilation step : cd /tmp/ltsmin10230241205072458538;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-24 07:55:17] [INFO ] Applying decomposition
[2024-05-24 07:55:17] [INFO ] Flatten gal took : 65 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph7796156599120796060.txt' '-o' '/tmp/graph7796156599120796060.bin' '-w' '/tmp/graph7796156599120796060.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7796156599120796060.bin' '-l' '-1' '-v' '-w' '/tmp/graph7796156599120796060.weights' '-q' '0' '-e' '0.001'
[2024-05-24 07:55:17] [INFO ] Decomposing Gal with order
[2024-05-24 07:55:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 07:55:18] [INFO ] Removed a total of 2817 redundant transitions.
[2024-05-24 07:55:18] [INFO ] Flatten gal took : 97 ms
[2024-05-24 07:55:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 1304 labels/synchronizations in 81 ms.
[2024-05-24 07:55:18] [INFO ] Time to serialize gal into /tmp/LTLCardinality5404870916731738009.gal : 11 ms
[2024-05-24 07:55:18] [INFO ] Time to serialize properties into /tmp/LTLCardinality10725454543219271734.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality5404870916731738009.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10725454543219271734.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i24.i0.u0.l1515<2)||(i24.i2.u156.p1609<2))")||(G(("(i24.i2.u156.p1609>=2)")&&(F(G("(i24.i0.u0.l1515<2)")))))))))
Formula 0 simplified : G(F(!"(i24.i2.u156.p1609>=2)" | GF!"(i24.i0.u0.l1515<2)") & FG!"((i24.i0.u0.l1515<2)||(i24.i2.u156.p1609<2))")
Compilation finished in 3081 ms.
Running link step : cd /tmp/ltsmin10230241205072458538;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin10230241205072458538;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([](((LTLAPp1==true)&&<>([]((LTLAPp2==true)))))||(LTLAPp0==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-24 08:16:14] [INFO ] Flatten gal took : 144 ms
[2024-05-24 08:16:14] [INFO ] Time to serialize gal into /tmp/LTLCardinality18356408066748763193.gal : 26 ms
[2024-05-24 08:16:14] [INFO ] Time to serialize properties into /tmp/LTLCardinality16429935441805424847.ltl : 71 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality18356408066748763193.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16429935441805424847.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 1 LTL properties
Checking formula 0 : !((G(F(("((l1515<2)||(p1609<2))")||(G(("(p1609>=2)")&&(F(G("(l1515<2)")))))))))
Formula 0 simplified : G(F(!"(p1609>=2)" | GF!"(l1515<2)") & FG!"((l1515<2)||(p1609<2))")
Detected timeout of ITS tools.
[2024-05-24 08:37:11] [INFO ] Flatten gal took : 113 ms
[2024-05-24 08:37:11] [INFO ] Input system was already deterministic with 1696 transitions.
[2024-05-24 08:37:11] [INFO ] Transformed 652 places.
[2024-05-24 08:37:11] [INFO ] Transformed 1696 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-24 08:37:12] [INFO ] Time to serialize gal into /tmp/LTLCardinality12239221034516374548.gal : 25 ms
[2024-05-24 08:37:12] [INFO ] Time to serialize properties into /tmp/LTLCardinality9156507854482755911.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality12239221034516374548.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9156507854482755911.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F(("((l1515<2)||(p1609<2))")||(G(("(p1609>=2)")&&(F(G("(l1515<2)")))))))))
Formula 0 simplified : G(F(!"(p1609>=2)" | GF!"(l1515<2)") & FG!"((l1515<2)||(p1609<2))")
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.023: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.022: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.030: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.031: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.034: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.037: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.037: Initializing POR dependencies: labels 1699, guards 1696
pins2lts-mc-linux64( 2/ 8), 43.831: No maybe-coenabled matrix found. Turning off NESs from NDS+MC.
pins2lts-mc-linux64( 2/ 8), 148.997: LTL layer: formula: [](<>(([](((LTLAPp1==true)&&<>([]((LTLAPp2==true)))))||(LTLAPp0==true))))
pins2lts-mc-linux64( 2/ 8), 148.997: "[](<>(([](((LTLAPp1==true)&&<>([]((LTLAPp2==true)))))||(LTLAPp0==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 148.997: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 150.726: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 150.776: There are 1700 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 150.776: State length is 653, there are 1709 groups
pins2lts-mc-linux64( 0/ 8), 150.776: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 150.776: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 150.776: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 150.776: Visible groups: 0 / 1709, labels: 3 / 1700
pins2lts-mc-linux64( 0/ 8), 150.776: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 150.776: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 0/ 8), 151.392: [Blue] ~120 levels ~960 states ~3808 transitions
pins2lts-mc-linux64( 0/ 8), 152.076: [Blue] ~240 levels ~1920 states ~8664 transitions
pins2lts-mc-linux64( 0/ 8), 153.631: [Blue] ~480 levels ~3840 states ~21464 transitions
pins2lts-mc-linux64( 1/ 8), 156.410: [Blue] ~960 levels ~7680 states ~29736 transitions
pins2lts-mc-linux64( 1/ 8), 160.002: [Blue] ~1920 levels ~15360 states ~56616 transitions
pins2lts-mc-linux64( 1/ 8), 166.990: [Blue] ~3840 levels ~30720 states ~110376 transitions
pins2lts-mc-linux64( 1/ 8), 180.888: [Blue] ~7680 levels ~61440 states ~217896 transitions
pins2lts-mc-linux64( 1/ 8), 208.146: [Blue] ~15360 levels ~122880 states ~432936 transitions
pins2lts-mc-linux64( 1/ 8), 261.773: [Blue] ~30720 levels ~245760 states ~863016 transitions
pins2lts-mc-linux64( 1/ 8), 368.589: [Blue] ~61440 levels ~491520 states ~1723176 transitions
pins2lts-mc-linux64( 1/ 8), 577.348: [Blue] ~122880 levels ~983040 states ~3443496 transitions
pins2lts-mc-linux64( 1/ 8), 991.909: [Blue] ~245760 levels ~1966080 states ~6884136 transitions
pins2lts-mc-linux64( 1/ 8), 1826.131: [Blue] ~491520 levels ~3932160 states ~13765416 transitions
pins2lts-mc-linux64( 2/ 8), 3175.116: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 3175.199:
pins2lts-mc-linux64( 0/ 8), 3175.200: Explored 3833079 states 20281285 transitions, fanout: 5.291
pins2lts-mc-linux64( 0/ 8), 3175.200: Total exploration time 3024.420 sec (3024.330 sec minimum, 3024.366 sec on average)
pins2lts-mc-linux64( 0/ 8), 3175.200: States per second: 1267, Transitions per second: 6706
pins2lts-mc-linux64( 0/ 8), 3175.200:
pins2lts-mc-linux64( 0/ 8), 3175.200: State space has 19209565 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 3175.200: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 3175.200: blue states: 3833079 (19.95%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 3175.200: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 3175.200: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 3175.200:
pins2lts-mc-linux64( 0/ 8), 3175.200: Total memory used for local state coloring: 58.5MB
pins2lts-mc-linux64( 0/ 8), 3175.200:
pins2lts-mc-linux64( 0/ 8), 3175.200: Queue width: 8B, total height: 3833019, memory: 29.24MB
pins2lts-mc-linux64( 0/ 8), 3175.200: Tree memory: 402.6MB, 22.0 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 3175.200: Tree fill ratio (roots/leafs): 14.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 3175.200: Stored 1724 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 3175.200: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 3175.200: Est. total memory use: 431.8MB (~1053.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10230241205072458538;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([](((LTLAPp1==true)&&<>([]((LTLAPp2==true)))))||(LTLAPp0==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10230241205072458538;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([](((LTLAPp1==true)&&<>([]((LTLAPp2==true)))))||(LTLAPp0==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 154436 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15656016 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="FunctionPointer-PT-c064"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is FunctionPointer-PT-c064, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r197-tall-171640625100197"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c064.tgz
mv FunctionPointer-PT-c064 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;