About the Execution of LoLa+red for Philosophers-PT-001000
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16217.531 | 1519273.00 | 1637012.00 | 17367.30 | FFT?TFTTFF???FFF | 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.r295-tall-167873947600244.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 Philosophers-PT-001000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r295-tall-167873947600244
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 28M
-rw-r--r-- 1 mcc users 710K Feb 25 14:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 3.6M Feb 25 14:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 646K Feb 25 13:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 4.1M Feb 25 13:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 681K Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 2.5M Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 307K Feb 25 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.5M Feb 25 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 359K Feb 25 15:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.7M Feb 25 15:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.3M Feb 25 14:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 8.2M Feb 25 14:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 95K Feb 25 16:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 261K Feb 25 16:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 2.3M Mar 5 18:23 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 Philosophers-PT-001000-LTLFireability-00
FORMULA_NAME Philosophers-PT-001000-LTLFireability-01
FORMULA_NAME Philosophers-PT-001000-LTLFireability-02
FORMULA_NAME Philosophers-PT-001000-LTLFireability-03
FORMULA_NAME Philosophers-PT-001000-LTLFireability-04
FORMULA_NAME Philosophers-PT-001000-LTLFireability-05
FORMULA_NAME Philosophers-PT-001000-LTLFireability-06
FORMULA_NAME Philosophers-PT-001000-LTLFireability-07
FORMULA_NAME Philosophers-PT-001000-LTLFireability-08
FORMULA_NAME Philosophers-PT-001000-LTLFireability-09
FORMULA_NAME Philosophers-PT-001000-LTLFireability-10
FORMULA_NAME Philosophers-PT-001000-LTLFireability-11
FORMULA_NAME Philosophers-PT-001000-LTLFireability-12
FORMULA_NAME Philosophers-PT-001000-LTLFireability-13
FORMULA_NAME Philosophers-PT-001000-LTLFireability-14
FORMULA_NAME Philosophers-PT-001000-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678806570250
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=Philosophers-PT-001000
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 15:09:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 15:09:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 15:09:32] [INFO ] Load time of PNML (sax parser for PT used): 339 ms
[2023-03-14 15:09:32] [INFO ] Transformed 5000 places.
[2023-03-14 15:09:32] [INFO ] Transformed 5000 transitions.
[2023-03-14 15:09:32] [INFO ] Parsed PT model containing 5000 places and 5000 transitions and 16000 arcs in 438 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 87 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA Philosophers-PT-001000-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-001000-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-001000-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-001000-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-001000-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 5000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 39 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2023-03-14 15:09:32] [INFO ] Computed 2000 place invariants in 48 ms
[2023-03-14 15:09:33] [INFO ] Implicit Places using invariants in 695 ms returned []
[2023-03-14 15:09:33] [INFO ] Invariant cache hit.
[2023-03-14 15:09:33] [INFO ] Implicit Places using invariants and state equation in 477 ms returned []
Implicit Place search using SMT with State Equation took 1195 ms to find 0 implicit places.
[2023-03-14 15:09:33] [INFO ] Invariant cache hit.
[2023-03-14 15:09:36] [INFO ] Dead Transitions using invariants and state equation in 3035 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4273 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Support contains 5000 out of 5000 places after structural reductions.
[2023-03-14 15:09:37] [INFO ] Flatten gal took : 372 ms
[2023-03-14 15:09:38] [INFO ] Flatten gal took : 282 ms
[2023-03-14 15:09:39] [INFO ] Input system was already deterministic with 5000 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1710 ms. (steps per millisecond=5 ) properties (out of 23) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2095 ms. (steps per millisecond=4 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3306 ms. (steps per millisecond=3 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2111 ms. (steps per millisecond=4 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2402 ms. (steps per millisecond=4 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 303 ms. (steps per millisecond=33 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 300 ms. (steps per millisecond=33 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 303 ms. (steps per millisecond=33 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-14 15:09:51] [INFO ] Invariant cache hit.
[2023-03-14 15:09:59] [INFO ] [Real]Absence check using 2000 positive place invariants in 474 ms returned sat
[2023-03-14 15:10:00] [INFO ] After 2300ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-14 15:10:01] [INFO ] [Nat]Absence check using 2000 positive place invariants in 495 ms returned sat
[2023-03-14 15:10:13] [INFO ] After 9290ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-14 15:10:19] [INFO ] After 14830ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 4540 ms.
[2023-03-14 15:10:23] [INFO ] After 23714ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 3 different solutions.
Finished Parikh walk after 934 steps, including 0 resets, run visited all 1 properties in 135 ms. (steps per millisecond=6 )
Parikh walk visited 6 properties in 810 ms.
FORMULA Philosophers-PT-001000-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA Philosophers-PT-001000-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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' '!((p0 U X((F(p1)&&X(G(!p2))))))'
Support contains 4000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 96 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 15:10:25] [INFO ] Invariant cache hit.
[2023-03-14 15:10:26] [INFO ] Implicit Places using invariants in 1019 ms returned []
[2023-03-14 15:10:26] [INFO ] Invariant cache hit.
[2023-03-14 15:10:27] [INFO ] Implicit Places using invariants and state equation in 1016 ms returned []
Implicit Place search using SMT with State Equation took 2037 ms to find 0 implicit places.
[2023-03-14 15:10:27] [INFO ] Invariant cache hit.
[2023-03-14 15:10:30] [INFO ] Dead Transitions using invariants and state equation in 2954 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5095 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 465 ms :[(OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), (NOT p1), p2, true, p2, p2]
Running random walk in product with property : Philosophers-PT-001000-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 6}, { cond=p0, acceptance={} source=2 dest: 7}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}, { cond=p2, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) p2), acceptance={} source=6 dest: 3}, { cond=true, acceptance={} source=6 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={} source=7 dest: 3}, { cond=(NOT p0), acceptance={} source=7 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 7}, { cond=(AND p0 p2), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(OR (GEQ s4356 1) (GEQ s4486 1) (GEQ s4876 1) (GEQ s4616 1) (GEQ s4145 1) (GEQ s4275 1) (GEQ s4746 1) (GEQ s3885 1) (GEQ s4957 1) (GEQ s4437 1) (GEQ s4...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 6 ms.
FORMULA Philosophers-PT-001000-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-001000-LTLFireability-01 finished in 5652 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&&G(F(p1))) U p2)))'
Support contains 5000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 102 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 15:10:30] [INFO ] Invariant cache hit.
[2023-03-14 15:10:31] [INFO ] Implicit Places using invariants in 483 ms returned []
[2023-03-14 15:10:31] [INFO ] Invariant cache hit.
[2023-03-14 15:10:31] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 945 ms to find 0 implicit places.
[2023-03-14 15:10:32] [INFO ] Redundant transitions in 386 ms returned []
[2023-03-14 15:10:32] [INFO ] Invariant cache hit.
[2023-03-14 15:10:35] [INFO ] Dead Transitions using invariants and state equation in 3173 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4617 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p2), true, (NOT p1), (NOT p1), (NOT p2)]
Running random walk in product with property : Philosophers-PT-001000-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(OR p2 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(OR (AND (GEQ s169 1) (GEQ s1227 1)) (AND (GEQ s239 1) (GEQ s1184 1)) (AND (GEQ s59 1) (GEQ s1132 1)) (AND (GEQ s349 1) (GEQ s1279 1)) (AND (GEQ s354 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 1 reset in 5985 ms.
Product exploration explored 100000 steps with 1 reset in 6763 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 p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p0))), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (OR p2 (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 254 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter insensitive) to 5 states, 13 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 163 ms :[(NOT p2), true, (NOT p1), (NOT p1), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1551 ms. (steps per millisecond=6 ) properties (out of 5) seen :1
Interrupted Best-First random walk after 9003 steps, including 2 resets, run timeout after 5176 ms. (steps per millisecond=1 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4843 ms. (steps per millisecond=2 ) properties (out of 4) seen :0
Interrupted Best-First random walk after 8001 steps, including 1 resets, run timeout after 5113 ms. (steps per millisecond=1 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4680 ms. (steps per millisecond=2 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-14 15:11:10] [INFO ] Invariant cache hit.
[2023-03-14 15:11:27] [INFO ] [Real]Absence check using 2000 positive place invariants in 476 ms returned sat
[2023-03-14 15:11:28] [INFO ] After 6318ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:2
[2023-03-14 15:11:30] [INFO ] [Nat]Absence check using 2000 positive place invariants in 501 ms returned sat
[2023-03-14 15:11:53] [INFO ] After 25035ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 68 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1321 ms. (steps per millisecond=7 ) properties (out of 2) seen :0
Interrupted Best-First random walk after 7003 steps, including 1 resets, run timeout after 5267 ms. (steps per millisecond=1 ) properties seen 0
Interrupted Best-First random walk after 9003 steps, including 2 resets, run timeout after 5130 ms. (steps per millisecond=1 ) properties seen 0
Probabilistic random walk after 143608 steps, saw 143517 distinct states, run finished after 33002 ms. (steps per millisecond=4 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-14 15:12:38] [INFO ] Invariant cache hit.
[2023-03-14 15:12:48] [INFO ] [Real]Absence check using 2000 positive place invariants in 484 ms returned sat
[2023-03-14 15:12:49] [INFO ] After 3684ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 15:12:52] [INFO ] [Nat]Absence check using 2000 positive place invariants in 640 ms returned sat
[2023-03-14 15:13:14] [INFO ] After 13776ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 15:13:14] [INFO ] After 13789ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-14 15:13:14] [INFO ] After 25062ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 38 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 35 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 15:13:14] [INFO ] Invariant cache hit.
[2023-03-14 15:13:15] [INFO ] Implicit Places using invariants in 474 ms returned []
[2023-03-14 15:13:15] [INFO ] Invariant cache hit.
[2023-03-14 15:13:15] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 939 ms to find 0 implicit places.
[2023-03-14 15:13:15] [INFO ] Redundant transitions in 305 ms returned []
[2023-03-14 15:13:15] [INFO ] Invariant cache hit.
[2023-03-14 15:13:19] [INFO ] Dead Transitions using invariants and state equation in 3136 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4426 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p0))), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (OR p2 (NOT p0))), (G (OR (NOT p0) p2)), (G (NOT (AND p0 (NOT p2))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 8 factoid took 359 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 139 ms :[(NOT p2), (NOT p1), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 143 ms :[(NOT p2), (NOT p1), (NOT p1), (NOT p2)]
Support contains 5000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 52 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 15:13:19] [INFO ] Invariant cache hit.
[2023-03-14 15:13:20] [INFO ] Implicit Places using invariants in 503 ms returned []
[2023-03-14 15:13:20] [INFO ] Invariant cache hit.
[2023-03-14 15:13:20] [INFO ] Implicit Places using invariants and state equation in 458 ms returned []
Implicit Place search using SMT with State Equation took 974 ms to find 0 implicit places.
[2023-03-14 15:13:21] [INFO ] Redundant transitions in 201 ms returned []
[2023-03-14 15:13:21] [INFO ] Invariant cache hit.
[2023-03-14 15:13:24] [INFO ] Dead Transitions using invariants and state equation in 3117 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4352 ms. Remains : 5000/5000 places, 5000/5000 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 (NOT p1) p2), (X (NOT p1)), (X p2), (X (NOT (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 155 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p2), (NOT p1), (NOT p1), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1323 ms. (steps per millisecond=7 ) properties (out of 3) seen :1
Interrupted Best-First random walk after 8001 steps, including 1 resets, run timeout after 5113 ms. (steps per millisecond=1 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3994 ms. (steps per millisecond=2 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-14 15:13:35] [INFO ] Invariant cache hit.
[2023-03-14 15:13:42] [INFO ] [Real]Absence check using 2000 positive place invariants in 477 ms returned sat
[2023-03-14 15:13:43] [INFO ] After 3563ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 15:13:46] [INFO ] [Nat]Absence check using 2000 positive place invariants in 521 ms returned sat
[2023-03-14 15:13:53] [INFO ] After 5770ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 15:13:55] [INFO ] After 7704ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1626 ms.
[2023-03-14 15:13:57] [INFO ] After 13611ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 957 steps, including 0 resets, run visited all 2 properties in 184 ms. (steps per millisecond=5 )
Parikh walk visited 2 properties in 194 ms.
Knowledge obtained : [(AND (NOT p1) p2), (X (NOT p1)), (X p2), (X (NOT (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F p1), (F (NOT p2))]
Knowledge based reduction with 4 factoid took 228 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 160 ms :[(NOT p2), (NOT p1), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 196 ms :[(NOT p2), (NOT p1), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 149 ms :[(NOT p2), (NOT p1), (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 5157 ms.
Product exploration explored 100000 steps with 0 reset in 6236 ms.
Support contains 5000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 44 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 15:14:09] [INFO ] Invariant cache hit.
[2023-03-14 15:14:10] [INFO ] Implicit Places using invariants in 490 ms returned []
[2023-03-14 15:14:10] [INFO ] Invariant cache hit.
[2023-03-14 15:14:10] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 938 ms to find 0 implicit places.
[2023-03-14 15:14:11] [INFO ] Redundant transitions in 207 ms returned []
[2023-03-14 15:14:11] [INFO ] Invariant cache hit.
[2023-03-14 15:14:14] [INFO ] Dead Transitions using invariants and state equation in 3275 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4475 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Treatment of property Philosophers-PT-001000-LTLFireability-03 finished in 224227 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(X(X(X(G(((!p1 U (p2||G(!p1)))||p0)))))))'
Support contains 3000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 173 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 15:14:15] [INFO ] Invariant cache hit.
[2023-03-14 15:14:16] [INFO ] Implicit Places using invariants in 1641 ms returned []
[2023-03-14 15:14:16] [INFO ] Invariant cache hit.
[2023-03-14 15:14:18] [INFO ] Implicit Places using invariants and state equation in 1530 ms returned []
Implicit Place search using SMT with State Equation took 3173 ms to find 0 implicit places.
[2023-03-14 15:14:18] [INFO ] Invariant cache hit.
[2023-03-14 15:14:21] [INFO ] Dead Transitions using invariants and state equation in 3172 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6519 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 259 ms :[true, (AND p1 (NOT p2)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Running random walk in product with property : Philosophers-PT-001000-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=p2, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(OR p0 p2), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p2:(AND (NOT (OR (GEQ s4356 1) (GEQ s4486 1) (GEQ s4876 1) (GEQ s4616 1) (GEQ s4145 1) (GEQ s4275 1) (GEQ s4746 1) (GEQ s3885 1) (GEQ s4957 1) (GEQ s4437 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 51651 steps with 0 reset in 2623 ms.
FORMULA Philosophers-PT-001000-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-001000-LTLFireability-05 finished in 9448 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 4 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Performed 996 Post agglomeration using F-continuation condition.Transition count delta: 996
Deduced a syphon composed of 996 places in 1 ms
Reduce places removed 996 places and 0 transitions.
Iterating global reduction 0 with 1992 rules applied. Total rules applied 1992 place count 4004 transition count 4004
Applied a total of 1992 rules in 886 ms. Remains 4004 /5000 variables (removed 996) and now considering 4004/5000 (removed 996) transitions.
// Phase 1: matrix 4004 rows 4004 cols
[2023-03-14 15:14:25] [INFO ] Computed 2000 place invariants in 18 ms
[2023-03-14 15:14:27] [INFO ] Implicit Places using invariants in 2571 ms returned []
[2023-03-14 15:14:27] [INFO ] Invariant cache hit.
[2023-03-14 15:14:31] [INFO ] Implicit Places using invariants and state equation in 3633 ms returned []
Implicit Place search using SMT with State Equation took 6213 ms to find 0 implicit places.
[2023-03-14 15:14:31] [INFO ] Redundant transitions in 136 ms returned []
[2023-03-14 15:14:31] [INFO ] Invariant cache hit.
[2023-03-14 15:14:33] [INFO ] Dead Transitions using invariants and state equation in 2303 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4004/5000 places, 4004/5000 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9545 ms. Remains : 4004/5000 places, 4004/5000 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-PT-001000-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s56 1) (GEQ s1107 1) (GEQ s1900 1) (GEQ s3599 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]]
Product exploration explored 100000 steps with 0 reset in 3753 ms.
Stack based approach found an accepted trace after 2212 steps with 2 reset with depth 1940 and stack size 1940 in 496 ms.
FORMULA Philosophers-PT-001000-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-001000-LTLFireability-09 finished in 13865 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||(F(p1) U p2)))))'
Support contains 3 out of 5000 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 250 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2023-03-14 15:14:38] [INFO ] Computed 2000 place invariants in 25 ms
[2023-03-14 15:14:41] [INFO ] Implicit Places using invariants in 2976 ms returned []
[2023-03-14 15:14:41] [INFO ] Invariant cache hit.
[2023-03-14 15:14:44] [INFO ] Implicit Places using invariants and state equation in 2946 ms returned []
Implicit Place search using SMT with State Equation took 5927 ms to find 0 implicit places.
[2023-03-14 15:14:44] [INFO ] Invariant cache hit.
[2023-03-14 15:14:47] [INFO ] Dead Transitions using invariants and state equation in 3288 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9469 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Philosophers-PT-001000-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s4790 1), p2:(AND (GEQ s682 1) (GEQ s1535 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 timeout after 62640 steps with 11074 reset in 10001 ms.
Product exploration timeout after 52360 steps with 11748 reset in 10001 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 p0) p2)]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 1 factoid took 91 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 996 steps, including 0 resets, run visited all 1 properties in 226 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p0) p2)]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 1 factoid took 132 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 5000 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 310 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 15:15:08] [INFO ] Invariant cache hit.
[2023-03-14 15:15:11] [INFO ] Implicit Places using invariants in 2768 ms returned []
[2023-03-14 15:15:11] [INFO ] Invariant cache hit.
[2023-03-14 15:15:14] [INFO ] Implicit Places using invariants and state equation in 2771 ms returned []
Implicit Place search using SMT with State Equation took 5546 ms to find 0 implicit places.
[2023-03-14 15:15:14] [INFO ] Invariant cache hit.
[2023-03-14 15:15:17] [INFO ] Dead Transitions using invariants and state equation in 2957 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8815 ms. Remains : 5000/5000 places, 5000/5000 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 (NOT p0) p2)]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 1 factoid took 100 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 307 steps, including 0 resets, run visited all 1 properties in 97 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p0) p2)]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 1 factoid took 109 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration timeout after 50830 steps with 13204 reset in 10001 ms.
Product exploration timeout after 52070 steps with 11615 reset in 10001 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Performed 997 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 997 places in 0 ms
Iterating global reduction 0 with 997 rules applied. Total rules applied 997 place count 5000 transition count 5000
Deduced a syphon composed of 997 places in 1 ms
Applied a total of 997 rules in 1164 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 15:15:39] [INFO ] Redundant transitions in 196 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2023-03-14 15:15:39] [INFO ] Computed 2000 place invariants in 40 ms
[2023-03-14 15:15:43] [INFO ] Dead Transitions using invariants and state equation in 3354 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5000/5000 places, 5000/5000 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4724 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Support contains 3 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 261 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2023-03-14 15:15:43] [INFO ] Computed 2000 place invariants in 25 ms
[2023-03-14 15:15:46] [INFO ] Implicit Places using invariants in 2981 ms returned []
[2023-03-14 15:15:46] [INFO ] Invariant cache hit.
[2023-03-14 15:15:49] [INFO ] Implicit Places using invariants and state equation in 2748 ms returned []
Implicit Place search using SMT with State Equation took 5736 ms to find 0 implicit places.
[2023-03-14 15:15:49] [INFO ] Invariant cache hit.
[2023-03-14 15:15:52] [INFO ] Dead Transitions using invariants and state equation in 3130 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9128 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Treatment of property Philosophers-PT-001000-LTLFireability-10 finished in 74213 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)||(p1&&X((F(p2)||G(p1)))))))'
Support contains 4 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 249 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 15:15:52] [INFO ] Invariant cache hit.
[2023-03-14 15:15:55] [INFO ] Implicit Places using invariants in 2799 ms returned []
[2023-03-14 15:15:55] [INFO ] Invariant cache hit.
[2023-03-14 15:15:58] [INFO ] Implicit Places using invariants and state equation in 2902 ms returned []
Implicit Place search using SMT with State Equation took 5708 ms to find 0 implicit places.
[2023-03-14 15:15:58] [INFO ] Invariant cache hit.
[2023-03-14 15:16:01] [INFO ] Dead Transitions using invariants and state equation in 3322 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9280 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : Philosophers-PT-001000-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (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), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(OR (LT s1293 1) (LT s2484 1)), p2:(LT s4531 1), p1:(LT s4708 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][false, false, false, false, false]]
Product exploration timeout after 46570 steps with 23277 reset in 10002 ms.
Product exploration timeout after 45220 steps with 22605 reset in 10002 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 p0 p2 p1), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 2 factoid took 145 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1256 ms. (steps per millisecond=7 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 290 ms. (steps per millisecond=34 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-14 15:16:23] [INFO ] Invariant cache hit.
[2023-03-14 15:16:24] [INFO ] [Real]Absence check using 2000 positive place invariants in 467 ms returned sat
[2023-03-14 15:16:27] [INFO ] After 2965ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-14 15:16:28] [INFO ] After 3262ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 15:16:28] [INFO ] After 4252ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 15:16:29] [INFO ] [Nat]Absence check using 2000 positive place invariants in 488 ms returned sat
[2023-03-14 15:16:32] [INFO ] After 2956ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 15:16:32] [INFO ] After 3207ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 149 ms.
[2023-03-14 15:16:32] [INFO ] After 4373ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 735 steps, including 0 resets, run visited all 1 properties in 88 ms. (steps per millisecond=8 )
Parikh walk visited 1 properties in 90 ms.
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (F (AND (NOT p2) (NOT p0) p1)), (F (AND (NOT p2) (NOT p0))), (F (AND (NOT p2) (NOT p0) (NOT p1))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 209 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Support contains 4 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 248 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 15:16:33] [INFO ] Invariant cache hit.
[2023-03-14 15:16:36] [INFO ] Implicit Places using invariants in 2720 ms returned []
[2023-03-14 15:16:36] [INFO ] Invariant cache hit.
[2023-03-14 15:16:38] [INFO ] Implicit Places using invariants and state equation in 2764 ms returned []
Implicit Place search using SMT with State Equation took 5486 ms to find 0 implicit places.
[2023-03-14 15:16:38] [INFO ] Invariant cache hit.
[2023-03-14 15:16:42] [INFO ] Dead Transitions using invariants and state equation in 3082 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8817 ms. Remains : 5000/5000 places, 5000/5000 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 p2 p0 p1)]
False Knowledge obtained : [(X (NOT p0)), (X p0)]
Knowledge based reduction with 1 factoid took 76 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1323 ms. (steps per millisecond=7 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 301 ms. (steps per millisecond=33 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 311 ms. (steps per millisecond=32 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 319 ms. (steps per millisecond=31 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-14 15:16:44] [INFO ] Invariant cache hit.
[2023-03-14 15:16:45] [INFO ] [Real]Absence check using 2000 positive place invariants in 521 ms returned sat
[2023-03-14 15:16:48] [INFO ] After 2941ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-14 15:16:49] [INFO ] After 3226ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:2
Attempting to minimize the solution found.
Minimization took 147 ms.
[2023-03-14 15:16:49] [INFO ] After 4689ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:2
[2023-03-14 15:16:50] [INFO ] [Nat]Absence check using 2000 positive place invariants in 472 ms returned sat
[2023-03-14 15:16:53] [INFO ] After 3124ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-14 15:16:54] [INFO ] After 3855ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 429 ms.
[2023-03-14 15:16:54] [INFO ] After 5495ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 580 steps, including 0 resets, run visited all 1 properties in 70 ms. (steps per millisecond=8 )
Parikh walk visited 3 properties in 225 ms.
Knowledge obtained : [(AND p2 p0 p1)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 187 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration timeout after 45960 steps with 22973 reset in 10002 ms.
Product exploration timeout after 45110 steps with 22549 reset in 10002 ms.
Applying partial POR strategy [true, false, false, true]
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 4 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Performed 996 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 996 places in 1 ms
Iterating global reduction 0 with 996 rules applied. Total rules applied 996 place count 5000 transition count 5000
Deduced a syphon composed of 996 places in 1 ms
Applied a total of 996 rules in 626 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 15:17:16] [INFO ] Redundant transitions in 198 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2023-03-14 15:17:16] [INFO ] Computed 2000 place invariants in 12 ms
[2023-03-14 15:17:19] [INFO ] Dead Transitions using invariants and state equation in 3149 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5000/5000 places, 5000/5000 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3979 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Support contains 4 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 278 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2023-03-14 15:17:20] [INFO ] Computed 2000 place invariants in 18 ms
[2023-03-14 15:17:22] [INFO ] Implicit Places using invariants in 2782 ms returned []
[2023-03-14 15:17:22] [INFO ] Invariant cache hit.
[2023-03-14 15:17:25] [INFO ] Implicit Places using invariants and state equation in 2752 ms returned []
Implicit Place search using SMT with State Equation took 5536 ms to find 0 implicit places.
[2023-03-14 15:17:25] [INFO ] Invariant cache hit.
[2023-03-14 15:17:28] [INFO ] Dead Transitions using invariants and state equation in 3110 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8926 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Treatment of property Philosophers-PT-001000-LTLFireability-11 finished in 96593 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((G(F(p0))||(!X(X(p1)) U p2))))'
Support contains 6 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 243 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 15:17:29] [INFO ] Invariant cache hit.
[2023-03-14 15:17:32] [INFO ] Implicit Places using invariants in 2780 ms returned []
[2023-03-14 15:17:32] [INFO ] Invariant cache hit.
[2023-03-14 15:17:34] [INFO ] Implicit Places using invariants and state equation in 2738 ms returned []
Implicit Place search using SMT with State Equation took 5520 ms to find 0 implicit places.
[2023-03-14 15:17:34] [INFO ] Invariant cache hit.
[2023-03-14 15:17:37] [INFO ] Dead Transitions using invariants and state equation in 3066 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8829 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 228 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-001000-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 5}, { cond=p1, acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(AND (GEQ s557 1) (GEQ s1446 1)), p0:(OR (LT s71 1) (LT s1146 1)), p1:(AND (GEQ s1541 1) (GEQ s3785 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 43 reset in 8399 ms.
Product exploration timeout after 45110 steps with 78 reset in 10003 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 p2 (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0))))]
Knowledge based reduction with 1 factoid took 125 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 250 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1211 ms. (steps per millisecond=8 ) properties (out of 5) seen :4
Finished Best-First random walk after 2001 steps, including 0 resets, run visited all 1 properties in 67 ms. (steps per millisecond=29 )
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (F p0), (F p1), (F (NOT p2)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 1 factoid took 207 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (NOT p0), (NOT p0)]
Support contains 6 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 242 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 15:17:59] [INFO ] Invariant cache hit.
[2023-03-14 15:18:01] [INFO ] Implicit Places using invariants in 2709 ms returned []
[2023-03-14 15:18:01] [INFO ] Invariant cache hit.
[2023-03-14 15:18:04] [INFO ] Implicit Places using invariants and state equation in 2748 ms returned []
Implicit Place search using SMT with State Equation took 5458 ms to find 0 implicit places.
[2023-03-14 15:18:04] [INFO ] Invariant cache hit.
[2023-03-14 15:18:07] [INFO ] Dead Transitions using invariants and state equation in 3097 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8798 ms. Remains : 5000/5000 places, 5000/5000 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 p2 (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 1 factoid took 120 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 277 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (NOT p0), (NOT p0)]
Finished random walk after 2097 steps, including 0 resets, run visited all 5 properties in 332 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (F p0), (F p1), (F (NOT p2)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 1 factoid took 198 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 240 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 258 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (NOT p0), (NOT p0)]
Product exploration timeout after 44180 steps with 80 reset in 10001 ms.
Product exploration timeout after 51180 steps with 67 reset in 10001 ms.
Applying partial POR strategy [false, false, true, false, true, true, true]
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (NOT p0), (NOT p0)]
Support contains 6 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Performed 994 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 994 places in 1 ms
Iterating global reduction 0 with 994 rules applied. Total rules applied 994 place count 5000 transition count 5000
Deduced a syphon composed of 994 places in 1 ms
Applied a total of 994 rules in 621 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 15:18:30] [INFO ] Redundant transitions in 198 ms returned []
// Phase 1: matrix 5000 rows 5000 cols
[2023-03-14 15:18:30] [INFO ] Computed 2000 place invariants in 18 ms
[2023-03-14 15:18:33] [INFO ] Dead Transitions using invariants and state equation in 3108 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5000/5000 places, 5000/5000 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3936 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Support contains 6 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 232 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2023-03-14 15:18:34] [INFO ] Computed 2000 place invariants in 15 ms
[2023-03-14 15:18:36] [INFO ] Implicit Places using invariants in 2749 ms returned []
[2023-03-14 15:18:36] [INFO ] Invariant cache hit.
[2023-03-14 15:18:39] [INFO ] Implicit Places using invariants and state equation in 2766 ms returned []
Implicit Place search using SMT with State Equation took 5520 ms to find 0 implicit places.
[2023-03-14 15:18:39] [INFO ] Invariant cache hit.
[2023-03-14 15:18:42] [INFO ] Dead Transitions using invariants and state equation in 3084 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8836 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Treatment of property Philosophers-PT-001000-LTLFireability-12 finished in 73872 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) U p1)))'
Support contains 2 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 252 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 15:18:43] [INFO ] Invariant cache hit.
[2023-03-14 15:18:45] [INFO ] Implicit Places using invariants in 2591 ms returned []
[2023-03-14 15:18:45] [INFO ] Invariant cache hit.
[2023-03-14 15:18:48] [INFO ] Implicit Places using invariants and state equation in 2745 ms returned []
Implicit Place search using SMT with State Equation took 5347 ms to find 0 implicit places.
[2023-03-14 15:18:48] [INFO ] Invariant cache hit.
[2023-03-14 15:18:51] [INFO ] Dead Transitions using invariants and state equation in 3021 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8621 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : Philosophers-PT-001000-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s4844 1) (GEQ s3902 1)), p0:(GEQ s3902 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 26 reset in 9910 ms.
Stack based approach found an accepted trace after 11085 steps with 0 reset with depth 11086 and stack size 3341 in 845 ms.
FORMULA Philosophers-PT-001000-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-001000-LTLFireability-13 finished in 19513 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 U (p1||G(p0))))))'
Support contains 3 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Performed 997 Post agglomeration using F-continuation condition.Transition count delta: 997
Deduced a syphon composed of 997 places in 0 ms
Reduce places removed 997 places and 0 transitions.
Iterating global reduction 0 with 1994 rules applied. Total rules applied 1994 place count 4003 transition count 4003
Applied a total of 1994 rules in 538 ms. Remains 4003 /5000 variables (removed 997) and now considering 4003/5000 (removed 997) transitions.
// Phase 1: matrix 4003 rows 4003 cols
[2023-03-14 15:19:03] [INFO ] Computed 2000 place invariants in 14 ms
[2023-03-14 15:19:05] [INFO ] Implicit Places using invariants in 2254 ms returned []
[2023-03-14 15:19:05] [INFO ] Invariant cache hit.
[2023-03-14 15:19:08] [INFO ] Implicit Places using invariants and state equation in 3535 ms returned []
Implicit Place search using SMT with State Equation took 5791 ms to find 0 implicit places.
[2023-03-14 15:19:08] [INFO ] Redundant transitions in 138 ms returned []
[2023-03-14 15:19:08] [INFO ] Invariant cache hit.
[2023-03-14 15:19:11] [INFO ] Dead Transitions using invariants and state equation in 2126 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4003/5000 places, 4003/5000 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8604 ms. Remains : 4003/5000 places, 4003/5000 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-PT-001000-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (LT s4002 1) (NOT (AND (GEQ s1680 1) (GEQ s3632 1)))), p0:(LT s4002 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration timeout after 74400 steps with 17 reset in 10001 ms.
Stack based approach found an accepted trace after 14874 steps with 0 reset with depth 14875 and stack size 7023 in 1445 ms.
FORMULA Philosophers-PT-001000-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-001000-LTLFireability-14 finished in 20146 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&&G(F(p1))) U p2)))'
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||(F(p1) U p2)))))'
Found a Shortening insensitive property : Philosophers-PT-001000-LTLFireability-10
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 5000 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Performed 995 Post agglomeration using F-continuation condition.Transition count delta: 995
Deduced a syphon composed of 995 places in 0 ms
Reduce places removed 995 places and 0 transitions.
Iterating global reduction 0 with 1990 rules applied. Total rules applied 1990 place count 4005 transition count 4005
Applied a total of 1990 rules in 571 ms. Remains 4005 /5000 variables (removed 995) and now considering 4005/5000 (removed 995) transitions.
// Phase 1: matrix 4005 rows 4005 cols
[2023-03-14 15:19:23] [INFO ] Computed 2000 place invariants in 14 ms
[2023-03-14 15:19:25] [INFO ] Implicit Places using invariants in 2377 ms returned []
[2023-03-14 15:19:25] [INFO ] Invariant cache hit.
[2023-03-14 15:19:29] [INFO ] Implicit Places using invariants and state equation in 3621 ms returned []
Implicit Place search using SMT with State Equation took 6000 ms to find 0 implicit places.
[2023-03-14 15:19:29] [INFO ] Invariant cache hit.
[2023-03-14 15:19:31] [INFO ] Dead Transitions using invariants and state equation in 2171 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 4005/5000 places, 4005/5000 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 8742 ms. Remains : 4005/5000 places, 4005/5000 transitions.
Running random walk in product with property : Philosophers-PT-001000-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s4004 1), p2:(AND (GEQ s682 1) (GEQ s1535 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration timeout after 48190 steps with 11456 reset in 10001 ms.
Stack based approach found an accepted trace after 2522 steps with 368 reset with depth 921 and stack size 921 in 657 ms.
Treatment of property Philosophers-PT-001000-LTLFireability-10 finished in 19563 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' '!(X((F(p0)||(p1&&X((F(p2)||G(p1)))))))'
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((G(F(p0))||(!X(X(p1)) U p2))))'
[2023-03-14 15:19:42] [INFO ] Flatten gal took : 162 ms
[2023-03-14 15:19:42] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 25 ms.
[2023-03-14 15:19:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 5000 places, 5000 transitions and 16000 arcs took 30 ms.
Total runtime 611270 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Philosophers-PT-001000
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/371
LTLFireability
BK_STOP 1678808089523
--------------------
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/371/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/371/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/371/LTLFireability.xml
/home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin//../BenchKit_head.sh: line 63: 1762 Killed lola --conf=$BIN_DIR/configfiles/ltlfireabilityconf --formula=$DIR/LTLFireability.xml --verdictfile=$DIR/GenericPropertiesVerdict.xml $DIR/model.pnml
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="Philosophers-PT-001000"
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 Philosophers-PT-001000, 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 r295-tall-167873947600244"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-PT-001000.tgz
mv Philosophers-PT-001000 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 ;