About the Execution of LoLa+red for Diffusion2D-PT-D50N100
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2754.436 | 711325.00 | 779693.00 | 3022.10 | FFFFFFFTFF?FFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r135-smll-167819413900268.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is Diffusion2D-PT-D50N100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-smll-167819413900268
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.7M
-rw-r--r-- 1 mcc users 7.3K Feb 26 04:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 26 04:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 04:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 04:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 15:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 15:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 04:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 26 04:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Feb 26 04:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 04:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 7.3M Mar 5 18:22 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 Diffusion2D-PT-D50N100-LTLFireability-00
FORMULA_NAME Diffusion2D-PT-D50N100-LTLFireability-01
FORMULA_NAME Diffusion2D-PT-D50N100-LTLFireability-02
FORMULA_NAME Diffusion2D-PT-D50N100-LTLFireability-03
FORMULA_NAME Diffusion2D-PT-D50N100-LTLFireability-04
FORMULA_NAME Diffusion2D-PT-D50N100-LTLFireability-05
FORMULA_NAME Diffusion2D-PT-D50N100-LTLFireability-06
FORMULA_NAME Diffusion2D-PT-D50N100-LTLFireability-07
FORMULA_NAME Diffusion2D-PT-D50N100-LTLFireability-08
FORMULA_NAME Diffusion2D-PT-D50N100-LTLFireability-09
FORMULA_NAME Diffusion2D-PT-D50N100-LTLFireability-10
FORMULA_NAME Diffusion2D-PT-D50N100-LTLFireability-11
FORMULA_NAME Diffusion2D-PT-D50N100-LTLFireability-12
FORMULA_NAME Diffusion2D-PT-D50N100-LTLFireability-13
FORMULA_NAME Diffusion2D-PT-D50N100-LTLFireability-14
FORMULA_NAME Diffusion2D-PT-D50N100-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678309928337
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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Diffusion2D-PT-D50N100
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 21:12:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 21:12:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 21:12:12] [INFO ] Load time of PNML (sax parser for PT used): 903 ms
[2023-03-08 21:12:12] [INFO ] Transformed 2500 places.
[2023-03-08 21:12:13] [INFO ] Transformed 19404 transitions.
[2023-03-08 21:12:13] [INFO ] Parsed PT model containing 2500 places and 19404 transitions and 38808 arcs in 1121 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 33 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Diffusion2D-PT-D50N100-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D50N100-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D50N100-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D50N100-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 1247 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2023-03-08 21:12:15] [INFO ] Computed 1 place invariants in 345 ms
[2023-03-08 21:12:16] [INFO ] Implicit Places using invariants in 1381 ms returned []
Implicit Place search using SMT only with invariants took 1432 ms to find 0 implicit places.
[2023-03-08 21:12:16] [INFO ] Invariant cache hit.
[2023-03-08 21:12:33] [INFO ] Dead Transitions using invariants and state equation in 16824 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19542 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Support contains 28 out of 2500 places after structural reductions.
[2023-03-08 21:12:34] [INFO ] Flatten gal took : 907 ms
[2023-03-08 21:12:34] [INFO ] Flatten gal took : 498 ms
[2023-03-08 21:12:36] [INFO ] Input system was already deterministic with 19404 transitions.
Support contains 23 out of 2500 places (down from 28) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Interrupted probabilistic random walk after 136299 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{1=1, 4=1, 5=1, 6=1}
Probabilistic random walk after 136299 steps, saw 112052 distinct states, run finished after 3002 ms. (steps per millisecond=45 ) properties seen :4
Running SMT prover for 19 properties.
[2023-03-08 21:12:39] [INFO ] Invariant cache hit.
[2023-03-08 21:12:41] [INFO ] [Real]Absence check using 1 positive place invariants in 36 ms returned sat
[2023-03-08 21:13:04] [INFO ] After 21784ms SMT Verify possible using state equation in real domain returned unsat :0 sat :8 real:11
[2023-03-08 21:13:04] [INFO ] After 21835ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :8 real:11
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-08 21:13:04] [INFO ] After 25103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :8 real:11
[2023-03-08 21:13:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 35 ms returned sat
[2023-03-08 21:13:30] [INFO ] After 22579ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2023-03-08 21:13:30] [INFO ] After 22581ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-08 21:13:30] [INFO ] After 25199ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Fused 19 Parikh solutions to 14 different solutions.
Finished Parikh walk after 29358 steps, including 0 resets, run visited all 1 properties in 366 ms. (steps per millisecond=80 )
Parikh walk visited 19 properties in 8947 ms.
FORMULA Diffusion2D-PT-D50N100-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F((F(G(p1))&&G(p2))))))'
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 875 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
[2023-03-08 21:13:40] [INFO ] Invariant cache hit.
[2023-03-08 21:13:41] [INFO ] Implicit Places using invariants in 471 ms returned []
Implicit Place search using SMT only with invariants took 473 ms to find 0 implicit places.
[2023-03-08 21:13:41] [INFO ] Invariant cache hit.
[2023-03-08 21:13:57] [INFO ] Dead Transitions using invariants and state equation in 16838 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18193 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 638 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), true, (OR (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LT s254 1), p2:(LT s1395 1), p1:(LT s2240 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 6625 ms.
Stack based approach found an accepted trace after 13548 steps with 0 reset with depth 13549 and stack size 13528 in 565 ms.
FORMULA Diffusion2D-PT-D50N100-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Diffusion2D-PT-D50N100-LTLFireability-00 finished in 26230 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19388 edges and 2500 vertex of which 2499 / 2500 are part of one of the 1 SCC in 49 ms
Free SCC test removed 2498 places
Ensure Unique test removed 19401 transitions
Reduce isomorphic transitions removed 19401 transitions.
Applied a total of 1 rules in 106 ms. Remains 2 /2500 variables (removed 2498) and now considering 3/19404 (removed 19401) transitions.
// Phase 1: matrix 3 rows 2 cols
[2023-03-08 21:14:05] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-08 21:14:05] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-08 21:14:05] [INFO ] Invariant cache hit.
[2023-03-08 21:14:05] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-03-08 21:14:05] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 21:14:05] [INFO ] Invariant cache hit.
[2023-03-08 21:14:05] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/2500 places, 3/19404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 216 ms. Remains : 2/2500 places, 3/19404 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLFireability-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:(LT s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D50N100-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N100-LTLFireability-01 finished in 345 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(p1&&F(p2)))))'
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 852 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2023-03-08 21:14:07] [INFO ] Computed 1 place invariants in 116 ms
[2023-03-08 21:14:07] [INFO ] Implicit Places using invariants in 530 ms returned []
Implicit Place search using SMT only with invariants took 533 ms to find 0 implicit places.
[2023-03-08 21:14:07] [INFO ] Invariant cache hit.
[2023-03-08 21:14:20] [INFO ] Dead Transitions using invariants and state equation in 13009 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14405 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 221 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p2:(GEQ s1939 1), p0:(AND (LT s666 1) (GEQ s1939 1)), p1:(GEQ s2051 1)], 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, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Diffusion2D-PT-D50N100-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N100-LTLFireability-02 finished in 14685 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)&&(G(p1)||F(((X(p2)&&G(p0))||G(p2))))))))'
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 765 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
[2023-03-08 21:14:21] [INFO ] Invariant cache hit.
[2023-03-08 21:14:21] [INFO ] Implicit Places using invariants in 377 ms returned []
Implicit Place search using SMT only with invariants took 380 ms to find 0 implicit places.
[2023-03-08 21:14:21] [INFO ] Invariant cache hit.
[2023-03-08 21:14:37] [INFO ] Dead Transitions using invariants and state equation in 15629 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16777 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 696 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 6}, { cond=(AND p1 p0), acceptance={} source=1 dest: 7}, { cond=(AND p1 p0), acceptance={} source=1 dest: 8}], [{ cond=(NOT p0), acceptance={0, 1, 2} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 2} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=3 dest: 3}, { cond=(AND (NOT p1) p2 p0), acceptance={0, 2} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1, 2} source=3 dest: 4}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=3 dest: 5}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=3 dest: 5}, { cond=(AND p1 p2 (NOT p0)), acceptance={2} source=3 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1, 2} source=3 dest: 6}, { cond=(AND p1 p2 p0), acceptance={2} source=3 dest: 7}, { cond=(AND p1 (NOT p2) p0), acceptance={1, 2} source=3 dest: 7}, { cond=(AND p1 p2 p0), acceptance={} source=3 dest: 8}, { cond=(AND p1 (NOT p2) p0), acceptance={1} source=3 dest: 8}, { cond=(AND p1 p2 p0), acceptance={0} source=3 dest: 9}, { cond=(AND p1 (NOT p2) p0), acceptance={0, 1} source=3 dest: 9}, { cond=(AND p1 p2 (NOT p0)), acceptance={0, 2} source=3 dest: 9}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=3 dest: 9}, { cond=(AND p1 p2 p0), acceptance={0, 2} source=3 dest: 10}, { cond=(AND p1 (NOT p2) p0), acceptance={0, 1, 2} source=3 dest: 10}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1, 2} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=4 dest: 5}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1, 2} source=4 dest: 6}, { cond=(AND p1 (NOT p2) p0), acceptance={1, 2} source=4 dest: 7}, { cond=(AND p1 (NOT p2) p0), acceptance={1} source=4 dest: 8}, { cond=(AND p1 (NOT p2) p0), acceptance={0, 1} source=4 dest: 9}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=4 dest: 9}, { cond=(AND p1 (NOT p2) p0), acceptance={0, 1, 2} source=4 dest: 10}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 2} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=5 dest: 3}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=5 dest: 5}, { cond=(AND p1 p2 (NOT p0)), acceptance={2} source=5 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1, 2} source=5 dest: 6}, { cond=(AND p1 p2 p0), acceptance={} source=5 dest: 8}, { cond=(AND p1 (NOT p2) p0), acceptance={1} source=5 dest: 8}, { cond=(AND p1 p2 p0), acceptance={0} source=5 dest: 9}, { cond=(AND p1 (NOT p2) p0), acceptance={0, 1} source=5 dest: 9}, { cond=(AND p1 p2 (NOT p0)), acceptance={0, 2} source=5 dest: 9}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=5 dest: 9}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 2} source=6 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=6 dest: 3}, { cond=(AND (NOT p1) p2 p0), acceptance={0, 2} source=6 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1, 2} source=6 dest: 4}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=6 dest: 5}, { cond=(AND p1 p2 (NOT p0)), acceptance={2} source=6 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1, 2} source=6 dest: 6}, { cond=(AND p1 p2 p0), acceptance={2} source=6 dest: 7}, { cond=(AND p1 (NOT p2) p0), acceptance={1, 2} source=6 dest: 7}, { cond=(AND p1 p2 p0), acceptance={} source=6 dest: 8}, { cond=(AND p1 (NOT p2) p0), acceptance={1} source=6 dest: 8}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=7 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1, 2} source=7 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=7 dest: 5}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1, 2} source=7 dest: 6}, { cond=(AND p1 (NOT p2) p0), acceptance={1, 2} source=7 dest: 7}, { cond=(AND p1 (NOT p2) p0), acceptance={1} source=7 dest: 8}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 2} source=8 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=8 dest: 3}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=8 dest: 5}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=8 dest: 5}, { cond=(AND p1 p2 (NOT p0)), acceptance={2} source=8 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1, 2} source=8 dest: 6}, { cond=(AND p1 p2 p0), acceptance={} source=8 dest: 8}, { cond=(AND p1 (NOT p2) p0), acceptance={1} source=8 dest: 8}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 2} source=9 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=9 dest: 3}, { cond=(AND p1 p2 (NOT p0)), acceptance={2} source=9 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1, 2} source=9 dest: 6}, { cond=(AND p1 p2 (NOT p0)), acceptance={0, 2} source=9 dest: 9}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=9 dest: 9}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=10 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1, 2} source=10 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=10 dest: 9}]], initial=0, aps=[p1:(LT s298 1), p0:(LT s1474 1), p2:(LT s949 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 51 reset in 3519 ms.
Product exploration explored 100000 steps with 22 reset in 4303 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p2 p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 1838 ms. Reduced automaton from 11 states, 85 edges and 3 AP (stutter sensitive) to 10 states, 76 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 631 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 156355 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :{}
Probabilistic random walk after 156355 steps, saw 127816 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :0
Running SMT prover for 8 properties.
[2023-03-08 21:14:52] [INFO ] Invariant cache hit.
[2023-03-08 21:14:53] [INFO ] [Real]Absence check using 1 positive place invariants in 20 ms returned sat
[2023-03-08 21:15:05] [INFO ] After 12691ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:7
[2023-03-08 21:15:07] [INFO ] After 13984ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-08 21:15:07] [INFO ] After 14955ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-08 21:15:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 33 ms returned sat
[2023-03-08 21:15:32] [INFO ] After 23447ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-08 21:15:35] [INFO ] Deduced a trap composed of 2500 places in 3726 ms of which 13 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-08 21:15:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-08 21:15:35] [INFO ] After 28775ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Finished Parikh walk after 11689 steps, including 0 resets, run visited all 2 properties in 237 ms. (steps per millisecond=49 )
Parikh walk visited 8 properties in 964 ms.
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p2 p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 p2)), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND p0 p1 p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND p0 (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 p1 (NOT p2)))]
Knowledge based reduction with 16 factoid took 1900 ms. Reduced automaton from 10 states, 76 edges and 3 AP (stutter sensitive) to 10 states, 76 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 644 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 642 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 878 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
[2023-03-08 21:15:40] [INFO ] Invariant cache hit.
[2023-03-08 21:15:41] [INFO ] Implicit Places using invariants in 406 ms returned []
Implicit Place search using SMT only with invariants took 412 ms to find 0 implicit places.
[2023-03-08 21:15:41] [INFO ] Invariant cache hit.
[2023-03-08 21:15:58] [INFO ] Dead Transitions using invariants and state equation in 16908 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18202 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (X (AND p0 p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 657 ms. Reduced automaton from 10 states, 76 edges and 3 AP (stutter sensitive) to 10 states, 76 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 618 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10003 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 159368 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :{}
Probabilistic random walk after 159368 steps, saw 130188 distinct states, run finished after 3001 ms. (steps per millisecond=53 ) properties seen :0
Running SMT prover for 8 properties.
[2023-03-08 21:16:02] [INFO ] Invariant cache hit.
[2023-03-08 21:16:04] [INFO ] [Real]Absence check using 1 positive place invariants in 33 ms returned sat
[2023-03-08 21:16:16] [INFO ] After 12055ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:7
[2023-03-08 21:16:17] [INFO ] After 13271ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-08 21:16:17] [INFO ] After 14496ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-08 21:16:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 33 ms returned sat
[2023-03-08 21:16:42] [INFO ] After 23545ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-08 21:16:42] [INFO ] After 23547ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-08 21:16:42] [INFO ] After 25132ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Finished Parikh walk after 10871 steps, including 0 resets, run visited all 3 properties in 221 ms. (steps per millisecond=49 )
Parikh walk visited 8 properties in 817 ms.
Knowledge obtained : [(AND p0 p1 p2), (X (X (AND p0 p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 p2)), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND p0 p1 p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND p0 (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 p1 (NOT p2)))]
Knowledge based reduction with 9 factoid took 1223 ms. Reduced automaton from 10 states, 76 edges and 3 AP (stutter sensitive) to 10 states, 76 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 558 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 702 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 612 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 16 reset in 3298 ms.
Product exploration explored 100000 steps with 17 reset in 3280 ms.
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 938 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
[2023-03-08 21:16:54] [INFO ] Invariant cache hit.
[2023-03-08 21:16:54] [INFO ] Implicit Places using invariants in 558 ms returned []
Implicit Place search using SMT only with invariants took 564 ms to find 0 implicit places.
[2023-03-08 21:16:54] [INFO ] Invariant cache hit.
[2023-03-08 21:17:07] [INFO ] Dead Transitions using invariants and state equation in 12177 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13684 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Treatment of property Diffusion2D-PT-D50N100-LTLFireability-04 finished in 167443 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19388 edges and 2500 vertex of which 2499 / 2500 are part of one of the 1 SCC in 19 ms
Free SCC test removed 2498 places
Ensure Unique test removed 19401 transitions
Reduce isomorphic transitions removed 19401 transitions.
Applied a total of 1 rules in 64 ms. Remains 2 /2500 variables (removed 2498) and now considering 3/19404 (removed 19401) transitions.
// Phase 1: matrix 3 rows 2 cols
[2023-03-08 21:17:08] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-08 21:17:08] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-08 21:17:08] [INFO ] Invariant cache hit.
[2023-03-08 21:17:08] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2023-03-08 21:17:08] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 21:17:08] [INFO ] Invariant cache hit.
[2023-03-08 21:17:08] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/2500 places, 3/19404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 139 ms. Remains : 2/2500 places, 3/19404 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D50N100-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N100-LTLFireability-06 finished in 212 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 578 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2023-03-08 21:17:09] [INFO ] Computed 1 place invariants in 100 ms
[2023-03-08 21:17:09] [INFO ] Implicit Places using invariants in 442 ms returned []
Implicit Place search using SMT only with invariants took 444 ms to find 0 implicit places.
[2023-03-08 21:17:09] [INFO ] Invariant cache hit.
[2023-03-08 21:17:25] [INFO ] Dead Transitions using invariants and state equation in 16516 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17541 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLFireability-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:(GEQ s1255 1)], 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 23 reset in 2881 ms.
Stack based approach found an accepted trace after 44 steps with 0 reset with depth 45 and stack size 45 in 1 ms.
FORMULA Diffusion2D-PT-D50N100-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Diffusion2D-PT-D50N100-LTLFireability-08 finished in 20540 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)||(p2&&X(p2))))))'
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 646 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
[2023-03-08 21:17:29] [INFO ] Invariant cache hit.
[2023-03-08 21:17:30] [INFO ] Implicit Places using invariants in 511 ms returned []
Implicit Place search using SMT only with invariants took 512 ms to find 0 implicit places.
[2023-03-08 21:17:30] [INFO ] Invariant cache hit.
[2023-03-08 21:17:47] [INFO ] Dead Transitions using invariants and state equation in 17769 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18935 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}]], initial=0, aps=[p1:(GEQ s2348 1), p0:(LT s798 1), p2:(LT s646 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 7 reset in 3937 ms.
Product exploration explored 100000 steps with 12 reset in 3455 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 396 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10098 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=918 ) properties (out of 4) 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 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 16 ms. (steps per millisecond=625 ) properties (out of 4) 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 4) seen :0
Interrupted probabilistic random walk after 191114 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :{}
Probabilistic random walk after 191114 steps, saw 154780 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-08 21:17:59] [INFO ] Invariant cache hit.
[2023-03-08 21:17:59] [INFO ] [Real]Absence check using 1 positive place invariants in 22 ms returned sat
[2023-03-08 21:18:10] [INFO ] After 10334ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-08 21:18:11] [INFO ] After 11642ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 21:18:11] [INFO ] After 12472ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 21:18:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 32 ms returned sat
[2023-03-08 21:18:26] [INFO ] After 13382ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 21:18:31] [INFO ] After 18375ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2999 ms.
[2023-03-08 21:18:34] [INFO ] After 22427ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Finished Parikh walk after 24125 steps, including 0 resets, run visited all 4 properties in 842 ms. (steps per millisecond=28 )
Parikh walk visited 4 properties in 845 ms.
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 p2)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) p2))]
Knowledge based reduction with 9 factoid took 512 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 887 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
[2023-03-08 21:18:36] [INFO ] Invariant cache hit.
[2023-03-08 21:18:37] [INFO ] Implicit Places using invariants in 397 ms returned []
Implicit Place search using SMT only with invariants took 398 ms to find 0 implicit places.
[2023-03-08 21:18:37] [INFO ] Invariant cache hit.
[2023-03-08 21:18:53] [INFO ] Dead Transitions using invariants and state equation in 16117 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17405 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 561 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10003 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) 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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) 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 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 176526 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 176526 steps, saw 143240 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-08 21:18:57] [INFO ] Invariant cache hit.
[2023-03-08 21:18:57] [INFO ] [Real]Absence check using 1 positive place invariants in 30 ms returned sat
[2023-03-08 21:19:08] [INFO ] After 10442ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-08 21:19:10] [INFO ] After 11917ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 21:19:10] [INFO ] After 12777ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 21:19:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 28 ms returned sat
[2023-03-08 21:19:25] [INFO ] After 14688ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 21:19:31] [INFO ] After 20508ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2715 ms.
[2023-03-08 21:19:34] [INFO ] After 24247ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Finished Parikh walk after 21825 steps, including 0 resets, run visited all 1 properties in 270 ms. (steps per millisecond=80 )
Parikh walk visited 4 properties in 1216 ms.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 p2)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) p2))]
Knowledge based reduction with 9 factoid took 692 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 5 reset in 4490 ms.
Product exploration explored 100000 steps with 10 reset in 3577 ms.
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 603 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
[2023-03-08 21:19:45] [INFO ] Invariant cache hit.
[2023-03-08 21:19:45] [INFO ] Implicit Places using invariants in 365 ms returned []
Implicit Place search using SMT only with invariants took 366 ms to find 0 implicit places.
[2023-03-08 21:19:45] [INFO ] Invariant cache hit.
[2023-03-08 21:20:02] [INFO ] Dead Transitions using invariants and state equation in 16286 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17256 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Treatment of property Diffusion2D-PT-D50N100-LTLFireability-10 finished in 153582 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 865 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
[2023-03-08 21:20:03] [INFO ] Invariant cache hit.
[2023-03-08 21:20:03] [INFO ] Implicit Places using invariants in 366 ms returned []
Implicit Place search using SMT only with invariants took 367 ms to find 0 implicit places.
[2023-03-08 21:20:03] [INFO ] Invariant cache hit.
[2023-03-08 21:20:21] [INFO ] Dead Transitions using invariants and state equation in 17621 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18856 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LT s1447 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 21617 steps with 0 reset in 1014 ms.
FORMULA Diffusion2D-PT-D50N100-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N100-LTLFireability-11 finished in 19996 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19388 edges and 2500 vertex of which 2499 / 2500 are part of one of the 1 SCC in 7 ms
Free SCC test removed 2498 places
Ensure Unique test removed 19401 transitions
Reduce isomorphic transitions removed 19401 transitions.
Applied a total of 1 rules in 25 ms. Remains 2 /2500 variables (removed 2498) and now considering 3/19404 (removed 19401) transitions.
// Phase 1: matrix 3 rows 2 cols
[2023-03-08 21:20:22] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-08 21:20:22] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-08 21:20:22] [INFO ] Invariant cache hit.
[2023-03-08 21:20:22] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-03-08 21:20:22] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 21:20:22] [INFO ] Invariant cache hit.
[2023-03-08 21:20:22] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/2500 places, 3/19404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 99 ms. Remains : 2/2500 places, 3/19404 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLFireability-13 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:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D50N100-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N100-LTLFireability-13 finished in 196 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U p1))'
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19372 edges and 2500 vertex of which 2498 / 2500 are part of one of the 1 SCC in 6 ms
Free SCC test removed 2497 places
Ensure Unique test removed 19399 transitions
Reduce isomorphic transitions removed 19399 transitions.
Applied a total of 1 rules in 24 ms. Remains 3 /2500 variables (removed 2497) and now considering 5/19404 (removed 19399) transitions.
// Phase 1: matrix 5 rows 3 cols
[2023-03-08 21:20:22] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-08 21:20:22] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-08 21:20:22] [INFO ] Invariant cache hit.
[2023-03-08 21:20:22] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2023-03-08 21:20:22] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 21:20:22] [INFO ] Invariant cache hit.
[2023-03-08 21:20:22] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/2500 places, 5/19404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 108 ms. Remains : 3/2500 places, 5/19404 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), true, (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s1 1), p0:(LT s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D50N100-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N100-LTLFireability-14 finished in 252 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p0||G(p1)))&&F(p2))))'
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19356 edges and 2500 vertex of which 2497 / 2500 are part of one of the 1 SCC in 15 ms
Free SCC test removed 2496 places
Ensure Unique test removed 19397 transitions
Reduce isomorphic transitions removed 19397 transitions.
Applied a total of 1 rules in 41 ms. Remains 4 /2500 variables (removed 2496) and now considering 7/19404 (removed 19397) transitions.
// Phase 1: matrix 7 rows 4 cols
[2023-03-08 21:20:23] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-08 21:20:23] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-08 21:20:23] [INFO ] Invariant cache hit.
[2023-03-08 21:20:23] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-08 21:20:23] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 21:20:23] [INFO ] Invariant cache hit.
[2023-03-08 21:20:23] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/2500 places, 7/19404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 152 ms. Remains : 4/2500 places, 7/19404 transitions.
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s0 1), p1:(GEQ s2 1), p2:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D50N100-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N100-LTLFireability-15 finished in 352 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)&&(G(p1)||F(((X(p2)&&G(p0))||G(p2))))))))'
Found a Shortening insensitive property : Diffusion2D-PT-D50N100-LTLFireability-04
Stuttering acceptance computed with spot in 678 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19356 edges and 2500 vertex of which 2497 / 2500 are part of one of the 1 SCC in 9 ms
Free SCC test removed 2496 places
Ensure Unique test removed 19397 transitions
Reduce isomorphic transitions removed 19397 transitions.
Applied a total of 1 rules in 33 ms. Remains 4 /2500 variables (removed 2496) and now considering 7/19404 (removed 19397) transitions.
[2023-03-08 21:20:24] [INFO ] Invariant cache hit.
[2023-03-08 21:20:24] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-08 21:20:24] [INFO ] Invariant cache hit.
[2023-03-08 21:20:24] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-03-08 21:20:24] [INFO ] Invariant cache hit.
[2023-03-08 21:20:24] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 4/2500 places, 7/19404 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 125 ms. Remains : 4/2500 places, 7/19404 transitions.
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 6}, { cond=(AND p1 p0), acceptance={} source=1 dest: 7}, { cond=(AND p1 p0), acceptance={} source=1 dest: 8}], [{ cond=(NOT p0), acceptance={0, 1, 2} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 2} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=3 dest: 3}, { cond=(AND (NOT p1) p2 p0), acceptance={0, 2} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1, 2} source=3 dest: 4}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=3 dest: 5}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=3 dest: 5}, { cond=(AND p1 p2 (NOT p0)), acceptance={2} source=3 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1, 2} source=3 dest: 6}, { cond=(AND p1 p2 p0), acceptance={2} source=3 dest: 7}, { cond=(AND p1 (NOT p2) p0), acceptance={1, 2} source=3 dest: 7}, { cond=(AND p1 p2 p0), acceptance={} source=3 dest: 8}, { cond=(AND p1 (NOT p2) p0), acceptance={1} source=3 dest: 8}, { cond=(AND p1 p2 p0), acceptance={0} source=3 dest: 9}, { cond=(AND p1 (NOT p2) p0), acceptance={0, 1} source=3 dest: 9}, { cond=(AND p1 p2 (NOT p0)), acceptance={0, 2} source=3 dest: 9}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=3 dest: 9}, { cond=(AND p1 p2 p0), acceptance={0, 2} source=3 dest: 10}, { cond=(AND p1 (NOT p2) p0), acceptance={0, 1, 2} source=3 dest: 10}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1, 2} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=4 dest: 5}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1, 2} source=4 dest: 6}, { cond=(AND p1 (NOT p2) p0), acceptance={1, 2} source=4 dest: 7}, { cond=(AND p1 (NOT p2) p0), acceptance={1} source=4 dest: 8}, { cond=(AND p1 (NOT p2) p0), acceptance={0, 1} source=4 dest: 9}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=4 dest: 9}, { cond=(AND p1 (NOT p2) p0), acceptance={0, 1, 2} source=4 dest: 10}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 2} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=5 dest: 3}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=5 dest: 5}, { cond=(AND p1 p2 (NOT p0)), acceptance={2} source=5 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1, 2} source=5 dest: 6}, { cond=(AND p1 p2 p0), acceptance={} source=5 dest: 8}, { cond=(AND p1 (NOT p2) p0), acceptance={1} source=5 dest: 8}, { cond=(AND p1 p2 p0), acceptance={0} source=5 dest: 9}, { cond=(AND p1 (NOT p2) p0), acceptance={0, 1} source=5 dest: 9}, { cond=(AND p1 p2 (NOT p0)), acceptance={0, 2} source=5 dest: 9}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=5 dest: 9}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 2} source=6 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=6 dest: 3}, { cond=(AND (NOT p1) p2 p0), acceptance={0, 2} source=6 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1, 2} source=6 dest: 4}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=6 dest: 5}, { cond=(AND p1 p2 (NOT p0)), acceptance={2} source=6 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1, 2} source=6 dest: 6}, { cond=(AND p1 p2 p0), acceptance={2} source=6 dest: 7}, { cond=(AND p1 (NOT p2) p0), acceptance={1, 2} source=6 dest: 7}, { cond=(AND p1 p2 p0), acceptance={} source=6 dest: 8}, { cond=(AND p1 (NOT p2) p0), acceptance={1} source=6 dest: 8}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=7 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1, 2} source=7 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=7 dest: 5}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1, 2} source=7 dest: 6}, { cond=(AND p1 (NOT p2) p0), acceptance={1, 2} source=7 dest: 7}, { cond=(AND p1 (NOT p2) p0), acceptance={1} source=7 dest: 8}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 2} source=8 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=8 dest: 3}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=8 dest: 5}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=8 dest: 5}, { cond=(AND p1 p2 (NOT p0)), acceptance={2} source=8 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1, 2} source=8 dest: 6}, { cond=(AND p1 p2 p0), acceptance={} source=8 dest: 8}, { cond=(AND p1 (NOT p2) p0), acceptance={1} source=8 dest: 8}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 2} source=9 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=9 dest: 3}, { cond=(AND p1 p2 (NOT p0)), acceptance={2} source=9 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1, 2} source=9 dest: 6}, { cond=(AND p1 p2 (NOT p0)), acceptance={0, 2} source=9 dest: 9}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=9 dest: 9}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=10 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1, 2} source=10 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=10 dest: 9}]], initial=0, aps=[p1:(LT s0 1), p0:(LT s2 1), p2:(LT s1 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 10 steps with 3 reset in 0 ms.
Treatment of property Diffusion2D-PT-D50N100-LTLFireability-04 finished in 1319 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)||(p2&&X(p2))))))'
Found a Shortening insensitive property : Diffusion2D-PT-D50N100-LTLFireability-10
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19356 edges and 2500 vertex of which 2497 / 2500 are part of one of the 1 SCC in 9 ms
Free SCC test removed 2496 places
Ensure Unique test removed 19397 transitions
Reduce isomorphic transitions removed 19397 transitions.
Applied a total of 1 rules in 33 ms. Remains 4 /2500 variables (removed 2496) and now considering 7/19404 (removed 19397) transitions.
[2023-03-08 21:20:25] [INFO ] Invariant cache hit.
[2023-03-08 21:20:25] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-08 21:20:25] [INFO ] Invariant cache hit.
[2023-03-08 21:20:25] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-03-08 21:20:25] [INFO ] Invariant cache hit.
[2023-03-08 21:20:25] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 4/2500 places, 7/19404 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 131 ms. Remains : 4/2500 places, 7/19404 transitions.
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}]], initial=0, aps=[p1:(GEQ s2 1), p0:(LT s1 1), p2:(LT s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
Treatment of property Diffusion2D-PT-D50N100-LTLFireability-10 finished in 484 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-08 21:20:25] [INFO ] Flatten gal took : 362 ms
[2023-03-08 21:20:25] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-08 21:20:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2500 places, 19404 transitions and 38808 arcs took 84 ms.
Total runtime 493839 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Diffusion2D-PT-D50N100
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLFireability
FORMULA Diffusion2D-PT-D50N100-LTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1678310639662
--------------------
content from stderr:
+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLFireability.xml
lola: Created skeleton in 1.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Diffusion2D-PT-D50N100-LTLFireability-04: LTL 0 0 0 0 1 0 0 0
Diffusion2D-PT-D50N100-LTLFireability-10: LTL 0 0 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 10 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 2
lola: LAUNCH task # 4 (type EXCL) for 3 Diffusion2D-PT-D50N100-LTLFireability-10
lola: time limit : 1792 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Diffusion2D-PT-D50N100-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
Diffusion2D-PT-D50N100-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 0/1792 1/32 Diffusion2D-PT-D50N100-LTLFireability-10 3515 m, 703 m/sec, 8102 t fired, .
Time elapsed: 15 secs. Pages in use: 1
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Diffusion2D-PT-D50N100-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
Diffusion2D-PT-D50N100-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/1792 2/32 Diffusion2D-PT-D50N100-LTLFireability-10 66313 m, 12559 m/sec, 264504 t fired, .
Time elapsed: 20 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Diffusion2D-PT-D50N100-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
Diffusion2D-PT-D50N100-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/1792 3/32 Diffusion2D-PT-D50N100-LTLFireability-10 123496 m, 11436 m/sec, 507082 t fired, .
Time elapsed: 25 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Diffusion2D-PT-D50N100-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
Diffusion2D-PT-D50N100-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/1792 4/32 Diffusion2D-PT-D50N100-LTLFireability-10 179973 m, 11295 m/sec, 749229 t fired, .
Time elapsed: 30 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Diffusion2D-PT-D50N100-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
Diffusion2D-PT-D50N100-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/1792 6/32 Diffusion2D-PT-D50N100-LTLFireability-10 236418 m, 11289 m/sec, 991465 t fired, .
Time elapsed: 35 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Diffusion2D-PT-D50N100-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
Diffusion2D-PT-D50N100-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/1792 8/32 Diffusion2D-PT-D50N100-LTLFireability-10 292908 m, 11298 m/sec, 1233600 t fired, .
Time elapsed: 40 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Diffusion2D-PT-D50N100-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
Diffusion2D-PT-D50N100-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 30/1792 9/32 Diffusion2D-PT-D50N100-LTLFireability-10 349668 m, 11352 m/sec, 1476876 t fired, .
Time elapsed: 45 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Diffusion2D-PT-D50N100-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
Diffusion2D-PT-D50N100-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 35/1792 11/32 Diffusion2D-PT-D50N100-LTLFireability-10 406344 m, 11335 m/sec, 1719785 t fired, .
Time elapsed: 50 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Diffusion2D-PT-D50N100-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
Diffusion2D-PT-D50N100-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 40/1792 12/32 Diffusion2D-PT-D50N100-LTLFireability-10 460957 m, 10922 m/sec, 1953783 t fired, .
Time elapsed: 55 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Diffusion2D-PT-D50N100-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
Diffusion2D-PT-D50N100-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 45/1792 14/32 Diffusion2D-PT-D50N100-LTLFireability-10 514822 m, 10773 m/sec, 2184385 t fired, .
Time elapsed: 60 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Diffusion2D-PT-D50N100-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
Diffusion2D-PT-D50N100-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 50/1792 15/32 Diffusion2D-PT-D50N100-LTLFireability-10 568709 m, 10777 m/sec, 2415050 t fired, .
Time elapsed: 65 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Diffusion2D-PT-D50N100-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
Diffusion2D-PT-D50N100-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 55/1792 17/32 Diffusion2D-PT-D50N100-LTLFireability-10 622729 m, 10804 m/sec, 2646594 t fired, .
Time elapsed: 70 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Diffusion2D-PT-D50N100-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
Diffusion2D-PT-D50N100-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 60/1792 18/32 Diffusion2D-PT-D50N100-LTLFireability-10 676626 m, 10779 m/sec, 2877378 t fired, .
Time elapsed: 75 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Diffusion2D-PT-D50N100-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
Diffusion2D-PT-D50N100-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 65/1792 20/32 Diffusion2D-PT-D50N100-LTLFireability-10 730665 m, 10807 m/sec, 3108783 t fired, .
Time elapsed: 80 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Diffusion2D-PT-D50N100-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
Diffusion2D-PT-D50N100-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 70/1792 21/32 Diffusion2D-PT-D50N100-LTLFireability-10 787013 m, 11269 m/sec, 3350319 t fired, .
Time elapsed: 85 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Diffusion2D-PT-D50N100-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
Diffusion2D-PT-D50N100-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 75/1792 23/32 Diffusion2D-PT-D50N100-LTLFireability-10 843123 m, 11222 m/sec, 3590788 t fired, .
Time elapsed: 90 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Diffusion2D-PT-D50N100-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
Diffusion2D-PT-D50N100-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 80/1792 24/32 Diffusion2D-PT-D50N100-LTLFireability-10 899346 m, 11244 m/sec, 3831625 t fired, .
Time elapsed: 95 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Diffusion2D-PT-D50N100-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
Diffusion2D-PT-D50N100-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 85/1792 26/32 Diffusion2D-PT-D50N100-LTLFireability-10 955365 m, 11203 m/sec, 4071508 t fired, .
Time elapsed: 100 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Diffusion2D-PT-D50N100-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
Diffusion2D-PT-D50N100-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 90/1792 28/32 Diffusion2D-PT-D50N100-LTLFireability-10 1011296 m, 11186 m/sec, 4310749 t fired, .
Time elapsed: 105 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Diffusion2D-PT-D50N100-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
Diffusion2D-PT-D50N100-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 95/1792 29/32 Diffusion2D-PT-D50N100-LTLFireability-10 1069433 m, 11627 m/sec, 4546373 t fired, .
Time elapsed: 110 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Diffusion2D-PT-D50N100-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
Diffusion2D-PT-D50N100-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 100/1792 31/32 Diffusion2D-PT-D50N100-LTLFireability-10 1120900 m, 10293 m/sec, 4756022 t fired, .
Time elapsed: 115 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 4 (type EXCL) for Diffusion2D-PT-D50N100-LTLFireability-10 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Diffusion2D-PT-D50N100-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
Diffusion2D-PT-D50N100-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 120 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 1 (type EXCL) for 0 Diffusion2D-PT-D50N100-LTLFireability-04
lola: time limit : 3480 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Diffusion2D-PT-D50N100-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
Diffusion2D-PT-D50N100-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3480 1/32 Diffusion2D-PT-D50N100-LTLFireability-04 60892 m, 12178 m/sec, 240945 t fired, .
Time elapsed: 125 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Diffusion2D-PT-D50N100-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
Diffusion2D-PT-D50N100-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3480 3/32 Diffusion2D-PT-D50N100-LTLFireability-04 121247 m, 12071 m/sec, 495769 t fired, .
Time elapsed: 130 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Diffusion2D-PT-D50N100-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
Diffusion2D-PT-D50N100-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3480 4/32 Diffusion2D-PT-D50N100-LTLFireability-04 178371 m, 11424 m/sec, 740648 t fired, .
Time elapsed: 135 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Diffusion2D-PT-D50N100-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
Diffusion2D-PT-D50N100-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3480 6/32 Diffusion2D-PT-D50N100-LTLFireability-04 235025 m, 11330 m/sec, 983483 t fired, .
Time elapsed: 140 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Diffusion2D-PT-D50N100-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
Diffusion2D-PT-D50N100-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3480 7/32 Diffusion2D-PT-D50N100-LTLFireability-04 291783 m, 11351 m/sec, 1226866 t fired, .
Time elapsed: 145 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Diffusion2D-PT-D50N100-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
Diffusion2D-PT-D50N100-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3480 9/32 Diffusion2D-PT-D50N100-LTLFireability-04 348551 m, 11353 m/sec, 1469800 t fired, .
Time elapsed: 150 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Diffusion2D-PT-D50N100-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
Diffusion2D-PT-D50N100-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3480 11/32 Diffusion2D-PT-D50N100-LTLFireability-04 405066 m, 11303 m/sec, 1711834 t fired, .
Time elapsed: 155 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Diffusion2D-PT-D50N100-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
Diffusion2D-PT-D50N100-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3480 12/32 Diffusion2D-PT-D50N100-LTLFireability-04 459728 m, 10932 m/sec, 1945953 t fired, .
Time elapsed: 160 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Diffusion2D-PT-D50N100-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
Diffusion2D-PT-D50N100-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/3480 14/32 Diffusion2D-PT-D50N100-LTLFireability-04 512138 m, 10482 m/sec, 2170172 t fired, .
Time elapsed: 165 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Diffusion2D-PT-D50N100-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
Diffusion2D-PT-D50N100-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/3480 15/32 Diffusion2D-PT-D50N100-LTLFireability-04 566164 m, 10805 m/sec, 2401576 t fired, .
Time elapsed: 170 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Diffusion2D-PT-D50N100-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
Diffusion2D-PT-D50N100-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 55/3480 17/32 Diffusion2D-PT-D50N100-LTLFireability-04 620187 m, 10804 m/sec, 2632771 t fired, .
Time elapsed: 175 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Diffusion2D-PT-D50N100-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
Diffusion2D-PT-D50N100-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 60/3480 18/32 Diffusion2D-PT-D50N100-LTLFireability-04 674092 m, 10781 m/sec, 2863444 t fired, .
Time elapsed: 180 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Diffusion2D-PT-D50N100-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
Diffusion2D-PT-D50N100-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 65/3480 20/32 Diffusion2D-PT-D50N100-LTLFireability-04 727856 m, 10752 m/sec, 3093725 t fired, .
Time elapsed: 185 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Diffusion2D-PT-D50N100-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
Diffusion2D-PT-D50N100-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 70/3480 21/32 Diffusion2D-PT-D50N100-LTLFireability-04 783845 m, 11197 m/sec, 3333517 t fired, .
Time elapsed: 190 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Diffusion2D-PT-D50N100-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
Diffusion2D-PT-D50N100-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 75/3480 23/32 Diffusion2D-PT-D50N100-LTLFireability-04 839499 m, 11130 m/sec, 3571833 t fired, .
Time elapsed: 195 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Diffusion2D-PT-D50N100-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
Diffusion2D-PT-D50N100-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 80/3480 24/32 Diffusion2D-PT-D50N100-LTLFireability-04 895307 m, 11161 m/sec, 3810974 t fired, .
Time elapsed: 200 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Diffusion2D-PT-D50N100-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
Diffusion2D-PT-D50N100-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 85/3480 26/32 Diffusion2D-PT-D50N100-LTLFireability-04 951249 m, 11188 m/sec, 4050120 t fired, .
Time elapsed: 205 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Diffusion2D-PT-D50N100-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
Diffusion2D-PT-D50N100-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 90/3480 27/32 Diffusion2D-PT-D50N100-LTLFireability-04 1007017 m, 11153 m/sec, 4288754 t fired, .
Time elapsed: 210 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: FINISHED task # 1 (type EXCL) for Diffusion2D-PT-D50N100-LTLFireability-04
lola: result : false
lola: markings : 1040377
lola: fired transitions : 4431407
lola: time used : 93.000000
lola: memory pages used : 28
lola: Portfolio finished: no open tasks 2
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Diffusion2D-PT-D50N100-LTLFireability-04: LTL false LTL model checker
Diffusion2D-PT-D50N100-LTLFireability-10: LTL unknown AGGR
Time elapsed: 213 secs. Pages in use: 32
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="Diffusion2D-PT-D50N100"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is Diffusion2D-PT-D50N100, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r135-smll-167819413900268"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Diffusion2D-PT-D50N100.tgz
mv Diffusion2D-PT-D50N100 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;