Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r065-tajo-171620414300062.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is BridgeAndVehicles-COL-V50P50N20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r065-tajo-171620414300062
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 6.0K Apr 13 02:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Apr 13 02:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 13 02:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 13 02:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.9K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 03:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 13 03:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 13 03:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 107K Apr 13 03:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 42K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716625802496

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V50P50N20
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202304061127
[2024-05-25 08:30:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 08:30:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 08:30:04] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-25 08:30:05] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-25 08:30:05] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 508 ms
[2024-05-25 08:30:05] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 138 PT places and 218878.0 transition bindings in 28 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2024-05-25 08:30:05] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 6 ms.
[2024-05-25 08:30:05] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 4 formulas.
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 12 stabilizing places and 6 stable transitions
Graph (complete) has 51 edges and 15 vertex of which 13 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Remains 12 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 9 stabilizing places and 6 stable transitions
Graph (complete) has 22 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 320 ms. (steps per millisecond=31 ) properties (out of 23) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 10 rows 12 cols
[2024-05-25 08:30:06] [INFO ] Computed 4 invariants in 3 ms
[2024-05-25 08:30:06] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2024-05-25 08:30:06] [INFO ] After 18ms SMT Verify possible using state equation in real domain returned unsat :3 sat :1
[2024-05-25 08:30:06] [INFO ] After 41ms SMT Verify possible using trap constraints in real domain returned unsat :3 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2024-05-25 08:30:06] [INFO ] After 204ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:1
[2024-05-25 08:30:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 7 ms returned sat
[2024-05-25 08:30:06] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :1
[2024-05-25 08:30:06] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-25 08:30:06] [INFO ] After 79ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :1
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 196 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=98 )
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 10/10 transitions.
Graph (complete) has 20 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 10 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 8 transition count 8
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6 place count 7 transition count 7
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 7 transition count 7
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 8 place count 6 transition count 6
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 6 transition count 6
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 6 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 10 place count 6 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 5 transition count 4
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 5 transition count 3
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 16 place count 3 transition count 2
Applied a total of 16 rules in 17 ms. Remains 3 /12 variables (removed 9) and now considering 2/10 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 3/12 places, 2/10 transitions.
Finished random walk after 51 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=51 )
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
[2024-05-25 08:30:06] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2024-05-25 08:30:06] [INFO ] Flatten gal took : 49 ms
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 08:30:06] [INFO ] Flatten gal took : 3 ms
Arc [1:1*[(MOD (ADD $cA 1) 51)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 51) 51) 51)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 21)]] contains successor/predecessor on variables of sort compteur
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2024-05-25 08:30:06] [INFO ] Unfolded HLPN to a Petri net with 138 places and 2348 transitions 18090 arcs in 122 ms.
[2024-05-25 08:30:06] [INFO ] Unfolded 9 HLPN properties in 0 ms.
Support contains 15 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Applied a total of 0 rules in 103 ms. Remains 138 /138 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2024-05-25 08:30:07] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 138 cols
[2024-05-25 08:30:07] [INFO ] Computed 7 invariants in 18 ms
[2024-05-25 08:30:08] [INFO ] Dead Transitions using invariants and state equation in 1762 ms found 0 transitions.
[2024-05-25 08:30:08] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 08:30:08] [INFO ] Invariant cache hit.
[2024-05-25 08:30:09] [INFO ] Implicit Places using invariants in 358 ms returned []
[2024-05-25 08:30:09] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 08:30:09] [INFO ] Invariant cache hit.
[2024-05-25 08:30:09] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 08:30:09] [INFO ] Implicit Places using invariants and state equation in 700 ms returned []
Implicit Place search using SMT with State Equation took 1074 ms to find 0 implicit places.
[2024-05-25 08:30:09] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 08:30:09] [INFO ] Invariant cache hit.
[2024-05-25 08:30:10] [INFO ] Dead Transitions using invariants and state equation in 849 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3814 ms. Remains : 138/138 places, 2348/2348 transitions.
Support contains 15 out of 138 places after structural reductions.
[2024-05-25 08:30:11] [INFO ] Flatten gal took : 302 ms
[2024-05-25 08:30:11] [INFO ] Flatten gal took : 260 ms
[2024-05-25 08:30:11] [INFO ] Input system was already deterministic with 2348 transitions.
Support contains 13 out of 138 places (down from 15) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 452 ms. (steps per millisecond=22 ) properties (out of 19) seen :15
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-25 08:30:12] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 08:30:12] [INFO ] Invariant cache hit.
[2024-05-25 08:30:13] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-25 08:30:13] [INFO ] After 474ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:1
[2024-05-25 08:30:13] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-25 08:30:13] [INFO ] After 83ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :1
[2024-05-25 08:30:13] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 08:30:13] [INFO ] After 169ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :3 sat :1
[2024-05-25 08:30:13] [INFO ] After 317ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :1
Attempting to minimize the solution found.
Minimization took 68 ms.
[2024-05-25 08:30:13] [INFO ] After 536ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :1
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Graph (complete) has 1302 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 135 transition count 2347
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 135 transition count 2347
Applied a total of 3 rules in 615 ms. Remains 135 /138 variables (removed 3) and now considering 2347/2348 (removed 1) transitions.
[2024-05-25 08:30:14] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2024-05-25 08:30:14] [INFO ] Computed 5 invariants in 4 ms
[2024-05-25 08:30:15] [INFO ] Dead Transitions using invariants and state equation in 1224 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1841 ms. Remains : 135/138 places, 2347/2348 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 245242 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :{}
Probabilistic random walk after 245242 steps, saw 65401 distinct states, run finished after 3003 ms. (steps per millisecond=81 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 08:30:18] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 08:30:18] [INFO ] Invariant cache hit.
[2024-05-25 08:30:18] [INFO ] [Real]Absence check using 5 positive place invariants in 20 ms returned sat
[2024-05-25 08:30:18] [INFO ] After 170ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 08:30:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 8 ms returned sat
[2024-05-25 08:30:19] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 08:30:19] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 08:30:19] [INFO ] After 73ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 08:30:19] [INFO ] After 183ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 75 ms.
[2024-05-25 08:30:19] [INFO ] After 410ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 23 ms.
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 2347/2347 transitions.
Applied a total of 0 rules in 459 ms. Remains 135 /135 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 459 ms. Remains : 135/135 places, 2347/2347 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 2347/2347 transitions.
Applied a total of 0 rules in 295 ms. Remains 135 /135 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2024-05-25 08:30:20] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 08:30:20] [INFO ] Invariant cache hit.
[2024-05-25 08:30:20] [INFO ] Implicit Places using invariants in 450 ms returned []
[2024-05-25 08:30:20] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 08:30:20] [INFO ] Invariant cache hit.
[2024-05-25 08:30:20] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 08:30:21] [INFO ] Implicit Places using invariants and state equation in 1211 ms returned [53, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1689 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 133/135 places, 2347/2347 transitions.
Applied a total of 0 rules in 224 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2211 ms. Remains : 133/135 places, 2347/2347 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 311818 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :{}
Probabilistic random walk after 311818 steps, saw 83205 distinct states, run finished after 3001 ms. (steps per millisecond=103 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 08:30:25] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2024-05-25 08:30:25] [INFO ] Computed 5 invariants in 5 ms
[2024-05-25 08:30:25] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-25 08:30:25] [INFO ] After 241ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 08:30:25] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 08:30:25] [INFO ] After 104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 08:30:25] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 08:30:25] [INFO ] After 94ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 08:30:25] [INFO ] After 191ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2024-05-25 08:30:25] [INFO ] After 423ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 345 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 345 ms. Remains : 133/133 places, 2347/2347 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 168 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2024-05-25 08:30:26] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 08:30:26] [INFO ] Invariant cache hit.
[2024-05-25 08:30:26] [INFO ] Implicit Places using invariants in 432 ms returned []
[2024-05-25 08:30:26] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 08:30:26] [INFO ] Invariant cache hit.
[2024-05-25 08:30:26] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 08:30:27] [INFO ] Implicit Places using invariants and state equation in 824 ms returned []
Implicit Place search using SMT with State Equation took 1274 ms to find 0 implicit places.
[2024-05-25 08:30:27] [INFO ] Redundant transitions in 124 ms returned []
[2024-05-25 08:30:27] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 08:30:27] [INFO ] Invariant cache hit.
[2024-05-25 08:30:28] [INFO ] Dead Transitions using invariants and state equation in 677 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2278 ms. Remains : 133/133 places, 2347/2347 transitions.
Ensure Unique test removed 2058 transitions
Reduce isomorphic transitions removed 2058 transitions.
Iterating post reduction 0 with 2058 rules applied. Total rules applied 2058 place count 133 transition count 289
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 2062 place count 131 transition count 287
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 2064 place count 131 transition count 285
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 2066 place count 129 transition count 285
Applied a total of 2066 rules in 17 ms. Remains 129 /133 variables (removed 4) and now considering 285/2347 (removed 2062) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 285 rows 129 cols
[2024-05-25 08:30:28] [INFO ] Computed 5 invariants in 2 ms
[2024-05-25 08:30:28] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 08:30:28] [INFO ] After 193ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 08:30:28] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 08:30:28] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 08:30:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-25 08:30:28] [INFO ] After 15ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 08:30:28] [INFO ] After 56ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2024-05-25 08:30:28] [INFO ] After 217ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Successfully simplified 3 atomic propositions for a total of 9 simplifications.
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 111 stabilizing places and 204 stable transitions
Graph (complete) has 3850 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.16 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p0)||X(X(F((!p0&&X(p1))))))))))'
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 137 transition count 2348
Applied a total of 1 rules in 13 ms. Remains 137 /138 variables (removed 1) and now considering 2348/2348 (removed 0) transitions.
[2024-05-25 08:30:29] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 137 cols
[2024-05-25 08:30:29] [INFO ] Computed 6 invariants in 2 ms
[2024-05-25 08:30:29] [INFO ] Dead Transitions using invariants and state equation in 686 ms found 0 transitions.
[2024-05-25 08:30:29] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 08:30:29] [INFO ] Invariant cache hit.
[2024-05-25 08:30:30] [INFO ] Implicit Places using invariants in 264 ms returned []
[2024-05-25 08:30:30] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 08:30:30] [INFO ] Invariant cache hit.
[2024-05-25 08:30:30] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 08:30:31] [INFO ] Implicit Places using invariants and state equation in 888 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1173 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 136/138 places, 2348/2348 transitions.
Applied a total of 0 rules in 23 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1923 ms. Remains : 136/138 places, 2348/2348 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 322 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(LEQ s106 s107), p1:(LEQ s52 s54)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 249 reset in 934 ms.
Product exploration explored 100000 steps with 251 reset in 973 ms.
Computed a total of 109 stabilizing places and 204 stable transitions
Graph (complete) has 3745 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.40 ms
Computed a total of 109 stabilizing places and 204 stable transitions
Detected a total of 109/136 stabilizing places and 204/2348 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 167 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 398 steps, including 0 resets, run visited all 3 properties in 7 ms. (steps per millisecond=56 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 4 factoid took 173 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 228 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 12 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2024-05-25 08:30:34] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2024-05-25 08:30:34] [INFO ] Computed 5 invariants in 2 ms
[2024-05-25 08:30:35] [INFO ] Dead Transitions using invariants and state equation in 724 ms found 0 transitions.
[2024-05-25 08:30:35] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 08:30:35] [INFO ] Invariant cache hit.
[2024-05-25 08:30:35] [INFO ] Implicit Places using invariants in 301 ms returned []
[2024-05-25 08:30:35] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 08:30:35] [INFO ] Invariant cache hit.
[2024-05-25 08:30:35] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 08:30:36] [INFO ] Implicit Places using invariants and state equation in 1337 ms returned []
Implicit Place search using SMT with State Equation took 1672 ms to find 0 implicit places.
[2024-05-25 08:30:36] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 08:30:36] [INFO ] Invariant cache hit.
[2024-05-25 08:30:37] [INFO ] Dead Transitions using invariants and state equation in 755 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3189 ms. Remains : 136/136 places, 2348/2348 transitions.
Computed a total of 109 stabilizing places and 204 stable transitions
Graph (complete) has 3745 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Computed a total of 109 stabilizing places and 204 stable transitions
Detected a total of 109/136 stabilizing places and 204/2348 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 127 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 409 steps, including 0 resets, run visited all 3 properties in 7 ms. (steps per millisecond=58 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 4 factoid took 197 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 251 reset in 705 ms.
Product exploration explored 100000 steps with 244 reset in 711 ms.
Built C files in :
/tmp/ltsmin1698514864093105249
[2024-05-25 08:30:40] [INFO ] Built C files in 68ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1698514864093105249
Running compilation step : cd /tmp/ltsmin1698514864093105249;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1698514864093105249;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1698514864093105249;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 18 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2024-05-25 08:30:43] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 08:30:43] [INFO ] Invariant cache hit.
[2024-05-25 08:30:44] [INFO ] Dead Transitions using invariants and state equation in 761 ms found 0 transitions.
[2024-05-25 08:30:44] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 08:30:44] [INFO ] Invariant cache hit.
[2024-05-25 08:30:44] [INFO ] Implicit Places using invariants in 276 ms returned []
[2024-05-25 08:30:44] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 08:30:44] [INFO ] Invariant cache hit.
[2024-05-25 08:30:44] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 08:30:45] [INFO ] Implicit Places using invariants and state equation in 982 ms returned []
Implicit Place search using SMT with State Equation took 1296 ms to find 0 implicit places.
[2024-05-25 08:30:45] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 08:30:45] [INFO ] Invariant cache hit.
[2024-05-25 08:30:46] [INFO ] Dead Transitions using invariants and state equation in 740 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2841 ms. Remains : 136/136 places, 2348/2348 transitions.
Built C files in :
/tmp/ltsmin18407198456005495321
[2024-05-25 08:30:46] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18407198456005495321
Running compilation step : cd /tmp/ltsmin18407198456005495321;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18407198456005495321;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18407198456005495321;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 08:30:49] [INFO ] Flatten gal took : 143 ms
[2024-05-25 08:30:50] [INFO ] Flatten gal took : 167 ms
[2024-05-25 08:30:50] [INFO ] Time to serialize gal into /tmp/LTL8551148800006470633.gal : 40 ms
[2024-05-25 08:30:50] [INFO ] Time to serialize properties into /tmp/LTL13855313087856855095.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8551148800006470633.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14786078766084206908.hoa' '-atoms' '/tmp/LTL13855313087856855095.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13855313087856855095.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14786078766084206908.hoa
Detected timeout of ITS tools.
[2024-05-25 08:31:05] [INFO ] Flatten gal took : 174 ms
[2024-05-25 08:31:05] [INFO ] Flatten gal took : 147 ms
[2024-05-25 08:31:05] [INFO ] Time to serialize gal into /tmp/LTL14619832807282917656.gal : 30 ms
[2024-05-25 08:31:05] [INFO ] Time to serialize properties into /tmp/LTL15342770166336307005.ltl : 37 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14619832807282917656.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15342770166336307005.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(F((G("(SUR_PONT_B_0<=ATTENTE_B_0)"))||(X(X(F(("(SUR_PONT_B_0>ATTENTE_B_0)")&&(X("(SORTI_A_0<=SUR_PONT_A_0)")))))))))))
Formula 0 simplified : XXG(F!"(SUR_PONT_B_0<=ATTENTE_B_0)" & XXG(!"(SUR_PONT_B_0>ATTENTE_B_0)" | X!"(SORTI_A_0<=SUR_PONT_A_0)"))
Detected timeout of ITS tools.
[2024-05-25 08:31:21] [INFO ] Flatten gal took : 101 ms
[2024-05-25 08:31:21] [INFO ] Applying decomposition
[2024-05-25 08:31:21] [INFO ] Flatten gal took : 83 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph12395367946183573572.txt' '-o' '/tmp/graph12395367946183573572.bin' '-w' '/tmp/graph12395367946183573572.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12395367946183573572.bin' '-l' '-1' '-v' '-w' '/tmp/graph12395367946183573572.weights' '-q' '0' '-e' '0.001'
[2024-05-25 08:31:21] [INFO ] Decomposing Gal with order
[2024-05-25 08:31:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 08:31:22] [INFO ] Removed a total of 2294 redundant transitions.
[2024-05-25 08:31:22] [INFO ] Flatten gal took : 845 ms
[2024-05-25 08:31:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 384 labels/synchronizations in 73 ms.
[2024-05-25 08:31:23] [INFO ] Time to serialize gal into /tmp/LTL3103527379785579354.gal : 26 ms
[2024-05-25 08:31:23] [INFO ] Time to serialize properties into /tmp/LTL6184057149234367066.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3103527379785579354.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6184057149234367066.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(F((G("(gu1.SUR_PONT_B_0<=gu1.ATTENTE_B_0)"))||(X(X(F(("(gu1.SUR_PONT_B_0>gu1.ATTENTE_B_0)")&&(X("(gu0.SORTI_A_0<=gu0.SUR_PONT_A...170
Formula 0 simplified : XXG(F!"(gu1.SUR_PONT_B_0<=gu1.ATTENTE_B_0)" & XXG(!"(gu1.SUR_PONT_B_0>gu1.ATTENTE_B_0)" | X!"(gu0.SORTI_A_0<=gu0.SUR_PONT_A_0)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11286904493992295357
[2024-05-25 08:31:38] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11286904493992295357
Running compilation step : cd /tmp/ltsmin11286904493992295357;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11286904493992295357;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11286904493992295357;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLCardinality-00 finished in 71954 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(((p0&&G(p1)) U X((p2 U p3))))&&F(p1)))'
Support contains 5 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 137 transition count 2348
Applied a total of 1 rules in 15 ms. Remains 137 /138 variables (removed 1) and now considering 2348/2348 (removed 0) transitions.
[2024-05-25 08:31:41] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 137 cols
[2024-05-25 08:31:41] [INFO ] Computed 6 invariants in 16 ms
[2024-05-25 08:31:42] [INFO ] Dead Transitions using invariants and state equation in 961 ms found 0 transitions.
[2024-05-25 08:31:42] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 08:31:42] [INFO ] Invariant cache hit.
[2024-05-25 08:31:42] [INFO ] Implicit Places using invariants in 274 ms returned []
[2024-05-25 08:31:42] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 08:31:42] [INFO ] Invariant cache hit.
[2024-05-25 08:31:42] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 08:31:43] [INFO ] Implicit Places using invariants and state equation in 926 ms returned [53]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1238 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 136/138 places, 2348/2348 transitions.
Applied a total of 0 rules in 10 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2236 ms. Remains : 136/138 places, 2348/2348 transitions.
Stuttering acceptance computed with spot in 419 ms :[(OR (NOT p1) (NOT p3)), (NOT p3), (NOT p1), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), true, (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p1 p0), acceptance={} source=1 dest: 4}, { cond=(AND p1 p0), acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p3) p2), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 6}], [{ cond=(OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), acceptance={0} source=4 dest: 3}, { cond=(AND p1 p0 (NOT p3)), acceptance={0} source=4 dest: 4}, { cond=(AND p1 p0 (NOT p3)), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=5 dest: 3}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 6}, { cond=p1, acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(LEQ 1 (ADD s111 s112)), p0:(LEQ 1 s107), p3:(LEQ (ADD s111 s112) s108), p2:(AND (LEQ 3 s106) (LEQ 1 s107))], 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, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLCardinality-04 finished in 2718 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((G(F(p0))||(p1&&F(p0))))||(p1 U (p2||G(p1))))))'
Support contains 5 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Applied a total of 0 rules in 26 ms. Remains 138 /138 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2024-05-25 08:31:43] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 138 cols
[2024-05-25 08:31:43] [INFO ] Computed 7 invariants in 3 ms
[2024-05-25 08:31:44] [INFO ] Dead Transitions using invariants and state equation in 690 ms found 0 transitions.
[2024-05-25 08:31:44] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 08:31:44] [INFO ] Invariant cache hit.
[2024-05-25 08:31:44] [INFO ] Implicit Places using invariants in 283 ms returned []
[2024-05-25 08:31:44] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 08:31:44] [INFO ] Invariant cache hit.
[2024-05-25 08:31:44] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 08:31:45] [INFO ] Implicit Places using invariants and state equation in 1079 ms returned [54, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1388 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 136/138 places, 2348/2348 transitions.
Applied a total of 0 rules in 12 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2130 ms. Remains : 136/138 places, 2348/2348 transitions.
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(GT 1 s52), p2:(GT s106 s54), p0:(OR (LEQ s107 s108) (LEQ s106 s54))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 757 ms.
Product exploration explored 100000 steps with 50000 reset in 829 ms.
Computed a total of 109 stabilizing places and 204 stable transitions
Graph (complete) has 3642 edges and 136 vertex of which 134 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.20 ms
Computed a total of 109 stabilizing places and 204 stable transitions
Detected a total of 109/136 stabilizing places and 204/2348 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 14 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLCardinality-05 finished in 4017 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 136 transition count 2348
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 135 transition count 2347
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 135 transition count 2347
Applied a total of 4 rules in 19 ms. Remains 135 /138 variables (removed 3) and now considering 2347/2348 (removed 1) transitions.
[2024-05-25 08:31:47] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2024-05-25 08:31:47] [INFO ] Computed 5 invariants in 1 ms
[2024-05-25 08:31:48] [INFO ] Dead Transitions using invariants and state equation in 660 ms found 0 transitions.
[2024-05-25 08:31:48] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 08:31:48] [INFO ] Invariant cache hit.
[2024-05-25 08:31:48] [INFO ] Implicit Places using invariants in 272 ms returned []
[2024-05-25 08:31:48] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 08:31:48] [INFO ] Invariant cache hit.
[2024-05-25 08:31:48] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 08:31:49] [INFO ] Implicit Places using invariants and state equation in 1014 ms returned [53, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1313 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 133/138 places, 2347/2348 transitions.
Applied a total of 0 rules in 12 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2018 ms. Remains : 133/138 places, 2347/2348 transitions.
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 3 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 241 reset in 802 ms.
Product exploration explored 100000 steps with 241 reset in 841 ms.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Detected a total of 106/133 stabilizing places and 203/2347 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 110 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 23 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 282762 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :{}
Probabilistic random walk after 282762 steps, saw 75646 distinct states, run finished after 3001 ms. (steps per millisecond=94 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 08:31:54] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2024-05-25 08:31:54] [INFO ] Computed 5 invariants in 6 ms
[2024-05-25 08:31:55] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 08:31:55] [INFO ] After 179ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 08:31:55] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-05-25 08:31:55] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 08:31:55] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 08:31:55] [INFO ] After 105ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 08:31:55] [INFO ] After 169ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 52 ms.
[2024-05-25 08:31:55] [INFO ] After 361ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 221 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2024-05-25 08:31:55] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 08:31:55] [INFO ] Invariant cache hit.
[2024-05-25 08:31:56] [INFO ] Dead Transitions using invariants and state equation in 785 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1007 ms. Remains : 133/133 places, 2347/2347 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 292231 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :{}
Probabilistic random walk after 292231 steps, saw 78135 distinct states, run finished after 3001 ms. (steps per millisecond=97 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 08:31:59] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 08:31:59] [INFO ] Invariant cache hit.
[2024-05-25 08:31:59] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 08:31:59] [INFO ] After 159ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 08:31:59] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 08:31:59] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 08:31:59] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 08:32:00] [INFO ] After 114ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 08:32:00] [INFO ] After 195ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2024-05-25 08:32:00] [INFO ] After 402ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 213 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 214 ms. Remains : 133/133 places, 2347/2347 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 182 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2024-05-25 08:32:00] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 08:32:00] [INFO ] Invariant cache hit.
[2024-05-25 08:32:00] [INFO ] Implicit Places using invariants in 269 ms returned []
[2024-05-25 08:32:00] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 08:32:00] [INFO ] Invariant cache hit.
[2024-05-25 08:32:01] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 08:32:01] [INFO ] Implicit Places using invariants and state equation in 709 ms returned []
Implicit Place search using SMT with State Equation took 1029 ms to find 0 implicit places.
[2024-05-25 08:32:01] [INFO ] Redundant transitions in 134 ms returned []
[2024-05-25 08:32:01] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 08:32:01] [INFO ] Invariant cache hit.
[2024-05-25 08:32:02] [INFO ] Dead Transitions using invariants and state equation in 772 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2123 ms. Remains : 133/133 places, 2347/2347 transitions.
Ensure Unique test removed 2058 transitions
Reduce isomorphic transitions removed 2058 transitions.
Iterating post reduction 0 with 2058 rules applied. Total rules applied 2058 place count 133 transition count 289
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 2062 place count 131 transition count 287
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 2064 place count 131 transition count 285
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 2066 place count 129 transition count 285
Applied a total of 2066 rules in 25 ms. Remains 129 /133 variables (removed 4) and now considering 285/2347 (removed 2062) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 285 rows 129 cols
[2024-05-25 08:32:02] [INFO ] Computed 5 invariants in 1 ms
[2024-05-25 08:32:02] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 08:32:02] [INFO ] After 161ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 08:32:02] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 08:32:02] [INFO ] After 65ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 08:32:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-25 08:32:02] [INFO ] After 15ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 08:32:02] [INFO ] After 58ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2024-05-25 08:32:02] [INFO ] After 198ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 127 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[true, (NOT p0)]
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 326 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2024-05-25 08:32:03] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2024-05-25 08:32:03] [INFO ] Computed 5 invariants in 1 ms
[2024-05-25 08:32:04] [INFO ] Dead Transitions using invariants and state equation in 690 ms found 0 transitions.
[2024-05-25 08:32:04] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 08:32:04] [INFO ] Invariant cache hit.
[2024-05-25 08:32:04] [INFO ] Implicit Places using invariants in 279 ms returned []
[2024-05-25 08:32:04] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 08:32:04] [INFO ] Invariant cache hit.
[2024-05-25 08:32:04] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 08:32:05] [INFO ] Implicit Places using invariants and state equation in 675 ms returned []
Implicit Place search using SMT with State Equation took 977 ms to find 0 implicit places.
[2024-05-25 08:32:05] [INFO ] Redundant transitions in 56 ms returned []
[2024-05-25 08:32:05] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 08:32:05] [INFO ] Invariant cache hit.
[2024-05-25 08:32:05] [INFO ] Dead Transitions using invariants and state equation in 666 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2736 ms. Remains : 133/133 places, 2347/2347 transitions.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Detected a total of 106/133 stabilizing places and 203/2347 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 23 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 318311 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :{}
Probabilistic random walk after 318311 steps, saw 84856 distinct states, run finished after 3001 ms. (steps per millisecond=106 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 08:32:09] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 08:32:09] [INFO ] Invariant cache hit.
[2024-05-25 08:32:09] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-25 08:32:09] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 08:32:09] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 08:32:09] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 08:32:09] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 08:32:09] [INFO ] After 87ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 08:32:09] [INFO ] After 150ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2024-05-25 08:32:09] [INFO ] After 324ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 236 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2024-05-25 08:32:09] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 08:32:09] [INFO ] Invariant cache hit.
[2024-05-25 08:32:10] [INFO ] Dead Transitions using invariants and state equation in 748 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 998 ms. Remains : 133/133 places, 2347/2347 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 310489 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :{}
Probabilistic random walk after 310489 steps, saw 82881 distinct states, run finished after 3001 ms. (steps per millisecond=103 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 08:32:13] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 08:32:13] [INFO ] Invariant cache hit.
[2024-05-25 08:32:13] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 08:32:13] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 08:32:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 08:32:14] [INFO ] After 93ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 08:32:14] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 08:32:14] [INFO ] After 120ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 08:32:14] [INFO ] After 174ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2024-05-25 08:32:14] [INFO ] After 374ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 227 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 228 ms. Remains : 133/133 places, 2347/2347 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 219 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2024-05-25 08:32:14] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 08:32:14] [INFO ] Invariant cache hit.
[2024-05-25 08:32:15] [INFO ] Implicit Places using invariants in 353 ms returned []
[2024-05-25 08:32:15] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 08:32:15] [INFO ] Invariant cache hit.
[2024-05-25 08:32:15] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 08:32:15] [INFO ] Implicit Places using invariants and state equation in 699 ms returned []
Implicit Place search using SMT with State Equation took 1064 ms to find 0 implicit places.
[2024-05-25 08:32:15] [INFO ] Redundant transitions in 62 ms returned []
[2024-05-25 08:32:15] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 08:32:15] [INFO ] Invariant cache hit.
[2024-05-25 08:32:16] [INFO ] Dead Transitions using invariants and state equation in 731 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2096 ms. Remains : 133/133 places, 2347/2347 transitions.
Ensure Unique test removed 2058 transitions
Reduce isomorphic transitions removed 2058 transitions.
Iterating post reduction 0 with 2058 rules applied. Total rules applied 2058 place count 133 transition count 289
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 2062 place count 131 transition count 287
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 2064 place count 131 transition count 285
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 2066 place count 129 transition count 285
Applied a total of 2066 rules in 11 ms. Remains 129 /133 variables (removed 4) and now considering 285/2347 (removed 2062) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 285 rows 129 cols
[2024-05-25 08:32:16] [INFO ] Computed 5 invariants in 1 ms
[2024-05-25 08:32:16] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 08:32:16] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 08:32:16] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 08:32:16] [INFO ] After 59ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 08:32:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-25 08:32:16] [INFO ] After 14ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 08:32:16] [INFO ] After 58ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2024-05-25 08:32:16] [INFO ] After 197ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 241 reset in 622 ms.
Product exploration explored 100000 steps with 241 reset in 631 ms.
Built C files in :
/tmp/ltsmin14297858686817844391
[2024-05-25 08:32:18] [INFO ] Too many transitions (2347) to apply POR reductions. Disabling POR matrices.
[2024-05-25 08:32:18] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14297858686817844391
Running compilation step : cd /tmp/ltsmin14297858686817844391;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14297858686817844391;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14297858686817844391;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 264 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2024-05-25 08:32:21] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2024-05-25 08:32:21] [INFO ] Computed 5 invariants in 2 ms
[2024-05-25 08:32:22] [INFO ] Dead Transitions using invariants and state equation in 787 ms found 0 transitions.
[2024-05-25 08:32:22] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 08:32:22] [INFO ] Invariant cache hit.
[2024-05-25 08:32:22] [INFO ] Implicit Places using invariants in 283 ms returned []
[2024-05-25 08:32:22] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 08:32:22] [INFO ] Invariant cache hit.
[2024-05-25 08:32:22] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 08:32:23] [INFO ] Implicit Places using invariants and state equation in 677 ms returned []
Implicit Place search using SMT with State Equation took 974 ms to find 0 implicit places.
[2024-05-25 08:32:23] [INFO ] Redundant transitions in 74 ms returned []
[2024-05-25 08:32:23] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 08:32:23] [INFO ] Invariant cache hit.
[2024-05-25 08:32:24] [INFO ] Dead Transitions using invariants and state equation in 765 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2906 ms. Remains : 133/133 places, 2347/2347 transitions.
Built C files in :
/tmp/ltsmin18066726453097667154
[2024-05-25 08:32:24] [INFO ] Too many transitions (2347) to apply POR reductions. Disabling POR matrices.
[2024-05-25 08:32:24] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18066726453097667154
Running compilation step : cd /tmp/ltsmin18066726453097667154;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18066726453097667154;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18066726453097667154;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 08:32:27] [INFO ] Flatten gal took : 239 ms
[2024-05-25 08:32:28] [INFO ] Flatten gal took : 156 ms
[2024-05-25 08:32:28] [INFO ] Time to serialize gal into /tmp/LTL11973326272535918837.gal : 37 ms
[2024-05-25 08:32:28] [INFO ] Time to serialize properties into /tmp/LTL1252566222729174668.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11973326272535918837.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14887943302355754888.hoa' '-atoms' '/tmp/LTL1252566222729174668.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL1252566222729174668.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14887943302355754888.hoa
Detected timeout of ITS tools.
[2024-05-25 08:32:43] [INFO ] Flatten gal took : 62 ms
[2024-05-25 08:32:43] [INFO ] Flatten gal took : 62 ms
[2024-05-25 08:32:43] [INFO ] Time to serialize gal into /tmp/LTL3067795703118004721.gal : 18 ms
[2024-05-25 08:32:43] [INFO ] Time to serialize properties into /tmp/LTL16578680833737568790.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3067795703118004721.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16578680833737568790.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G("(CAPACITE_0>=3)"))))
Formula 0 simplified : XF!"(CAPACITE_0>=3)"
Detected timeout of ITS tools.
[2024-05-25 08:32:58] [INFO ] Flatten gal took : 125 ms
[2024-05-25 08:32:58] [INFO ] Applying decomposition
[2024-05-25 08:32:58] [INFO ] Flatten gal took : 101 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2699507402228037227.txt' '-o' '/tmp/graph2699507402228037227.bin' '-w' '/tmp/graph2699507402228037227.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2699507402228037227.bin' '-l' '-1' '-v' '-w' '/tmp/graph2699507402228037227.weights' '-q' '0' '-e' '0.001'
[2024-05-25 08:32:59] [INFO ] Decomposing Gal with order
[2024-05-25 08:32:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 08:32:59] [INFO ] Removed a total of 4373 redundant transitions.
[2024-05-25 08:32:59] [INFO ] Flatten gal took : 534 ms
[2024-05-25 08:32:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 327 labels/synchronizations in 54 ms.
[2024-05-25 08:32:59] [INFO ] Time to serialize gal into /tmp/LTL12277976983087487059.gal : 10 ms
[2024-05-25 08:32:59] [INFO ] Time to serialize properties into /tmp/LTL3535929752877841047.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12277976983087487059.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3535929752877841047.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(G("(u0.CAPACITE_0>=3)"))))
Formula 0 simplified : XF!"(u0.CAPACITE_0>=3)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8354275535617504046
[2024-05-25 08:33:14] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8354275535617504046
Running compilation step : cd /tmp/ltsmin8354275535617504046;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8354275535617504046;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8354275535617504046;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLCardinality-06 finished in 90078 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Graph (complete) has 3850 edges and 138 vertex of which 137 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 301 ms. Remains 137 /138 variables (removed 1) and now considering 2348/2348 (removed 0) transitions.
[2024-05-25 08:33:18] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 137 cols
[2024-05-25 08:33:18] [INFO ] Computed 6 invariants in 2 ms
[2024-05-25 08:33:19] [INFO ] Dead Transitions using invariants and state equation in 766 ms found 0 transitions.
[2024-05-25 08:33:19] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 08:33:19] [INFO ] Invariant cache hit.
[2024-05-25 08:33:19] [INFO ] Implicit Places using invariants in 273 ms returned []
[2024-05-25 08:33:19] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 08:33:19] [INFO ] Invariant cache hit.
[2024-05-25 08:33:19] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 08:33:20] [INFO ] Implicit Places using invariants and state equation in 933 ms returned [54, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1245 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 135/138 places, 2348/2348 transitions.
Applied a total of 0 rules in 214 ms. Remains 135 /135 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2538 ms. Remains : 135/138 places, 2348/2348 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s52 s106)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 241 reset in 708 ms.
Product exploration explored 100000 steps with 241 reset in 678 ms.
Computed a total of 108 stabilizing places and 204 stable transitions
Graph (complete) has 3641 edges and 135 vertex of which 134 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Computed a total of 108 stabilizing places and 204 stable transitions
Detected a total of 108/135 stabilizing places and 204/2348 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 107 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=13 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 106 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
[2024-05-25 08:33:22] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 135 cols
[2024-05-25 08:33:22] [INFO ] Computed 5 invariants in 1 ms
[2024-05-25 08:33:22] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 08:33:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:33:23] [INFO ] [Real]Absence check using state equation in 206 ms returned sat
[2024-05-25 08:33:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 08:33:23] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 08:33:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 08:33:23] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2024-05-25 08:33:23] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 08:33:24] [INFO ] [Nat]Added 42 Read/Feed constraints in 358 ms returned sat
[2024-05-25 08:33:24] [INFO ] Deduced a trap composed of 5 places in 393 ms of which 1 ms to minimize.
[2024-05-25 08:33:27] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 3406 ms
Could not prove EG (NOT p0)
Support contains 2 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 2348/2348 transitions.
Applied a total of 0 rules in 245 ms. Remains 135 /135 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2024-05-25 08:33:27] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 08:33:27] [INFO ] Invariant cache hit.
[2024-05-25 08:33:28] [INFO ] Dead Transitions using invariants and state equation in 776 ms found 0 transitions.
[2024-05-25 08:33:28] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 08:33:28] [INFO ] Invariant cache hit.
[2024-05-25 08:33:29] [INFO ] Implicit Places using invariants in 275 ms returned []
[2024-05-25 08:33:29] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 08:33:29] [INFO ] Invariant cache hit.
[2024-05-25 08:33:29] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 08:33:30] [INFO ] Implicit Places using invariants and state equation in 1292 ms returned []
Implicit Place search using SMT with State Equation took 1591 ms to find 0 implicit places.
[2024-05-25 08:33:30] [INFO ] Redundant transitions in 61 ms returned []
[2024-05-25 08:33:30] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 08:33:30] [INFO ] Invariant cache hit.
[2024-05-25 08:33:31] [INFO ] Dead Transitions using invariants and state equation in 736 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3429 ms. Remains : 135/135 places, 2348/2348 transitions.
Computed a total of 108 stabilizing places and 204 stable transitions
Graph (complete) has 3641 edges and 135 vertex of which 134 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Computed a total of 108 stabilizing places and 204 stable transitions
Detected a total of 108/135 stabilizing places and 204/2348 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 157 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Finished random walk after 15 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=15 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 106 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
[2024-05-25 08:33:31] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 08:33:31] [INFO ] Invariant cache hit.
[2024-05-25 08:33:32] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 08:33:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:33:32] [INFO ] [Real]Absence check using state equation in 210 ms returned sat
[2024-05-25 08:33:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 08:33:32] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 08:33:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 08:33:33] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2024-05-25 08:33:33] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 08:33:33] [INFO ] [Nat]Added 42 Read/Feed constraints in 703 ms returned sat
[2024-05-25 08:33:34] [INFO ] Deduced a trap composed of 5 places in 305 ms of which 0 ms to minimize.
[2024-05-25 08:33:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 642 ms
[2024-05-25 08:33:34] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 184 ms.
[2024-05-25 08:33:35] [INFO ] Added : 60 causal constraints over 16 iterations in 678 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Product exploration explored 100000 steps with 241 reset in 808 ms.
Product exploration explored 100000 steps with 241 reset in 684 ms.
Built C files in :
/tmp/ltsmin10577290415684340762
[2024-05-25 08:33:36] [INFO ] Too many transitions (2348) to apply POR reductions. Disabling POR matrices.
[2024-05-25 08:33:36] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10577290415684340762
Running compilation step : cd /tmp/ltsmin10577290415684340762;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10577290415684340762;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10577290415684340762;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 2348/2348 transitions.
Applied a total of 0 rules in 261 ms. Remains 135 /135 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2024-05-25 08:33:40] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 08:33:40] [INFO ] Invariant cache hit.
[2024-05-25 08:33:40] [INFO ] Dead Transitions using invariants and state equation in 768 ms found 0 transitions.
[2024-05-25 08:33:40] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 08:33:40] [INFO ] Invariant cache hit.
[2024-05-25 08:33:41] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-05-25 08:33:41] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 08:33:41] [INFO ] Invariant cache hit.
[2024-05-25 08:33:41] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 08:33:42] [INFO ] Implicit Places using invariants and state equation in 1513 ms returned []
Implicit Place search using SMT with State Equation took 1827 ms to find 0 implicit places.
[2024-05-25 08:33:42] [INFO ] Redundant transitions in 46 ms returned []
[2024-05-25 08:33:42] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 08:33:42] [INFO ] Invariant cache hit.
[2024-05-25 08:33:43] [INFO ] Dead Transitions using invariants and state equation in 757 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3688 ms. Remains : 135/135 places, 2348/2348 transitions.
Built C files in :
/tmp/ltsmin4367090071535716262
[2024-05-25 08:33:43] [INFO ] Too many transitions (2348) to apply POR reductions. Disabling POR matrices.
[2024-05-25 08:33:43] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4367090071535716262
Running compilation step : cd /tmp/ltsmin4367090071535716262;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4367090071535716262;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4367090071535716262;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 08:33:46] [INFO ] Flatten gal took : 91 ms
[2024-05-25 08:33:46] [INFO ] Flatten gal took : 78 ms
[2024-05-25 08:33:46] [INFO ] Time to serialize gal into /tmp/LTL14894531515532347767.gal : 29 ms
[2024-05-25 08:33:46] [INFO ] Time to serialize properties into /tmp/LTL8945190691247321280.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14894531515532347767.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9724511765878463045.hoa' '-atoms' '/tmp/LTL8945190691247321280.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL8945190691247321280.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9724511765878463045.hoa
Detected timeout of ITS tools.
[2024-05-25 08:34:02] [INFO ] Flatten gal took : 78 ms
[2024-05-25 08:34:02] [INFO ] Flatten gal took : 120 ms
[2024-05-25 08:34:02] [INFO ] Time to serialize gal into /tmp/LTL2407156511754230840.gal : 31 ms
[2024-05-25 08:34:02] [INFO ] Time to serialize properties into /tmp/LTL1074460999009037974.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2407156511754230840.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1074460999009037974.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G("(SORTI_A_0>SUR_PONT_B_0)"))))
Formula 0 simplified : GF!"(SORTI_A_0>SUR_PONT_B_0)"
Detected timeout of ITS tools.
[2024-05-25 08:34:17] [INFO ] Flatten gal took : 58 ms
[2024-05-25 08:34:17] [INFO ] Applying decomposition
[2024-05-25 08:34:17] [INFO ] Flatten gal took : 73 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph13672548845832625684.txt' '-o' '/tmp/graph13672548845832625684.bin' '-w' '/tmp/graph13672548845832625684.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13672548845832625684.bin' '-l' '-1' '-v' '-w' '/tmp/graph13672548845832625684.weights' '-q' '0' '-e' '0.001'
[2024-05-25 08:34:17] [INFO ] Decomposing Gal with order
[2024-05-25 08:34:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 08:34:17] [INFO ] Removed a total of 2214 redundant transitions.
[2024-05-25 08:34:18] [INFO ] Flatten gal took : 359 ms
[2024-05-25 08:34:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 258 labels/synchronizations in 29 ms.
[2024-05-25 08:34:18] [INFO ] Time to serialize gal into /tmp/LTL13920562428515479712.gal : 37 ms
[2024-05-25 08:34:18] [INFO ] Time to serialize properties into /tmp/LTL16741041309004637535.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13920562428515479712.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16741041309004637535.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G("(gu0.SORTI_A_0>gu0.SUR_PONT_B_0)"))))
Formula 0 simplified : GF!"(gu0.SORTI_A_0>gu0.SUR_PONT_B_0)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17747936401136565335
[2024-05-25 08:34:33] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17747936401136565335
Running compilation step : cd /tmp/ltsmin17747936401136565335;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17747936401136565335;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17747936401136565335;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLCardinality-08 finished in 78572 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(p1))))'
Support contains 5 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 136 transition count 2348
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 135 transition count 2347
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 135 transition count 2347
Applied a total of 4 rules in 19 ms. Remains 135 /138 variables (removed 3) and now considering 2347/2348 (removed 1) transitions.
[2024-05-25 08:34:36] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2024-05-25 08:34:36] [INFO ] Computed 5 invariants in 5 ms
[2024-05-25 08:34:37] [INFO ] Dead Transitions using invariants and state equation in 777 ms found 0 transitions.
[2024-05-25 08:34:37] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 08:34:37] [INFO ] Invariant cache hit.
[2024-05-25 08:34:37] [INFO ] Implicit Places using invariants in 240 ms returned []
[2024-05-25 08:34:37] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 08:34:37] [INFO ] Invariant cache hit.
[2024-05-25 08:34:37] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 08:34:38] [INFO ] Implicit Places using invariants and state equation in 882 ms returned [53]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1158 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 134/138 places, 2347/2348 transitions.
Applied a total of 0 rules in 16 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1985 ms. Remains : 134/138 places, 2347/2348 transitions.
Stuttering acceptance computed with spot in 72 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 (ADD s107 s108)), p1:(GT s105 (ADD s109 s110))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 15079 reset in 752 ms.
Product exploration explored 100000 steps with 15011 reset in 753 ms.
Computed a total of 107 stabilizing places and 203 stable transitions
Computed a total of 107 stabilizing places and 203 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 1 factoid took 457 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 400 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=80 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F p0), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 379 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 70 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 71 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
[2024-05-25 08:34:41] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 134 cols
[2024-05-25 08:34:41] [INFO ] Computed 5 invariants in 2 ms
[2024-05-25 08:34:41] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 08:34:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:34:41] [INFO ] [Real]Absence check using state equation in 240 ms returned sat
[2024-05-25 08:34:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 08:34:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 08:34:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 08:34:42] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2024-05-25 08:34:42] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 08:34:42] [INFO ] [Nat]Added 42 Read/Feed constraints in 182 ms returned sat
[2024-05-25 08:34:42] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 134 ms.
[2024-05-25 08:34:42] [INFO ] Added : 21 causal constraints over 6 iterations in 413 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-25 08:34:42] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 08:34:42] [INFO ] Invariant cache hit.
[2024-05-25 08:34:43] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-25 08:34:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:34:43] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2024-05-25 08:34:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 08:34:44] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 08:34:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 08:34:44] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2024-05-25 08:34:44] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 08:34:44] [INFO ] [Nat]Added 42 Read/Feed constraints in 259 ms returned sat
[2024-05-25 08:34:44] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 83 ms.
[2024-05-25 08:34:44] [INFO ] Added : 21 causal constraints over 5 iterations in 264 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 5 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 2347/2347 transitions.
Applied a total of 0 rules in 10 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2024-05-25 08:34:44] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 08:34:44] [INFO ] Invariant cache hit.
[2024-05-25 08:34:45] [INFO ] Dead Transitions using invariants and state equation in 724 ms found 0 transitions.
[2024-05-25 08:34:45] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 08:34:45] [INFO ] Invariant cache hit.
[2024-05-25 08:34:45] [INFO ] Implicit Places using invariants in 259 ms returned []
[2024-05-25 08:34:45] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 08:34:45] [INFO ] Invariant cache hit.
[2024-05-25 08:34:46] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 08:34:46] [INFO ] Implicit Places using invariants and state equation in 856 ms returned []
Implicit Place search using SMT with State Equation took 1118 ms to find 0 implicit places.
[2024-05-25 08:34:46] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 08:34:46] [INFO ] Invariant cache hit.
[2024-05-25 08:34:47] [INFO ] Dead Transitions using invariants and state equation in 703 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2570 ms. Remains : 134/134 places, 2347/2347 transitions.
Computed a total of 107 stabilizing places and 203 stable transitions
Computed a total of 107 stabilizing places and 203 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 1 factoid took 313 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 71 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F p0), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 378 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 72 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
[2024-05-25 08:34:48] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 08:34:48] [INFO ] Invariant cache hit.
[2024-05-25 08:34:48] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-25 08:34:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:34:48] [INFO ] [Real]Absence check using state equation in 272 ms returned sat
[2024-05-25 08:34:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 08:34:49] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 08:34:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 08:34:49] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2024-05-25 08:34:49] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 08:34:49] [INFO ] [Nat]Added 42 Read/Feed constraints in 164 ms returned sat
[2024-05-25 08:34:49] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 73 ms.
[2024-05-25 08:34:49] [INFO ] Added : 21 causal constraints over 6 iterations in 334 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-25 08:34:49] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 08:34:49] [INFO ] Invariant cache hit.
[2024-05-25 08:34:50] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-25 08:34:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:34:50] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2024-05-25 08:34:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 08:34:51] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 08:34:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 08:34:51] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2024-05-25 08:34:51] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 08:34:51] [INFO ] [Nat]Added 42 Read/Feed constraints in 200 ms returned sat
[2024-05-25 08:34:51] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 96 ms.
[2024-05-25 08:34:51] [INFO ] Added : 21 causal constraints over 5 iterations in 307 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 15021 reset in 727 ms.
Product exploration explored 100000 steps with 14997 reset in 755 ms.
Built C files in :
/tmp/ltsmin7078752255951861147
[2024-05-25 08:34:53] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7078752255951861147
Running compilation step : cd /tmp/ltsmin7078752255951861147;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7078752255951861147;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7078752255951861147;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 5 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 2347/2347 transitions.
Applied a total of 0 rules in 17 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2024-05-25 08:34:56] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 08:34:56] [INFO ] Invariant cache hit.
[2024-05-25 08:34:57] [INFO ] Dead Transitions using invariants and state equation in 807 ms found 0 transitions.
[2024-05-25 08:34:57] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 08:34:57] [INFO ] Invariant cache hit.
[2024-05-25 08:34:57] [INFO ] Implicit Places using invariants in 238 ms returned []
[2024-05-25 08:34:57] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 08:34:57] [INFO ] Invariant cache hit.
[2024-05-25 08:34:57] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 08:34:58] [INFO ] Implicit Places using invariants and state equation in 940 ms returned []
Implicit Place search using SMT with State Equation took 1190 ms to find 0 implicit places.
[2024-05-25 08:34:58] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 08:34:58] [INFO ] Invariant cache hit.
[2024-05-25 08:34:59] [INFO ] Dead Transitions using invariants and state equation in 776 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2814 ms. Remains : 134/134 places, 2347/2347 transitions.
Built C files in :
/tmp/ltsmin3651620998625032746
[2024-05-25 08:34:59] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3651620998625032746
Running compilation step : cd /tmp/ltsmin3651620998625032746;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3651620998625032746;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3651620998625032746;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 08:35:02] [INFO ] Flatten gal took : 54 ms
[2024-05-25 08:35:02] [INFO ] Flatten gal took : 59 ms
[2024-05-25 08:35:02] [INFO ] Time to serialize gal into /tmp/LTL3285954847523900184.gal : 12 ms
[2024-05-25 08:35:02] [INFO ] Time to serialize properties into /tmp/LTL8220679823244203430.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3285954847523900184.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9524851809538241761.hoa' '-atoms' '/tmp/LTL8220679823244203430.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL8220679823244203430.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9524851809538241761.hoa
Detected timeout of ITS tools.
[2024-05-25 08:35:18] [INFO ] Flatten gal took : 132 ms
[2024-05-25 08:35:18] [INFO ] Flatten gal took : 80 ms
[2024-05-25 08:35:18] [INFO ] Time to serialize gal into /tmp/LTL3005180275899506727.gal : 32 ms
[2024-05-25 08:35:18] [INFO ] Time to serialize properties into /tmp/LTL11326897611094530038.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3005180275899506727.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11326897611094530038.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(("((CONTROLEUR_0+CONTROLEUR_1)>=1)")&&(X("(ATTENTE_B_0>(CHOIX_0+CHOIX_1))")))))
Formula 0 simplified : G(!"((CONTROLEUR_0+CONTROLEUR_1)>=1)" | X!"(ATTENTE_B_0>(CHOIX_0+CHOIX_1))")
Detected timeout of ITS tools.
[2024-05-25 08:35:33] [INFO ] Flatten gal took : 97 ms
[2024-05-25 08:35:33] [INFO ] Applying decomposition
[2024-05-25 08:35:33] [INFO ] Flatten gal took : 78 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15960091831840179459.txt' '-o' '/tmp/graph15960091831840179459.bin' '-w' '/tmp/graph15960091831840179459.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15960091831840179459.bin' '-l' '-1' '-v' '-w' '/tmp/graph15960091831840179459.weights' '-q' '0' '-e' '0.001'
[2024-05-25 08:35:33] [INFO ] Decomposing Gal with order
[2024-05-25 08:35:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 08:35:34] [INFO ] Removed a total of 4577 redundant transitions.
[2024-05-25 08:35:34] [INFO ] Flatten gal took : 1093 ms
[2024-05-25 08:35:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 2574 labels/synchronizations in 159 ms.
[2024-05-25 08:35:35] [INFO ] Time to serialize gal into /tmp/LTL12872746591115370087.gal : 6 ms
[2024-05-25 08:35:35] [INFO ] Time to serialize properties into /tmp/LTL12547928708807528434.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12872746591115370087.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12547928708807528434.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(("((gu2.CONTROLEUR_0+gu2.CONTROLEUR_1)>=1)")&&(X("(gu3.ATTENTE_B_0>(gu3.CHOIX_0+gu3.CHOIX_1))")))))
Formula 0 simplified : G(!"((gu2.CONTROLEUR_0+gu2.CONTROLEUR_1)>=1)" | X!"(gu3.ATTENTE_B_0>(gu3.CHOIX_0+gu3.CHOIX_1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5333172466506115475
[2024-05-25 08:35:50] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5333172466506115475
Running compilation step : cd /tmp/ltsmin5333172466506115475;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5333172466506115475;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5333172466506115475;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLCardinality-11 finished in 76923 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||G(p1)))'
Support contains 3 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Graph (complete) has 3850 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 135 transition count 2347
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 135 transition count 2347
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 133 transition count 2346
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 131 transition count 2344
Applied a total of 10 rules in 244 ms. Remains 131 /138 variables (removed 7) and now considering 2344/2348 (removed 4) transitions.
[2024-05-25 08:35:53] [INFO ] Flow matrix only has 286 transitions (discarded 2058 similar events)
// Phase 1: matrix 286 rows 131 cols
[2024-05-25 08:35:53] [INFO ] Computed 4 invariants in 1 ms
[2024-05-25 08:35:53] [INFO ] Implicit Places using invariants in 318 ms returned []
[2024-05-25 08:35:53] [INFO ] Flow matrix only has 286 transitions (discarded 2058 similar events)
[2024-05-25 08:35:54] [INFO ] Invariant cache hit.
[2024-05-25 08:35:54] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 08:35:55] [INFO ] Implicit Places using invariants and state equation in 1024 ms returned []
Implicit Place search using SMT with State Equation took 1357 ms to find 0 implicit places.
[2024-05-25 08:35:55] [INFO ] Redundant transitions in 84 ms returned []
[2024-05-25 08:35:55] [INFO ] Flow matrix only has 286 transitions (discarded 2058 similar events)
[2024-05-25 08:35:55] [INFO ] Invariant cache hit.
[2024-05-25 08:35:56] [INFO ] Dead Transitions using invariants and state equation in 901 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 131/138 places, 2344/2348 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2611 ms. Remains : 131/138 places, 2344/2348 transitions.
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 3 s104), p0:(GT s51 s52)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 307 steps with 0 reset in 2 ms.
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLCardinality-12 finished in 2691 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(p0)&&G(p1)))))'
Support contains 3 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 137 transition count 2348
Applied a total of 1 rules in 11 ms. Remains 137 /138 variables (removed 1) and now considering 2348/2348 (removed 0) transitions.
[2024-05-25 08:35:56] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 137 cols
[2024-05-25 08:35:56] [INFO ] Computed 6 invariants in 1 ms
[2024-05-25 08:35:56] [INFO ] Dead Transitions using invariants and state equation in 662 ms found 0 transitions.
[2024-05-25 08:35:56] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 08:35:56] [INFO ] Invariant cache hit.
[2024-05-25 08:35:57] [INFO ] Implicit Places using invariants in 290 ms returned []
[2024-05-25 08:35:57] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 08:35:57] [INFO ] Invariant cache hit.
[2024-05-25 08:35:57] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 08:35:57] [INFO ] Implicit Places using invariants and state equation in 882 ms returned [54, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1198 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 135/138 places, 2348/2348 transitions.
Applied a total of 0 rules in 10 ms. Remains 135 /135 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1890 ms. Remains : 135/138 places, 2348/2348 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GT 2 s52), p0:(GT s106 s54)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 427 steps with 1 reset in 3 ms.
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLCardinality-14 finished in 2035 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p0)||X(X(F((!p0&&X(p1))))))))))'
Found a Shortening insensitive property : BridgeAndVehicles-COL-V50P50N20-LTLCardinality-00
Stuttering acceptance computed with spot in 279 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Graph (complete) has 3850 edges and 138 vertex of which 137 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 35 ms. Remains 137 /138 variables (removed 1) and now considering 2348/2348 (removed 0) transitions.
[2024-05-25 08:35:58] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 08:35:58] [INFO ] Invariant cache hit.
[2024-05-25 08:35:59] [INFO ] Dead Transitions using invariants and state equation in 611 ms found 0 transitions.
[2024-05-25 08:35:59] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 08:35:59] [INFO ] Invariant cache hit.
[2024-05-25 08:35:59] [INFO ] Implicit Places using invariants in 266 ms returned []
[2024-05-25 08:35:59] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 08:35:59] [INFO ] Invariant cache hit.
[2024-05-25 08:35:59] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 08:36:00] [INFO ] Implicit Places using invariants and state equation in 803 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1097 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 136/138 places, 2348/2348 transitions.
Applied a total of 0 rules in 24 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1776 ms. Remains : 136/138 places, 2348/2348 transitions.
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(LEQ s106 s107), p1:(LEQ s52 s54)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 256 reset in 805 ms.
Product exploration explored 100000 steps with 247 reset in 723 ms.
Computed a total of 109 stabilizing places and 204 stable transitions
Graph (complete) has 3745 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 109 stabilizing places and 204 stable transitions
Detected a total of 109/136 stabilizing places and 204/2348 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 168 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 428 steps, including 0 resets, run visited all 3 properties in 11 ms. (steps per millisecond=38 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 4 factoid took 169 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 9 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2024-05-25 08:36:02] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2024-05-25 08:36:02] [INFO ] Computed 5 invariants in 1 ms
[2024-05-25 08:36:03] [INFO ] Dead Transitions using invariants and state equation in 718 ms found 0 transitions.
[2024-05-25 08:36:03] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 08:36:03] [INFO ] Invariant cache hit.
[2024-05-25 08:36:03] [INFO ] Implicit Places using invariants in 273 ms returned []
[2024-05-25 08:36:03] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 08:36:03] [INFO ] Invariant cache hit.
[2024-05-25 08:36:03] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 08:36:05] [INFO ] Implicit Places using invariants and state equation in 1401 ms returned []
Implicit Place search using SMT with State Equation took 1684 ms to find 0 implicit places.
[2024-05-25 08:36:05] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 08:36:05] [INFO ] Invariant cache hit.
[2024-05-25 08:36:05] [INFO ] Dead Transitions using invariants and state equation in 697 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3130 ms. Remains : 136/136 places, 2348/2348 transitions.
Computed a total of 109 stabilizing places and 204 stable transitions
Graph (complete) has 3745 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 109 stabilizing places and 204 stable transitions
Detected a total of 109/136 stabilizing places and 204/2348 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 110 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 430 steps, including 0 resets, run visited all 3 properties in 7 ms. (steps per millisecond=61 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 4 factoid took 157 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 247 reset in 716 ms.
Product exploration explored 100000 steps with 252 reset in 716 ms.
Built C files in :
/tmp/ltsmin15318456856087687922
[2024-05-25 08:36:08] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15318456856087687922
Running compilation step : cd /tmp/ltsmin15318456856087687922;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15318456856087687922;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15318456856087687922;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 18 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2024-05-25 08:36:11] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 08:36:11] [INFO ] Invariant cache hit.
[2024-05-25 08:36:12] [INFO ] Dead Transitions using invariants and state equation in 707 ms found 0 transitions.
[2024-05-25 08:36:12] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 08:36:12] [INFO ] Invariant cache hit.
[2024-05-25 08:36:12] [INFO ] Implicit Places using invariants in 273 ms returned []
[2024-05-25 08:36:12] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 08:36:12] [INFO ] Invariant cache hit.
[2024-05-25 08:36:12] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 08:36:13] [INFO ] Implicit Places using invariants and state equation in 986 ms returned []
Implicit Place search using SMT with State Equation took 1295 ms to find 0 implicit places.
[2024-05-25 08:36:13] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 08:36:13] [INFO ] Invariant cache hit.
[2024-05-25 08:36:14] [INFO ] Dead Transitions using invariants and state equation in 748 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2782 ms. Remains : 136/136 places, 2348/2348 transitions.
Built C files in :
/tmp/ltsmin17738892272930500238
[2024-05-25 08:36:14] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17738892272930500238
Running compilation step : cd /tmp/ltsmin17738892272930500238;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17738892272930500238;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17738892272930500238;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 08:36:17] [INFO ] Flatten gal took : 84 ms
[2024-05-25 08:36:17] [INFO ] Flatten gal took : 88 ms
[2024-05-25 08:36:17] [INFO ] Time to serialize gal into /tmp/LTL18068139678121973773.gal : 24 ms
[2024-05-25 08:36:17] [INFO ] Time to serialize properties into /tmp/LTL18130970420099639584.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18068139678121973773.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4150617210713178822.hoa' '-atoms' '/tmp/LTL18130970420099639584.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL18130970420099639584.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4150617210713178822.hoa
Detected timeout of ITS tools.
[2024-05-25 08:36:32] [INFO ] Flatten gal took : 57 ms
[2024-05-25 08:36:32] [INFO ] Flatten gal took : 59 ms
[2024-05-25 08:36:33] [INFO ] Time to serialize gal into /tmp/LTL14864358892760768086.gal : 12 ms
[2024-05-25 08:36:33] [INFO ] Time to serialize properties into /tmp/LTL12566273364805152745.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14864358892760768086.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12566273364805152745.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(F((G("(SUR_PONT_B_0<=ATTENTE_B_0)"))||(X(X(F(("(SUR_PONT_B_0>ATTENTE_B_0)")&&(X("(SORTI_A_0<=SUR_PONT_A_0)")))))))))))
Formula 0 simplified : XXG(F!"(SUR_PONT_B_0<=ATTENTE_B_0)" & XXG(!"(SUR_PONT_B_0>ATTENTE_B_0)" | X!"(SORTI_A_0<=SUR_PONT_A_0)"))
Detected timeout of ITS tools.
[2024-05-25 08:36:48] [INFO ] Flatten gal took : 59 ms
[2024-05-25 08:36:48] [INFO ] Applying decomposition
[2024-05-25 08:36:48] [INFO ] Flatten gal took : 62 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph8933187903631616518.txt' '-o' '/tmp/graph8933187903631616518.bin' '-w' '/tmp/graph8933187903631616518.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8933187903631616518.bin' '-l' '-1' '-v' '-w' '/tmp/graph8933187903631616518.weights' '-q' '0' '-e' '0.001'
[2024-05-25 08:36:48] [INFO ] Decomposing Gal with order
[2024-05-25 08:36:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 08:36:48] [INFO ] Removed a total of 2294 redundant transitions.
[2024-05-25 08:36:48] [INFO ] Flatten gal took : 269 ms
[2024-05-25 08:36:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 384 labels/synchronizations in 15 ms.
[2024-05-25 08:36:48] [INFO ] Time to serialize gal into /tmp/LTL75057985365542856.gal : 7 ms
[2024-05-25 08:36:48] [INFO ] Time to serialize properties into /tmp/LTL10913537674086328558.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL75057985365542856.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10913537674086328558.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((X(X(F((G("(gu2.SUR_PONT_B_0<=gu2.ATTENTE_B_0)"))||(X(X(F(("(gu2.SUR_PONT_B_0>gu2.ATTENTE_B_0)")&&(X("(gu1.SORTI_A_0<=gu1.SUR_PONT_A...170
Formula 0 simplified : XXG(F!"(gu2.SUR_PONT_B_0<=gu2.ATTENTE_B_0)" & XXG(!"(gu2.SUR_PONT_B_0>gu2.ATTENTE_B_0)" | X!"(gu1.SORTI_A_0<=gu1.SUR_PONT_A_0)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17983608292707095156
[2024-05-25 08:37:03] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17983608292707095156
Running compilation step : cd /tmp/ltsmin17983608292707095156;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17983608292707095156;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17983608292707095156;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLCardinality-00 finished in 68824 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Found a Lengthening insensitive property : BridgeAndVehicles-COL-V50P50N20-LTLCardinality-06
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Graph (complete) has 3850 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 135 transition count 2347
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 135 transition count 2347
Applied a total of 3 rules in 41 ms. Remains 135 /138 variables (removed 3) and now considering 2347/2348 (removed 1) transitions.
[2024-05-25 08:37:07] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2024-05-25 08:37:07] [INFO ] Computed 5 invariants in 2 ms
[2024-05-25 08:37:07] [INFO ] Dead Transitions using invariants and state equation in 748 ms found 0 transitions.
[2024-05-25 08:37:07] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 08:37:07] [INFO ] Invariant cache hit.
[2024-05-25 08:37:08] [INFO ] Implicit Places using invariants in 264 ms returned []
[2024-05-25 08:37:08] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 08:37:08] [INFO ] Invariant cache hit.
[2024-05-25 08:37:08] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 08:37:09] [INFO ] Implicit Places using invariants and state equation in 897 ms returned [53, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1164 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 133/138 places, 2347/2348 transitions.
Applied a total of 0 rules in 18 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1998 ms. Remains : 133/138 places, 2347/2348 transitions.
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 3 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 241 reset in 657 ms.
Product exploration explored 100000 steps with 241 reset in 673 ms.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Detected a total of 106/133 stabilizing places and 203/2347 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 116 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 23 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 299842 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :{}
Probabilistic random walk after 299842 steps, saw 80109 distinct states, run finished after 3001 ms. (steps per millisecond=99 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 08:37:13] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2024-05-25 08:37:13] [INFO ] Computed 5 invariants in 1 ms
[2024-05-25 08:37:13] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 08:37:13] [INFO ] After 181ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 08:37:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 08:37:14] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 08:37:14] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 08:37:14] [INFO ] After 87ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 08:37:14] [INFO ] After 140ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2024-05-25 08:37:14] [INFO ] After 311ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 226 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2024-05-25 08:37:14] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 08:37:14] [INFO ] Invariant cache hit.
[2024-05-25 08:37:15] [INFO ] Dead Transitions using invariants and state equation in 727 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 965 ms. Remains : 133/133 places, 2347/2347 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 294072 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :{}
Probabilistic random walk after 294072 steps, saw 78602 distinct states, run finished after 3001 ms. (steps per millisecond=97 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 08:37:18] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 08:37:18] [INFO ] Invariant cache hit.
[2024-05-25 08:37:18] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 08:37:18] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 08:37:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 08:37:18] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 08:37:18] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 08:37:18] [INFO ] After 85ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 08:37:18] [INFO ] After 163ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2024-05-25 08:37:18] [INFO ] After 324ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 212 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 212 ms. Remains : 133/133 places, 2347/2347 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 162 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2024-05-25 08:37:19] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 08:37:19] [INFO ] Invariant cache hit.
[2024-05-25 08:37:19] [INFO ] Implicit Places using invariants in 293 ms returned []
[2024-05-25 08:37:19] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 08:37:19] [INFO ] Invariant cache hit.
[2024-05-25 08:37:19] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 08:37:20] [INFO ] Implicit Places using invariants and state equation in 885 ms returned []
Implicit Place search using SMT with State Equation took 1206 ms to find 0 implicit places.
[2024-05-25 08:37:20] [INFO ] Redundant transitions in 71 ms returned []
[2024-05-25 08:37:20] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 08:37:20] [INFO ] Invariant cache hit.
[2024-05-25 08:37:21] [INFO ] Dead Transitions using invariants and state equation in 859 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2307 ms. Remains : 133/133 places, 2347/2347 transitions.
Ensure Unique test removed 2058 transitions
Reduce isomorphic transitions removed 2058 transitions.
Iterating post reduction 0 with 2058 rules applied. Total rules applied 2058 place count 133 transition count 289
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 2062 place count 131 transition count 287
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 2064 place count 131 transition count 285
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 2066 place count 129 transition count 285
Applied a total of 2066 rules in 11 ms. Remains 129 /133 variables (removed 4) and now considering 285/2347 (removed 2062) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 285 rows 129 cols
[2024-05-25 08:37:21] [INFO ] Computed 5 invariants in 1 ms
[2024-05-25 08:37:21] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 08:37:21] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 08:37:21] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 08:37:21] [INFO ] After 65ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 08:37:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-25 08:37:21] [INFO ] After 15ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 08:37:21] [INFO ] After 59ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2024-05-25 08:37:21] [INFO ] After 194ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[true, (NOT p0)]
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 170 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2024-05-25 08:37:21] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2024-05-25 08:37:21] [INFO ] Computed 5 invariants in 3 ms
[2024-05-25 08:37:22] [INFO ] Dead Transitions using invariants and state equation in 771 ms found 0 transitions.
[2024-05-25 08:37:22] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 08:37:22] [INFO ] Invariant cache hit.
[2024-05-25 08:37:23] [INFO ] Implicit Places using invariants in 268 ms returned []
[2024-05-25 08:37:23] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 08:37:23] [INFO ] Invariant cache hit.
[2024-05-25 08:37:23] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 08:37:23] [INFO ] Implicit Places using invariants and state equation in 653 ms returned []
Implicit Place search using SMT with State Equation took 933 ms to find 0 implicit places.
[2024-05-25 08:37:23] [INFO ] Redundant transitions in 66 ms returned []
[2024-05-25 08:37:23] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 08:37:23] [INFO ] Invariant cache hit.
[2024-05-25 08:37:24] [INFO ] Dead Transitions using invariants and state equation in 727 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2692 ms. Remains : 133/133 places, 2347/2347 transitions.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Detected a total of 106/133 stabilizing places and 203/2347 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 23 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 318419 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :{}
Probabilistic random walk after 318419 steps, saw 84883 distinct states, run finished after 3001 ms. (steps per millisecond=106 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 08:37:27] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 08:37:27] [INFO ] Invariant cache hit.
[2024-05-25 08:37:27] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-25 08:37:27] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 08:37:27] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 08:37:28] [INFO ] After 79ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 08:37:28] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 08:37:28] [INFO ] After 112ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 08:37:28] [INFO ] After 191ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2024-05-25 08:37:28] [INFO ] After 367ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 190 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2024-05-25 08:37:28] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 08:37:28] [INFO ] Invariant cache hit.
[2024-05-25 08:37:29] [INFO ] Dead Transitions using invariants and state equation in 680 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 875 ms. Remains : 133/133 places, 2347/2347 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 291904 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :{}
Probabilistic random walk after 291904 steps, saw 78034 distinct states, run finished after 3001 ms. (steps per millisecond=97 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 08:37:32] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 08:37:32] [INFO ] Invariant cache hit.
[2024-05-25 08:37:32] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 08:37:32] [INFO ] After 148ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 08:37:32] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 08:37:32] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 08:37:32] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 08:37:32] [INFO ] After 145ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 08:37:32] [INFO ] After 253ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2024-05-25 08:37:32] [INFO ] After 448ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 203 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 203 ms. Remains : 133/133 places, 2347/2347 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 199 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2024-05-25 08:37:33] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 08:37:33] [INFO ] Invariant cache hit.
[2024-05-25 08:37:33] [INFO ] Implicit Places using invariants in 381 ms returned []
[2024-05-25 08:37:33] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 08:37:33] [INFO ] Invariant cache hit.
[2024-05-25 08:37:33] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 08:37:34] [INFO ] Implicit Places using invariants and state equation in 713 ms returned []
Implicit Place search using SMT with State Equation took 1120 ms to find 0 implicit places.
[2024-05-25 08:37:34] [INFO ] Redundant transitions in 60 ms returned []
[2024-05-25 08:37:34] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 08:37:34] [INFO ] Invariant cache hit.
[2024-05-25 08:37:35] [INFO ] Dead Transitions using invariants and state equation in 658 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2059 ms. Remains : 133/133 places, 2347/2347 transitions.
Ensure Unique test removed 2058 transitions
Reduce isomorphic transitions removed 2058 transitions.
Iterating post reduction 0 with 2058 rules applied. Total rules applied 2058 place count 133 transition count 289
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 2062 place count 131 transition count 287
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 2064 place count 131 transition count 285
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 2066 place count 129 transition count 285
Applied a total of 2066 rules in 10 ms. Remains 129 /133 variables (removed 4) and now considering 285/2347 (removed 2062) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 285 rows 129 cols
[2024-05-25 08:37:35] [INFO ] Computed 5 invariants in 1 ms
[2024-05-25 08:37:35] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 08:37:35] [INFO ] After 158ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 08:37:35] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 08:37:35] [INFO ] After 62ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 08:37:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-25 08:37:35] [INFO ] After 15ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 08:37:35] [INFO ] After 54ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2024-05-25 08:37:35] [INFO ] After 231ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 73 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 241 reset in 635 ms.
Product exploration explored 100000 steps with 241 reset in 819 ms.
Built C files in :
/tmp/ltsmin4852851121484084062
[2024-05-25 08:37:37] [INFO ] Too many transitions (2347) to apply POR reductions. Disabling POR matrices.
[2024-05-25 08:37:37] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4852851121484084062
Running compilation step : cd /tmp/ltsmin4852851121484084062;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4852851121484084062;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4852851121484084062;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 176 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2024-05-25 08:37:40] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2024-05-25 08:37:40] [INFO ] Computed 5 invariants in 3 ms
[2024-05-25 08:37:41] [INFO ] Dead Transitions using invariants and state equation in 778 ms found 0 transitions.
[2024-05-25 08:37:41] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 08:37:41] [INFO ] Invariant cache hit.
[2024-05-25 08:37:41] [INFO ] Implicit Places using invariants in 353 ms returned []
[2024-05-25 08:37:41] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 08:37:41] [INFO ] Invariant cache hit.
[2024-05-25 08:37:41] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 08:37:42] [INFO ] Implicit Places using invariants and state equation in 725 ms returned []
Implicit Place search using SMT with State Equation took 1112 ms to find 0 implicit places.
[2024-05-25 08:37:42] [INFO ] Redundant transitions in 46 ms returned []
[2024-05-25 08:37:42] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 08:37:42] [INFO ] Invariant cache hit.
[2024-05-25 08:37:43] [INFO ] Dead Transitions using invariants and state equation in 874 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3024 ms. Remains : 133/133 places, 2347/2347 transitions.
Built C files in :
/tmp/ltsmin13448910769924756946
[2024-05-25 08:37:43] [INFO ] Too many transitions (2347) to apply POR reductions. Disabling POR matrices.
[2024-05-25 08:37:43] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13448910769924756946
Running compilation step : cd /tmp/ltsmin13448910769924756946;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13448910769924756946;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13448910769924756946;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 08:37:46] [INFO ] Flatten gal took : 59 ms
[2024-05-25 08:37:46] [INFO ] Flatten gal took : 61 ms
[2024-05-25 08:37:46] [INFO ] Time to serialize gal into /tmp/LTL4621325291794399458.gal : 12 ms
[2024-05-25 08:37:46] [INFO ] Time to serialize properties into /tmp/LTL15122558492205513161.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4621325291794399458.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4318358318466141263.hoa' '-atoms' '/tmp/LTL15122558492205513161.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL15122558492205513161.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4318358318466141263.hoa
Detected timeout of ITS tools.
[2024-05-25 08:38:01] [INFO ] Flatten gal took : 58 ms
[2024-05-25 08:38:01] [INFO ] Flatten gal took : 59 ms
[2024-05-25 08:38:01] [INFO ] Time to serialize gal into /tmp/LTL16985979179177292703.gal : 12 ms
[2024-05-25 08:38:01] [INFO ] Time to serialize properties into /tmp/LTL16951397360683736997.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16985979179177292703.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16951397360683736997.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(G("(CAPACITE_0>=3)"))))
Formula 0 simplified : XF!"(CAPACITE_0>=3)"
Detected timeout of ITS tools.
[2024-05-25 08:38:16] [INFO ] Flatten gal took : 57 ms
[2024-05-25 08:38:16] [INFO ] Applying decomposition
[2024-05-25 08:38:16] [INFO ] Flatten gal took : 60 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph8558547633903404693.txt' '-o' '/tmp/graph8558547633903404693.bin' '-w' '/tmp/graph8558547633903404693.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8558547633903404693.bin' '-l' '-1' '-v' '-w' '/tmp/graph8558547633903404693.weights' '-q' '0' '-e' '0.001'
[2024-05-25 08:38:17] [INFO ] Decomposing Gal with order
[2024-05-25 08:38:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 08:38:17] [INFO ] Removed a total of 4373 redundant transitions.
[2024-05-25 08:38:17] [INFO ] Flatten gal took : 450 ms
[2024-05-25 08:38:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 327 labels/synchronizations in 13 ms.
[2024-05-25 08:38:17] [INFO ] Time to serialize gal into /tmp/LTL10208971152472289278.gal : 2 ms
[2024-05-25 08:38:17] [INFO ] Time to serialize properties into /tmp/LTL4025813142438654322.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10208971152472289278.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4025813142438654322.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(G("(u0.CAPACITE_0>=3)"))))
Formula 0 simplified : XF!"(u0.CAPACITE_0>=3)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin273089166481200998
[2024-05-25 08:38:32] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin273089166481200998
Running compilation step : cd /tmp/ltsmin273089166481200998;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin273089166481200998;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin273089166481200998;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLCardinality-06 finished in 88793 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(p1))))'
Found a Shortening insensitive property : BridgeAndVehicles-COL-V50P50N20-LTLCardinality-11
Stuttering acceptance computed with spot in 62 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 5 out of 138 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Graph (complete) has 3850 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 135 transition count 2347
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 135 transition count 2347
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 133 transition count 2346
Applied a total of 6 rules in 45 ms. Remains 133 /138 variables (removed 5) and now considering 2346/2348 (removed 2) transitions.
[2024-05-25 08:38:36] [INFO ] Flow matrix only has 288 transitions (discarded 2058 similar events)
// Phase 1: matrix 288 rows 133 cols
[2024-05-25 08:38:36] [INFO ] Computed 4 invariants in 1 ms
[2024-05-25 08:38:36] [INFO ] Implicit Places using invariants in 233 ms returned []
[2024-05-25 08:38:36] [INFO ] Flow matrix only has 288 transitions (discarded 2058 similar events)
[2024-05-25 08:38:36] [INFO ] Invariant cache hit.
[2024-05-25 08:38:36] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 08:38:37] [INFO ] Implicit Places using invariants and state equation in 810 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1078 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 132/138 places, 2346/2348 transitions.
Applied a total of 0 rules in 18 ms. Remains 132 /132 variables (removed 0) and now considering 2346/2346 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1143 ms. Remains : 132/138 places, 2346/2348 transitions.
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 (ADD s105 s106)), p1:(GT s103 (ADD s107 s108))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 15464 reset in 615 ms.
Product exploration explored 100000 steps with 15386 reset in 626 ms.
Computed a total of 105 stabilizing places and 202 stable transitions
Computed a total of 105 stabilizing places and 202 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 1 factoid took 387 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 60 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F p0), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 359 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 61 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 58 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
[2024-05-25 08:38:39] [INFO ] Flow matrix only has 288 transitions (discarded 2058 similar events)
// Phase 1: matrix 288 rows 132 cols
[2024-05-25 08:38:39] [INFO ] Computed 4 invariants in 1 ms
[2024-05-25 08:38:39] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-25 08:38:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:38:39] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2024-05-25 08:38:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 08:38:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-25 08:38:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 08:38:40] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2024-05-25 08:38:40] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 08:38:41] [INFO ] [Nat]Added 42 Read/Feed constraints in 1499 ms returned sat
[2024-05-25 08:38:41] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 165 transitions) in 91 ms.
[2024-05-25 08:38:41] [INFO ] Added : 19 causal constraints over 5 iterations in 243 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-25 08:38:41] [INFO ] Flow matrix only has 288 transitions (discarded 2058 similar events)
[2024-05-25 08:38:41] [INFO ] Invariant cache hit.
[2024-05-25 08:38:42] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-25 08:38:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:38:42] [INFO ] [Real]Absence check using state equation in 332 ms returned sat
[2024-05-25 08:38:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 08:38:43] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-25 08:38:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 08:38:43] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2024-05-25 08:38:43] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 08:38:43] [INFO ] [Nat]Added 42 Read/Feed constraints in 273 ms returned sat
[2024-05-25 08:38:44] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 165 transitions) in 54 ms.
[2024-05-25 08:38:44] [INFO ] Added : 21 causal constraints over 5 iterations in 410 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 5 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 2346/2346 transitions.
Applied a total of 0 rules in 10 ms. Remains 132 /132 variables (removed 0) and now considering 2346/2346 (removed 0) transitions.
[2024-05-25 08:38:44] [INFO ] Flow matrix only has 288 transitions (discarded 2058 similar events)
[2024-05-25 08:38:44] [INFO ] Invariant cache hit.
[2024-05-25 08:38:44] [INFO ] Implicit Places using invariants in 236 ms returned []
[2024-05-25 08:38:44] [INFO ] Flow matrix only has 288 transitions (discarded 2058 similar events)
[2024-05-25 08:38:44] [INFO ] Invariant cache hit.
[2024-05-25 08:38:44] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 08:38:45] [INFO ] Implicit Places using invariants and state equation in 670 ms returned []
Implicit Place search using SMT with State Equation took 933 ms to find 0 implicit places.
[2024-05-25 08:38:45] [INFO ] Flow matrix only has 288 transitions (discarded 2058 similar events)
[2024-05-25 08:38:45] [INFO ] Invariant cache hit.
[2024-05-25 08:38:46] [INFO ] Dead Transitions using invariants and state equation in 681 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1637 ms. Remains : 132/132 places, 2346/2346 transitions.
Computed a total of 105 stabilizing places and 202 stable transitions
Computed a total of 105 stabilizing places and 202 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 1 factoid took 242 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 52 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F p0), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 291 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 53 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 55 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
[2024-05-25 08:38:46] [INFO ] Flow matrix only has 288 transitions (discarded 2058 similar events)
[2024-05-25 08:38:46] [INFO ] Invariant cache hit.
[2024-05-25 08:38:46] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-25 08:38:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:38:47] [INFO ] [Real]Absence check using state equation in 174 ms returned sat
[2024-05-25 08:38:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 08:38:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-25 08:38:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 08:38:47] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2024-05-25 08:38:47] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 08:38:48] [INFO ] [Nat]Added 42 Read/Feed constraints in 1343 ms returned sat
[2024-05-25 08:38:48] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 165 transitions) in 57 ms.
[2024-05-25 08:38:49] [INFO ] Added : 40 causal constraints over 8 iterations in 233 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-25 08:38:49] [INFO ] Flow matrix only has 288 transitions (discarded 2058 similar events)
[2024-05-25 08:38:49] [INFO ] Invariant cache hit.
[2024-05-25 08:38:49] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-25 08:38:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:38:50] [INFO ] [Real]Absence check using state equation in 218 ms returned sat
[2024-05-25 08:38:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 08:38:50] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-25 08:38:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 08:38:50] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2024-05-25 08:38:50] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 08:38:51] [INFO ] [Nat]Added 42 Read/Feed constraints in 265 ms returned sat
[2024-05-25 08:38:51] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 165 transitions) in 56 ms.
[2024-05-25 08:38:51] [INFO ] Added : 21 causal constraints over 5 iterations in 411 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 76 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 15327 reset in 558 ms.
Product exploration explored 100000 steps with 15393 reset in 619 ms.
Built C files in :
/tmp/ltsmin6936304819519348936
[2024-05-25 08:38:52] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6936304819519348936
Running compilation step : cd /tmp/ltsmin6936304819519348936;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6936304819519348936;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6936304819519348936;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 5 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 2346/2346 transitions.
Applied a total of 0 rules in 10 ms. Remains 132 /132 variables (removed 0) and now considering 2346/2346 (removed 0) transitions.
[2024-05-25 08:38:55] [INFO ] Flow matrix only has 288 transitions (discarded 2058 similar events)
[2024-05-25 08:38:55] [INFO ] Invariant cache hit.
[2024-05-25 08:38:56] [INFO ] Implicit Places using invariants in 284 ms returned []
[2024-05-25 08:38:56] [INFO ] Flow matrix only has 288 transitions (discarded 2058 similar events)
[2024-05-25 08:38:56] [INFO ] Invariant cache hit.
[2024-05-25 08:38:56] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 08:38:56] [INFO ] Implicit Places using invariants and state equation in 766 ms returned []
Implicit Place search using SMT with State Equation took 1066 ms to find 0 implicit places.
[2024-05-25 08:38:56] [INFO ] Flow matrix only has 288 transitions (discarded 2058 similar events)
[2024-05-25 08:38:56] [INFO ] Invariant cache hit.
[2024-05-25 08:38:57] [INFO ] Dead Transitions using invariants and state equation in 599 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1698 ms. Remains : 132/132 places, 2346/2346 transitions.
Built C files in :
/tmp/ltsmin5272826804965805733
[2024-05-25 08:38:57] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5272826804965805733
Running compilation step : cd /tmp/ltsmin5272826804965805733;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5272826804965805733;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5272826804965805733;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 08:39:00] [INFO ] Flatten gal took : 54 ms
[2024-05-25 08:39:00] [INFO ] Flatten gal took : 56 ms
[2024-05-25 08:39:00] [INFO ] Time to serialize gal into /tmp/LTL4705301693882085060.gal : 11 ms
[2024-05-25 08:39:00] [INFO ] Time to serialize properties into /tmp/LTL3651692087658445802.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4705301693882085060.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6777476023994375119.hoa' '-atoms' '/tmp/LTL3651692087658445802.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL3651692087658445802.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6777476023994375119.hoa
Detected timeout of ITS tools.
[2024-05-25 08:39:15] [INFO ] Flatten gal took : 53 ms
[2024-05-25 08:39:15] [INFO ] Flatten gal took : 56 ms
[2024-05-25 08:39:16] [INFO ] Time to serialize gal into /tmp/LTL7461007509966673272.gal : 11 ms
[2024-05-25 08:39:16] [INFO ] Time to serialize properties into /tmp/LTL954819459158167764.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7461007509966673272.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL954819459158167764.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((F(("((CONTROLEUR_0+CONTROLEUR_1)>=1)")&&(X("(ATTENTE_B_0>(CHOIX_0+CHOIX_1))")))))
Formula 0 simplified : G(!"((CONTROLEUR_0+CONTROLEUR_1)>=1)" | X!"(ATTENTE_B_0>(CHOIX_0+CHOIX_1))")
Detected timeout of ITS tools.
[2024-05-25 08:39:31] [INFO ] Flatten gal took : 55 ms
[2024-05-25 08:39:31] [INFO ] Applying decomposition
[2024-05-25 08:39:31] [INFO ] Flatten gal took : 59 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2404628764015555500.txt' '-o' '/tmp/graph2404628764015555500.bin' '-w' '/tmp/graph2404628764015555500.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2404628764015555500.bin' '-l' '-1' '-v' '-w' '/tmp/graph2404628764015555500.weights' '-q' '0' '-e' '0.001'
[2024-05-25 08:39:31] [INFO ] Decomposing Gal with order
[2024-05-25 08:39:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 08:39:31] [INFO ] Removed a total of 6528 redundant transitions.
[2024-05-25 08:39:31] [INFO ] Flatten gal took : 354 ms
[2024-05-25 08:39:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 574 labels/synchronizations in 47 ms.
[2024-05-25 08:39:31] [INFO ] Time to serialize gal into /tmp/LTL7328084169947584184.gal : 2 ms
[2024-05-25 08:39:31] [INFO ] Time to serialize properties into /tmp/LTL4943140795407693689.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7328084169947584184.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4943140795407693689.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(("((gu1.CONTROLEUR_0+gu1.CONTROLEUR_1)>=1)")&&(X("(gu2.ATTENTE_B_0>(gu2.CHOIX_0+gu2.CHOIX_1))")))))
Formula 0 simplified : G(!"((gu1.CONTROLEUR_0+gu1.CONTROLEUR_1)>=1)" | X!"(gu2.ATTENTE_B_0>(gu2.CHOIX_0+gu2.CHOIX_1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2908974600348718436
[2024-05-25 08:39:46] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2908974600348718436
Running compilation step : cd /tmp/ltsmin2908974600348718436;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2908974600348718436;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2908974600348718436;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLCardinality-11 finished in 74150 ms.
[2024-05-25 08:39:50] [INFO ] Flatten gal took : 96 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin976015179083565867
[2024-05-25 08:39:50] [INFO ] Too many transitions (2348) to apply POR reductions. Disabling POR matrices.
[2024-05-25 08:39:50] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin976015179083565867
Running compilation step : cd /tmp/ltsmin976015179083565867;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-25 08:39:50] [INFO ] Applying decomposition
[2024-05-25 08:39:50] [INFO ] Flatten gal took : 76 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph3012059094307815680.txt' '-o' '/tmp/graph3012059094307815680.bin' '-w' '/tmp/graph3012059094307815680.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3012059094307815680.bin' '-l' '-1' '-v' '-w' '/tmp/graph3012059094307815680.weights' '-q' '0' '-e' '0.001'
[2024-05-25 08:39:50] [INFO ] Decomposing Gal with order
[2024-05-25 08:39:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 08:39:52] [INFO ] Removed a total of 4624 redundant transitions.
[2024-05-25 08:39:52] [INFO ] Flatten gal took : 1486 ms
[2024-05-25 08:39:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 1454 labels/synchronizations in 129 ms.
[2024-05-25 08:39:52] [INFO ] Time to serialize gal into /tmp/LTLCardinality11351012769995010905.gal : 18 ms
[2024-05-25 08:39:52] [INFO ] Time to serialize properties into /tmp/LTLCardinality5391213992752941883.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality11351012769995010905.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5391213992752941883.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 4 LTL properties
Checking formula 0 : !((X(X(F((G("(gi2.gu2.SUR_PONT_B_0<=gi2.gu2.ATTENTE_B_0)"))||(X(X(F(("(gi2.gu2.SUR_PONT_B_0>gi2.gu2.ATTENTE_B_0)")&&(X("(gu1.SORTI_A_0...186
Formula 0 simplified : XXG(F!"(gi2.gu2.SUR_PONT_B_0<=gi2.gu2.ATTENTE_B_0)" & XXG(!"(gi2.gu2.SUR_PONT_B_0>gi2.gu2.ATTENTE_B_0)" | X!"(gu1.SORTI_A_0<=gu1.SUR...168
Compilation finished in 6012 ms.
Running link step : cd /tmp/ltsmin976015179083565867;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 312 ms.
Running LTSmin : cd /tmp/ltsmin976015179083565867;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>(([]((LTLAPp0==true))||X(X(<>((!(LTLAPp0==true)&&X((LTLAPp1==true))))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin976015179083565867;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>(([]((LTLAPp0==true))||X(X(<>((!(LTLAPp0==true)&&X((LTLAPp1==true))))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin976015179083565867;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((LTLAPp2==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-25 09:03:08] [INFO ] Applying decomposition
[2024-05-25 09:03:08] [INFO ] Flatten gal took : 134 ms
[2024-05-25 09:03:08] [INFO ] Decomposing Gal with order
[2024-05-25 09:03:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 09:03:08] [INFO ] Removed a total of 13270 redundant transitions.
[2024-05-25 09:03:08] [INFO ] Flatten gal took : 370 ms
[2024-05-25 09:03:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 75 ms.
[2024-05-25 09:03:09] [INFO ] Time to serialize gal into /tmp/LTLCardinality10312692148777923623.gal : 23 ms
[2024-05-25 09:03:09] [INFO ] Time to serialize properties into /tmp/LTLCardinality6604210584032321421.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality10312692148777923623.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6604210584032321421.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 4 LTL properties
Checking formula 0 : !((X(X(F((G("(gSUR_PONT_B.SUR_PONT_B_0<=gATTENTE_B.ATTENTE_B_0)"))||(X(X(F(("(gSUR_PONT_B.SUR_PONT_B_0>gATTENTE_B.ATTENTE_B_0)")&&(X("...213
Formula 0 simplified : XXG(F!"(gSUR_PONT_B.SUR_PONT_B_0<=gATTENTE_B.ATTENTE_B_0)" & XXG(!"(gSUR_PONT_B.SUR_PONT_B_0>gATTENTE_B.ATTENTE_B_0)" | X!"(gSORTI_A...195
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin976015179083565867;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((LTLAPp2==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin976015179083565867;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp3==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin976015179083565867;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp3==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin976015179083565867;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((LTLAPp4==true)&&X((LTLAPp5==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-25 09:26:25] [INFO ] Flatten gal took : 232 ms
[2024-05-25 09:26:25] [INFO ] Input system was already deterministic with 2348 transitions.
[2024-05-25 09:26:25] [INFO ] Transformed 138 places.
[2024-05-25 09:26:25] [INFO ] Transformed 2348 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-25 09:26:25] [INFO ] Time to serialize gal into /tmp/LTLCardinality6342527582314457282.gal : 24 ms
[2024-05-25 09:26:25] [INFO ] Time to serialize properties into /tmp/LTLCardinality1354097701117320113.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality6342527582314457282.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1354097701117320113.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 4 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X(F((G("(SUR_PONT_B_0<=ATTENTE_B_0)"))||(X(X(F(("(SUR_PONT_B_0>ATTENTE_B_0)")&&(X("(SORTI_A_0<=SUR_PONT_A_0)")))))))))))
Formula 0 simplified : XXG(F!"(SUR_PONT_B_0<=ATTENTE_B_0)" & XXG(!"(SUR_PONT_B_0>ATTENTE_B_0)" | X!"(SORTI_A_0<=SUR_PONT_A_0)"))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 11863040 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16033276 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-COL-V50P50N20"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is BridgeAndVehicles-COL-V50P50N20, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r065-tajo-171620414300062"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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