Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Apr 11 17:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 11 17:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 11 16:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 11 16:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 107K May 18 16:43 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 Parking-PT-416-LTLFireability-00
FORMULA_NAME Parking-PT-416-LTLFireability-01
FORMULA_NAME Parking-PT-416-LTLFireability-02
FORMULA_NAME Parking-PT-416-LTLFireability-03
FORMULA_NAME Parking-PT-416-LTLFireability-04
FORMULA_NAME Parking-PT-416-LTLFireability-05
FORMULA_NAME Parking-PT-416-LTLFireability-06
FORMULA_NAME Parking-PT-416-LTLFireability-07
FORMULA_NAME Parking-PT-416-LTLFireability-08
FORMULA_NAME Parking-PT-416-LTLFireability-09
FORMULA_NAME Parking-PT-416-LTLFireability-10
FORMULA_NAME Parking-PT-416-LTLFireability-11
FORMULA_NAME Parking-PT-416-LTLFireability-12
FORMULA_NAME Parking-PT-416-LTLFireability-13
FORMULA_NAME Parking-PT-416-LTLFireability-14
FORMULA_NAME Parking-PT-416-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716655606385

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-416
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 16:46:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-25 16:46:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 16:46:48] [INFO ] Load time of PNML (sax parser for PT used): 186 ms
[2024-05-25 16:46:48] [INFO ] Transformed 305 places.
[2024-05-25 16:46:48] [INFO ] Transformed 433 transitions.
[2024-05-25 16:46:48] [INFO ] Found NUPN structural information;
[2024-05-25 16:46:48] [INFO ] Parsed PT model containing 305 places and 433 transitions and 1289 arcs in 355 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 176 transitions
Reduce redundant transitions removed 176 transitions.
Support contains 42 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 257/257 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 303 transition count 255
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 303 transition count 255
Applied a total of 4 rules in 76 ms. Remains 303 /305 variables (removed 2) and now considering 255/257 (removed 2) transitions.
// Phase 1: matrix 255 rows 303 cols
[2024-05-25 16:46:49] [INFO ] Computed 76 invariants in 31 ms
[2024-05-25 16:46:49] [INFO ] Implicit Places using invariants in 635 ms returned [48, 56, 64, 72, 88, 90, 125, 133, 141, 159, 187, 195, 203, 211, 227, 257, 265, 273, 297, 299]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 703 ms to find 20 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 283/305 places, 255/257 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 271 transition count 243
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 271 transition count 243
Applied a total of 24 rules in 27 ms. Remains 271 /283 variables (removed 12) and now considering 243/255 (removed 12) transitions.
// Phase 1: matrix 243 rows 271 cols
[2024-05-25 16:46:49] [INFO ] Computed 56 invariants in 4 ms
[2024-05-25 16:46:50] [INFO ] Implicit Places using invariants in 288 ms returned []
[2024-05-25 16:46:50] [INFO ] Invariant cache hit.
[2024-05-25 16:46:50] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-25 16:46:50] [INFO ] Implicit Places using invariants and state equation in 483 ms returned []
Implicit Place search using SMT with State Equation took 779 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 271/305 places, 243/257 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1630 ms. Remains : 271/305 places, 243/257 transitions.
Support contains 42 out of 271 places after structural reductions.
[2024-05-25 16:46:50] [INFO ] Flatten gal took : 76 ms
[2024-05-25 16:46:50] [INFO ] Flatten gal took : 32 ms
[2024-05-25 16:46:51] [INFO ] Input system was already deterministic with 243 transitions.
Support contains 40 out of 271 places (down from 42) after GAL structural reductions.
RANDOM walk for 40000 steps (511 resets) in 2600 ms. (15 steps per ms) remains 2/31 properties
BEST_FIRST walk for 40004 steps (18 resets) in 253 ms. (157 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (20 resets) in 224 ms. (177 steps per ms) remains 2/2 properties
[2024-05-25 16:46:52] [INFO ] Invariant cache hit.
[2024-05-25 16:46:52] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp22 is UNSAT
At refinement iteration 1 (OVERLAPS) 267/271 variables, 56/56 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-25 16:46:52] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 11 ms to minimize.
[2024-05-25 16:46:52] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/271 variables, 2/58 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 243/514 variables, 271/329 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 60/389 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 0/389 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/514 variables, 0/389 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 514/514 variables, and 389 constraints, problems are : Problem set: 1 solved, 1 unsolved in 567 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 271/271 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/43 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 228/271 variables, 54/56 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 2/58 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 243/514 variables, 271/329 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/514 variables, 60/389 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/514 variables, 1/390 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/514 variables, 0/390 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/514 variables, 0/390 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 514/514 variables, and 390 constraints, problems are : Problem set: 1 solved, 1 unsolved in 321 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 271/271 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 932ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 36 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=36 )
Parikh walk visited 1 properties in 12 ms.
FORMULA Parking-PT-416-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U p1))'
Support contains 4 out of 271 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 271/271 places, 243/243 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 270 transition count 235
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 263 transition count 234
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 262 transition count 234
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 16 place count 262 transition count 227
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 30 place count 255 transition count 227
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 33 place count 252 transition count 224
Iterating global reduction 3 with 3 rules applied. Total rules applied 36 place count 252 transition count 224
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 70 place count 235 transition count 207
Applied a total of 70 rules in 69 ms. Remains 235 /271 variables (removed 36) and now considering 207/243 (removed 36) transitions.
// Phase 1: matrix 207 rows 235 cols
[2024-05-25 16:46:53] [INFO ] Computed 56 invariants in 2 ms
[2024-05-25 16:46:53] [INFO ] Implicit Places using invariants in 252 ms returned [96, 124, 179, 217]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 256 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 231/271 places, 207/243 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 230 transition count 206
Applied a total of 2 rules in 34 ms. Remains 230 /231 variables (removed 1) and now considering 206/207 (removed 1) transitions.
// Phase 1: matrix 206 rows 230 cols
[2024-05-25 16:46:53] [INFO ] Computed 52 invariants in 2 ms
[2024-05-25 16:46:54] [INFO ] Implicit Places using invariants in 229 ms returned []
[2024-05-25 16:46:54] [INFO ] Invariant cache hit.
[2024-05-25 16:46:54] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 230/271 places, 206/243 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 882 ms. Remains : 230/271 places, 206/243 transitions.
Stuttering acceptance computed with spot in 292 ms :[true, (NOT p1)]
Running random walk in product with property : Parking-PT-416-LTLFireability-00
Stuttering criterion allowed to conclude after 133 steps with 1 reset in 8 ms.
FORMULA Parking-PT-416-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-00 finished in 1266 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 1 out of 271 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 271/271 places, 243/243 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 270 transition count 235
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 263 transition count 235
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 14 place count 263 transition count 228
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 28 place count 256 transition count 228
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 31 place count 253 transition count 225
Iterating global reduction 2 with 3 rules applied. Total rules applied 34 place count 253 transition count 225
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 70 place count 235 transition count 207
Applied a total of 70 rules in 65 ms. Remains 235 /271 variables (removed 36) and now considering 207/243 (removed 36) transitions.
// Phase 1: matrix 207 rows 235 cols
[2024-05-25 16:46:54] [INFO ] Computed 56 invariants in 2 ms
[2024-05-25 16:46:54] [INFO ] Implicit Places using invariants in 213 ms returned [96, 124, 178, 217]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 220 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 231/271 places, 207/243 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 230 transition count 206
Applied a total of 2 rules in 19 ms. Remains 230 /231 variables (removed 1) and now considering 206/207 (removed 1) transitions.
// Phase 1: matrix 206 rows 230 cols
[2024-05-25 16:46:55] [INFO ] Computed 52 invariants in 2 ms
[2024-05-25 16:46:55] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-25 16:46:55] [INFO ] Invariant cache hit.
[2024-05-25 16:46:55] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 230/271 places, 206/243 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 784 ms. Remains : 230/271 places, 206/243 transitions.
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-416-LTLFireability-02
Product exploration explored 100000 steps with 1324 reset in 590 ms.
Product exploration explored 100000 steps with 1330 reset in 553 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 156 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (524 resets) in 541 ms. (73 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40004 steps (20 resets) in 172 ms. (231 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (20 resets) in 143 ms. (277 steps per ms) remains 2/2 properties
[2024-05-25 16:46:57] [INFO ] Invariant cache hit.
Problem apf0 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/35 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 41/76 variables, 35/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 36/112 variables, 24/60 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 12/72 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/72 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/112 variables, 0/72 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 112/436 variables, and 72 constraints, problems are : Problem set: 1 solved, 1 unsolved in 77 ms.
Refiners :[Positive P Invariants (semi-flows): 13/52 constraints, State Equation: 59/230 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Int declared 35/436 variables, and 1 constraints, problems are : Problem set: 2 solved, 0 unsolved in 28 ms.
Refiners :[Positive P Invariants (semi-flows): 1/52 constraints, State Equation: 0/230 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 112ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (OR (NOT p0) p1)), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 15 factoid took 312 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Support contains 1 out of 230 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 230/230 places, 206/206 transitions.
Applied a total of 0 rules in 10 ms. Remains 230 /230 variables (removed 0) and now considering 206/206 (removed 0) transitions.
[2024-05-25 16:46:57] [INFO ] Invariant cache hit.
[2024-05-25 16:46:57] [INFO ] Implicit Places using invariants in 196 ms returned []
[2024-05-25 16:46:57] [INFO ] Invariant cache hit.
[2024-05-25 16:46:58] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 485 ms to find 0 implicit places.
[2024-05-25 16:46:58] [INFO ] Redundant transitions in 8 ms returned []
Running 138 sub problems to find dead transitions.
[2024-05-25 16:46:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/226 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 4/230 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 206/436 variables, 230/282 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (OVERLAPS) 0/436 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 436/436 variables, and 282 constraints, problems are : Problem set: 0 solved, 138 unsolved in 7144 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/226 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 4/230 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 206/436 variables, 230/282 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 138/420 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (OVERLAPS) 0/436 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 436/436 variables, and 420 constraints, problems are : Problem set: 0 solved, 138 unsolved in 7070 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints]
After SMT, in 14271ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 14278ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14807 ms. Remains : 230/230 places, 206/206 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 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 39 ms :[(NOT p1)]
RANDOM walk for 14818 steps (193 resets) in 65 ms. (224 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 105 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 37 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Product exploration explored 100000 steps with 1324 reset in 406 ms.
Product exploration explored 100000 steps with 1319 reset in 419 ms.
Support contains 1 out of 230 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 230/230 places, 206/206 transitions.
Applied a total of 0 rules in 9 ms. Remains 230 /230 variables (removed 0) and now considering 206/206 (removed 0) transitions.
[2024-05-25 16:47:13] [INFO ] Invariant cache hit.
[2024-05-25 16:47:14] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-05-25 16:47:14] [INFO ] Invariant cache hit.
[2024-05-25 16:47:14] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 551 ms to find 0 implicit places.
[2024-05-25 16:47:14] [INFO ] Redundant transitions in 9 ms returned []
Running 138 sub problems to find dead transitions.
[2024-05-25 16:47:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/226 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 4/230 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 206/436 variables, 230/282 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (OVERLAPS) 0/436 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 436/436 variables, and 282 constraints, problems are : Problem set: 0 solved, 138 unsolved in 6385 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/226 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 4/230 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 206/436 variables, 230/282 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 138/420 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (OVERLAPS) 0/436 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 436/436 variables, and 420 constraints, problems are : Problem set: 0 solved, 138 unsolved in 6811 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints]
After SMT, in 13231ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 13234ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 13810 ms. Remains : 230/230 places, 206/206 transitions.
Treatment of property Parking-PT-416-LTLFireability-02 finished in 33033 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 271 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 271/271 places, 243/243 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 270 transition count 234
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 262 transition count 234
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 16 place count 262 transition count 226
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 32 place count 254 transition count 226
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 35 place count 251 transition count 223
Iterating global reduction 2 with 3 rules applied. Total rules applied 38 place count 251 transition count 223
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 74 place count 233 transition count 205
Applied a total of 74 rules in 27 ms. Remains 233 /271 variables (removed 38) and now considering 205/243 (removed 38) transitions.
// Phase 1: matrix 205 rows 233 cols
[2024-05-25 16:47:27] [INFO ] Computed 56 invariants in 2 ms
[2024-05-25 16:47:27] [INFO ] Implicit Places using invariants in 182 ms returned [96, 124, 178, 215]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 188 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 229/271 places, 205/243 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 228 transition count 204
Applied a total of 2 rules in 14 ms. Remains 228 /229 variables (removed 1) and now considering 204/205 (removed 1) transitions.
// Phase 1: matrix 204 rows 228 cols
[2024-05-25 16:47:27] [INFO ] Computed 52 invariants in 2 ms
[2024-05-25 16:47:28] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-05-25 16:47:28] [INFO ] Invariant cache hit.
[2024-05-25 16:47:28] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 497 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 228/271 places, 204/243 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 727 ms. Remains : 228/271 places, 204/243 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Parking-PT-416-LTLFireability-03
Product exploration explored 100000 steps with 1379 reset in 442 ms.
Product exploration explored 100000 steps with 1377 reset in 516 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 150 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 1130 steps (13 resets) in 15 ms. (70 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 200 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 204/204 transitions.
Applied a total of 0 rules in 10 ms. Remains 228 /228 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2024-05-25 16:47:30] [INFO ] Invariant cache hit.
[2024-05-25 16:47:30] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-25 16:47:30] [INFO ] Invariant cache hit.
[2024-05-25 16:47:30] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 530 ms to find 0 implicit places.
[2024-05-25 16:47:30] [INFO ] Redundant transitions in 2 ms returned []
Running 136 sub problems to find dead transitions.
[2024-05-25 16:47:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/224 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 4/228 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 204/432 variables, 228/280 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/432 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 0/432 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 280 constraints, problems are : Problem set: 0 solved, 136 unsolved in 6545 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/224 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 4/228 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 204/432 variables, 228/280 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/432 variables, 136/416 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (OVERLAPS) 0/432 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 432/432 variables, and 416 constraints, problems are : Problem set: 0 solved, 136 unsolved in 6239 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints]
After SMT, in 12823ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 12831ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 13381 ms. Remains : 228/228 places, 204/204 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 152 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 1316 steps (14 resets) in 8 ms. (146 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 189 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 1376 reset in 355 ms.
Product exploration explored 100000 steps with 1372 reset in 406 ms.
Support contains 4 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 204/204 transitions.
Applied a total of 0 rules in 7 ms. Remains 228 /228 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2024-05-25 16:47:45] [INFO ] Invariant cache hit.
[2024-05-25 16:47:45] [INFO ] Implicit Places using invariants in 250 ms returned []
[2024-05-25 16:47:45] [INFO ] Invariant cache hit.
[2024-05-25 16:47:46] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 601 ms to find 0 implicit places.
[2024-05-25 16:47:46] [INFO ] Redundant transitions in 2 ms returned []
Running 136 sub problems to find dead transitions.
[2024-05-25 16:47:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/224 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 4/228 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 204/432 variables, 228/280 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/432 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 0/432 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 280 constraints, problems are : Problem set: 0 solved, 136 unsolved in 6238 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/224 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 4/228 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 204/432 variables, 228/280 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/432 variables, 136/416 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (OVERLAPS) 0/432 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 432/432 variables, and 416 constraints, problems are : Problem set: 0 solved, 136 unsolved in 6064 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints]
After SMT, in 12335ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 12340ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12958 ms. Remains : 228/228 places, 204/204 transitions.
Treatment of property Parking-PT-416-LTLFireability-03 finished in 30669 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 271 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 243/243 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 268 transition count 240
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 268 transition count 240
Applied a total of 6 rules in 5 ms. Remains 268 /271 variables (removed 3) and now considering 240/243 (removed 3) transitions.
// Phase 1: matrix 240 rows 268 cols
[2024-05-25 16:47:58] [INFO ] Computed 56 invariants in 2 ms
[2024-05-25 16:47:58] [INFO ] Implicit Places using invariants in 182 ms returned [107, 203, 249]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 184 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 265/271 places, 240/243 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 263 transition count 238
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 263 transition count 238
Applied a total of 4 rules in 5 ms. Remains 263 /265 variables (removed 2) and now considering 238/240 (removed 2) transitions.
// Phase 1: matrix 238 rows 263 cols
[2024-05-25 16:47:58] [INFO ] Computed 53 invariants in 1 ms
[2024-05-25 16:47:58] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-25 16:47:58] [INFO ] Invariant cache hit.
[2024-05-25 16:47:58] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-25 16:47:59] [INFO ] Implicit Places using invariants and state equation in 516 ms returned []
Implicit Place search using SMT with State Equation took 695 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 263/271 places, 238/243 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 891 ms. Remains : 263/271 places, 238/243 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-416-LTLFireability-04
Product exploration explored 100000 steps with 50000 reset in 848 ms.
Product exploration explored 100000 steps with 50000 reset in 879 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 16 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Parking-PT-416-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-416-LTLFireability-04 finished in 2738 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 271 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 243/243 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 269 transition count 241
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 269 transition count 241
Applied a total of 4 rules in 6 ms. Remains 269 /271 variables (removed 2) and now considering 241/243 (removed 2) transitions.
// Phase 1: matrix 241 rows 269 cols
[2024-05-25 16:48:01] [INFO ] Computed 56 invariants in 2 ms
[2024-05-25 16:48:01] [INFO ] Implicit Places using invariants in 213 ms returned [107, 142, 250]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 226 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 266/271 places, 241/243 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 263 transition count 238
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 263 transition count 238
Applied a total of 6 rules in 7 ms. Remains 263 /266 variables (removed 3) and now considering 238/241 (removed 3) transitions.
// Phase 1: matrix 238 rows 263 cols
[2024-05-25 16:48:01] [INFO ] Computed 53 invariants in 4 ms
[2024-05-25 16:48:01] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-05-25 16:48:01] [INFO ] Invariant cache hit.
[2024-05-25 16:48:01] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-25 16:48:02] [INFO ] Implicit Places using invariants and state equation in 468 ms returned []
Implicit Place search using SMT with State Equation took 690 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 263/271 places, 238/243 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 931 ms. Remains : 263/271 places, 238/243 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-416-LTLFireability-05
Stuttering criterion allowed to conclude after 75 steps with 0 reset in 1 ms.
FORMULA Parking-PT-416-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-05 finished in 1068 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 3 out of 271 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 271/271 places, 243/243 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 271 transition count 236
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 264 transition count 236
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 14 place count 264 transition count 229
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 28 place count 257 transition count 229
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 31 place count 254 transition count 226
Iterating global reduction 2 with 3 rules applied. Total rules applied 34 place count 254 transition count 226
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 68 place count 237 transition count 209
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 235 transition count 247
Applied a total of 72 rules in 40 ms. Remains 235 /271 variables (removed 36) and now considering 247/243 (removed -4) transitions.
// Phase 1: matrix 247 rows 235 cols
[2024-05-25 16:48:02] [INFO ] Computed 56 invariants in 1 ms
[2024-05-25 16:48:02] [INFO ] Implicit Places using invariants in 217 ms returned [96, 124, 178, 217]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 218 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 231/271 places, 247/243 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
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 2 place count 230 transition count 262
Applied a total of 2 rules in 19 ms. Remains 230 /231 variables (removed 1) and now considering 262/247 (removed -15) transitions.
// Phase 1: matrix 262 rows 230 cols
[2024-05-25 16:48:02] [INFO ] Computed 52 invariants in 1 ms
[2024-05-25 16:48:02] [INFO ] Implicit Places using invariants in 196 ms returned []
[2024-05-25 16:48:02] [INFO ] Invariant cache hit.
[2024-05-25 16:48:02] [INFO ] State equation strengthened by 123 read => feed constraints.
[2024-05-25 16:48:03] [INFO ] Implicit Places using invariants and state equation in 469 ms returned []
Implicit Place search using SMT with State Equation took 671 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 230/271 places, 262/243 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 951 ms. Remains : 230/271 places, 262/243 transitions.
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-416-LTLFireability-06
Stuttering criterion allowed to conclude after 64 steps with 0 reset in 0 ms.
FORMULA Parking-PT-416-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-06 finished in 1008 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 271 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 271/271 places, 243/243 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 270 transition count 234
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 262 transition count 234
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 16 place count 262 transition count 226
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 32 place count 254 transition count 226
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 35 place count 251 transition count 223
Iterating global reduction 2 with 3 rules applied. Total rules applied 38 place count 251 transition count 223
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 72 place count 234 transition count 206
Applied a total of 72 rules in 24 ms. Remains 234 /271 variables (removed 37) and now considering 206/243 (removed 37) transitions.
// Phase 1: matrix 206 rows 234 cols
[2024-05-25 16:48:03] [INFO ] Computed 56 invariants in 1 ms
[2024-05-25 16:48:03] [INFO ] Implicit Places using invariants in 230 ms returned [96, 125, 179, 216]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 230 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 230/271 places, 206/243 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 229 transition count 205
Applied a total of 2 rules in 9 ms. Remains 229 /230 variables (removed 1) and now considering 205/206 (removed 1) transitions.
// Phase 1: matrix 205 rows 229 cols
[2024-05-25 16:48:03] [INFO ] Computed 52 invariants in 1 ms
[2024-05-25 16:48:03] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-05-25 16:48:03] [INFO ] Invariant cache hit.
[2024-05-25 16:48:04] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 229/271 places, 205/243 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 784 ms. Remains : 229/271 places, 205/243 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-416-LTLFireability-07
Product exploration explored 100000 steps with 1346 reset in 327 ms.
Product exploration explored 100000 steps with 1343 reset in 483 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 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 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 5322 steps (67 resets) in 26 ms. (197 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 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 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 229/229 places, 205/205 transitions.
Applied a total of 0 rules in 6 ms. Remains 229 /229 variables (removed 0) and now considering 205/205 (removed 0) transitions.
[2024-05-25 16:48:05] [INFO ] Invariant cache hit.
[2024-05-25 16:48:05] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-25 16:48:05] [INFO ] Invariant cache hit.
[2024-05-25 16:48:05] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 509 ms to find 0 implicit places.
[2024-05-25 16:48:05] [INFO ] Redundant transitions in 1 ms returned []
Running 137 sub problems to find dead transitions.
[2024-05-25 16:48:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (OVERLAPS) 4/229 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (OVERLAPS) 205/434 variables, 229/281 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (OVERLAPS) 0/434 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 281 constraints, problems are : Problem set: 0 solved, 137 unsolved in 6288 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 137 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (OVERLAPS) 4/229 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (OVERLAPS) 205/434 variables, 229/281 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 137/418 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (OVERLAPS) 0/434 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Int declared 434/434 variables, and 418 constraints, problems are : Problem set: 0 solved, 137 unsolved in 6551 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 0/0 constraints]
After SMT, in 12865ms problems are : Problem set: 0 solved, 137 unsolved
Search for dead transitions found 0 dead transitions in 12868ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 13399 ms. Remains : 229/229 places, 205/205 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 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 77 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 2447 steps (29 resets) in 14 ms. (163 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 106 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 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1340 reset in 345 ms.
Product exploration explored 100000 steps with 1338 reset in 383 ms.
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 229/229 places, 205/205 transitions.
Applied a total of 0 rules in 6 ms. Remains 229 /229 variables (removed 0) and now considering 205/205 (removed 0) transitions.
[2024-05-25 16:48:20] [INFO ] Invariant cache hit.
[2024-05-25 16:48:20] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-05-25 16:48:20] [INFO ] Invariant cache hit.
[2024-05-25 16:48:20] [INFO ] Implicit Places using invariants and state equation in 344 ms returned []
Implicit Place search using SMT with State Equation took 562 ms to find 0 implicit places.
[2024-05-25 16:48:20] [INFO ] Redundant transitions in 0 ms returned []
Running 137 sub problems to find dead transitions.
[2024-05-25 16:48:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (OVERLAPS) 4/229 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (OVERLAPS) 205/434 variables, 229/281 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (OVERLAPS) 0/434 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 281 constraints, problems are : Problem set: 0 solved, 137 unsolved in 6273 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 137 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (OVERLAPS) 4/229 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (OVERLAPS) 205/434 variables, 229/281 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 137/418 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (OVERLAPS) 0/434 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Int declared 434/434 variables, and 418 constraints, problems are : Problem set: 0 solved, 137 unsolved in 6205 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 0/0 constraints]
After SMT, in 12515ms problems are : Problem set: 0 solved, 137 unsolved
Search for dead transitions found 0 dead transitions in 12518ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 13094 ms. Remains : 229/229 places, 205/205 transitions.
Treatment of property Parking-PT-416-LTLFireability-07 finished in 29906 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (G(!p0)||(!p0&&((X(p1)&&(p0||F(p2))) U p1)))))'
Support contains 5 out of 271 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 271/271 places, 243/243 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 271 transition count 236
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 264 transition count 236
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 14 place count 264 transition count 229
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 28 place count 257 transition count 229
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 31 place count 254 transition count 226
Iterating global reduction 2 with 3 rules applied. Total rules applied 34 place count 254 transition count 226
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 60 place count 241 transition count 213
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 64 place count 239 transition count 251
Applied a total of 64 rules in 34 ms. Remains 239 /271 variables (removed 32) and now considering 251/243 (removed -8) transitions.
// Phase 1: matrix 251 rows 239 cols
[2024-05-25 16:48:33] [INFO ] Computed 56 invariants in 2 ms
[2024-05-25 16:48:33] [INFO ] Implicit Places using invariants in 179 ms returned [129, 182]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 181 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 237/271 places, 251/243 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 236 transition count 250
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 236 transition count 250
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 235 transition count 265
Applied a total of 4 rules in 16 ms. Remains 235 /237 variables (removed 2) and now considering 265/251 (removed -14) transitions.
// Phase 1: matrix 265 rows 235 cols
[2024-05-25 16:48:33] [INFO ] Computed 54 invariants in 2 ms
[2024-05-25 16:48:33] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-25 16:48:33] [INFO ] Invariant cache hit.
[2024-05-25 16:48:33] [INFO ] State equation strengthened by 124 read => feed constraints.
[2024-05-25 16:48:34] [INFO ] Implicit Places using invariants and state equation in 567 ms returned []
Implicit Place search using SMT with State Equation took 757 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 235/271 places, 265/243 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 989 ms. Remains : 235/271 places, 265/243 transitions.
Stuttering acceptance computed with spot in 181 ms :[true, (NOT p2), p0, (AND p0 (NOT p1)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))]
Running random walk in product with property : Parking-PT-416-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Parking-PT-416-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-08 finished in 1195 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(!p0)||(!p0&&F(G(p1))))))))'
Support contains 3 out of 271 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 243/243 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 268 transition count 240
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 268 transition count 240
Applied a total of 6 rules in 5 ms. Remains 268 /271 variables (removed 3) and now considering 240/243 (removed 3) transitions.
// Phase 1: matrix 240 rows 268 cols
[2024-05-25 16:48:34] [INFO ] Computed 56 invariants in 2 ms
[2024-05-25 16:48:34] [INFO ] Implicit Places using invariants in 209 ms returned [107, 142, 203, 249]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 211 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 264/271 places, 240/243 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 261 transition count 237
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 261 transition count 237
Applied a total of 6 rules in 5 ms. Remains 261 /264 variables (removed 3) and now considering 237/240 (removed 3) transitions.
// Phase 1: matrix 237 rows 261 cols
[2024-05-25 16:48:34] [INFO ] Computed 52 invariants in 1 ms
[2024-05-25 16:48:34] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-05-25 16:48:34] [INFO ] Invariant cache hit.
[2024-05-25 16:48:34] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-25 16:48:35] [INFO ] Implicit Places using invariants and state equation in 549 ms returned []
Implicit Place search using SMT with State Equation took 734 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 261/271 places, 237/243 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 955 ms. Remains : 261/271 places, 237/243 transitions.
Stuttering acceptance computed with spot in 185 ms :[p0, (AND p0 (NOT p1)), p0, p0, p0]
Running random walk in product with property : Parking-PT-416-LTLFireability-09
Product exploration explored 100000 steps with 1291 reset in 378 ms.
Product exploration explored 100000 steps with 1280 reset in 447 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(AND p0 (NOT p1))]
RANDOM walk for 40000 steps (511 resets) in 323 ms. (123 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (20 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
[2024-05-25 16:48:36] [INFO ] Invariant cache hit.
[2024-05-25 16:48:36] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 81/84 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 177/261 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 237/498 variables, 261/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/498 variables, 60/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/498 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/498 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 373 constraints, problems are : Problem set: 0 solved, 1 unsolved in 242 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 261/261 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 81/84 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 177/261 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-25 16:48:36] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 2 ms to minimize.
[2024-05-25 16:48:37] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 237/498 variables, 261/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/498 variables, 60/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/498 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/498 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/498 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 498/498 variables, and 376 constraints, problems are : Problem set: 0 solved, 1 unsolved in 370 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 261/261 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 620ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1793 steps, including 30 resets, run visited all 1 properties in 13 ms. (steps per millisecond=137 )
Parikh walk visited 1 properties in 13 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 227 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 38 ms :[(AND p0 (NOT p1))]
Support contains 3 out of 261 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 261/261 places, 237/237 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 261 transition count 230
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 254 transition count 229
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 253 transition count 229
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 16 place count 253 transition count 222
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 30 place count 246 transition count 222
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 60 place count 231 transition count 207
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 62 place count 230 transition count 226
Applied a total of 62 rules in 18 ms. Remains 230 /261 variables (removed 31) and now considering 226/237 (removed 11) transitions.
// Phase 1: matrix 226 rows 230 cols
[2024-05-25 16:48:37] [INFO ] Computed 52 invariants in 1 ms
[2024-05-25 16:48:37] [INFO ] Implicit Places using invariants in 208 ms returned []
[2024-05-25 16:48:37] [INFO ] Invariant cache hit.
[2024-05-25 16:48:37] [INFO ] State equation strengthened by 98 read => feed constraints.
[2024-05-25 16:48:38] [INFO ] Implicit Places using invariants and state equation in 505 ms returned []
Implicit Place search using SMT with State Equation took 721 ms to find 0 implicit places.
[2024-05-25 16:48:38] [INFO ] Redundant transitions in 0 ms returned []
Running 221 sub problems to find dead transitions.
[2024-05-25 16:48:38] [INFO ] Invariant cache hit.
[2024-05-25 16:48:38] [INFO ] State equation strengthened by 98 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-25 16:48:41] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 226/456 variables, 230/283 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 98/381 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 0/456 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/456 variables, and 381 constraints, problems are : Problem set: 0 solved, 221 unsolved in 16005 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 230/230 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 226/456 variables, 230/283 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 98/381 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 221/602 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 0/456 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 456/456 variables, and 602 constraints, problems are : Problem set: 0 solved, 221 unsolved in 17653 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 230/230 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 1/1 constraints]
After SMT, in 33754ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 33758ms
Starting structural reductions in SI_LTL mode, iteration 1 : 230/261 places, 226/237 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 34509 ms. Remains : 230/261 places, 226/237 transitions.
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 141 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(AND p0 (NOT p1))]
RANDOM walk for 30496 steps (399 resets) in 176 ms. (172 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 13 factoid took 359 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 41 ms :[(AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 37 ms :[(AND p0 (NOT p1))]
Product exploration explored 100000 steps with 1320 reset in 385 ms.
Product exploration explored 100000 steps with 1329 reset in 432 ms.
Support contains 3 out of 230 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 230/230 places, 226/226 transitions.
Applied a total of 0 rules in 6 ms. Remains 230 /230 variables (removed 0) and now considering 226/226 (removed 0) transitions.
[2024-05-25 16:49:13] [INFO ] Invariant cache hit.
[2024-05-25 16:49:13] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-25 16:49:13] [INFO ] Invariant cache hit.
[2024-05-25 16:49:13] [INFO ] State equation strengthened by 98 read => feed constraints.
[2024-05-25 16:49:14] [INFO ] Implicit Places using invariants and state equation in 442 ms returned []
Implicit Place search using SMT with State Equation took 624 ms to find 0 implicit places.
[2024-05-25 16:49:14] [INFO ] Redundant transitions in 1 ms returned []
Running 221 sub problems to find dead transitions.
[2024-05-25 16:49:14] [INFO ] Invariant cache hit.
[2024-05-25 16:49:14] [INFO ] State equation strengthened by 98 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-25 16:49:16] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 226/456 variables, 230/283 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 98/381 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 0/456 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/456 variables, and 381 constraints, problems are : Problem set: 0 solved, 221 unsolved in 15029 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 230/230 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 226/456 variables, 230/283 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 98/381 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 221/602 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 0/456 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 456/456 variables, and 602 constraints, problems are : Problem set: 0 solved, 221 unsolved in 17412 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 230/230 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 1/1 constraints]
After SMT, in 32514ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 32517ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 33155 ms. Remains : 230/230 places, 226/226 transitions.
Treatment of property Parking-PT-416-LTLFireability-09 finished in 72481 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 271 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 243/243 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 268 transition count 240
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 268 transition count 240
Applied a total of 6 rules in 6 ms. Remains 268 /271 variables (removed 3) and now considering 240/243 (removed 3) transitions.
// Phase 1: matrix 240 rows 268 cols
[2024-05-25 16:49:46] [INFO ] Computed 56 invariants in 1 ms
[2024-05-25 16:49:47] [INFO ] Implicit Places using invariants in 217 ms returned [107, 142, 203, 249]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 219 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 264/271 places, 240/243 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 261 transition count 237
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 261 transition count 237
Applied a total of 6 rules in 6 ms. Remains 261 /264 variables (removed 3) and now considering 237/240 (removed 3) transitions.
// Phase 1: matrix 237 rows 261 cols
[2024-05-25 16:49:47] [INFO ] Computed 52 invariants in 1 ms
[2024-05-25 16:49:47] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-05-25 16:49:47] [INFO ] Invariant cache hit.
[2024-05-25 16:49:47] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-25 16:49:47] [INFO ] Implicit Places using invariants and state equation in 496 ms returned []
Implicit Place search using SMT with State Equation took 701 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 261/271 places, 237/243 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 932 ms. Remains : 261/271 places, 237/243 transitions.
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-416-LTLFireability-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Parking-PT-416-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-10 finished in 1075 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(!p0)&&X(p1))||(p2 U (!p1||G(p2))))))'
Support contains 4 out of 271 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 243/243 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 268 transition count 240
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 268 transition count 240
Applied a total of 6 rules in 5 ms. Remains 268 /271 variables (removed 3) and now considering 240/243 (removed 3) transitions.
// Phase 1: matrix 240 rows 268 cols
[2024-05-25 16:49:47] [INFO ] Computed 56 invariants in 1 ms
[2024-05-25 16:49:48] [INFO ] Implicit Places using invariants in 238 ms returned [107, 142, 203, 249]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 240 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 264/271 places, 240/243 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 261 transition count 237
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 261 transition count 237
Applied a total of 6 rules in 5 ms. Remains 261 /264 variables (removed 3) and now considering 237/240 (removed 3) transitions.
// Phase 1: matrix 237 rows 261 cols
[2024-05-25 16:49:48] [INFO ] Computed 52 invariants in 5 ms
[2024-05-25 16:49:48] [INFO ] Implicit Places using invariants in 209 ms returned []
[2024-05-25 16:49:48] [INFO ] Invariant cache hit.
[2024-05-25 16:49:48] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-25 16:49:48] [INFO ] Implicit Places using invariants and state equation in 428 ms returned []
Implicit Place search using SMT with State Equation took 639 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 261/271 places, 237/243 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 890 ms. Remains : 261/271 places, 237/243 transitions.
Stuttering acceptance computed with spot in 213 ms :[(AND p1 (NOT p2) p0), (AND p1 (NOT p2) p0), (NOT p1), p0, (AND p0 p1 (NOT p2)), true]
Running random walk in product with property : Parking-PT-416-LTLFireability-11
Product exploration explored 100000 steps with 50000 reset in 853 ms.
Product exploration explored 100000 steps with 50000 reset in 882 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p2), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT p1))), (X (X (NOT (AND p0 p1 p2)))), (X (X p0)), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 16 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Parking-PT-416-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-416-LTLFireability-11 finished in 2877 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U p1)))'
Support contains 4 out of 271 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 243/243 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 268 transition count 240
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 268 transition count 240
Applied a total of 6 rules in 5 ms. Remains 268 /271 variables (removed 3) and now considering 240/243 (removed 3) transitions.
// Phase 1: matrix 240 rows 268 cols
[2024-05-25 16:49:50] [INFO ] Computed 56 invariants in 1 ms
[2024-05-25 16:49:51] [INFO ] Implicit Places using invariants in 236 ms returned [107, 142, 203, 249]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 237 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 264/271 places, 240/243 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 261 transition count 237
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 261 transition count 237
Applied a total of 6 rules in 6 ms. Remains 261 /264 variables (removed 3) and now considering 237/240 (removed 3) transitions.
// Phase 1: matrix 237 rows 261 cols
[2024-05-25 16:49:51] [INFO ] Computed 52 invariants in 1 ms
[2024-05-25 16:49:51] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-05-25 16:49:51] [INFO ] Invariant cache hit.
[2024-05-25 16:49:51] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-25 16:49:51] [INFO ] Implicit Places using invariants and state equation in 515 ms returned []
Implicit Place search using SMT with State Equation took 716 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 261/271 places, 237/243 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 966 ms. Remains : 261/271 places, 237/243 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : Parking-PT-416-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Parking-PT-416-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-12 finished in 1069 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(p1)&&p0))&&X(F(!p2))))'
Support contains 4 out of 271 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 243/243 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 268 transition count 240
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 268 transition count 240
Applied a total of 6 rules in 5 ms. Remains 268 /271 variables (removed 3) and now considering 240/243 (removed 3) transitions.
// Phase 1: matrix 240 rows 268 cols
[2024-05-25 16:49:51] [INFO ] Computed 56 invariants in 1 ms
[2024-05-25 16:49:52] [INFO ] Implicit Places using invariants in 224 ms returned [107, 142, 203, 249]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 226 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 264/271 places, 240/243 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 261 transition count 237
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 261 transition count 237
Applied a total of 6 rules in 5 ms. Remains 261 /264 variables (removed 3) and now considering 237/240 (removed 3) transitions.
// Phase 1: matrix 237 rows 261 cols
[2024-05-25 16:49:52] [INFO ] Computed 52 invariants in 3 ms
[2024-05-25 16:49:52] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-05-25 16:49:52] [INFO ] Invariant cache hit.
[2024-05-25 16:49:52] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-25 16:49:52] [INFO ] Implicit Places using invariants and state equation in 432 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 261/271 places, 237/243 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 868 ms. Remains : 261/271 places, 237/243 transitions.
Stuttering acceptance computed with spot in 276 ms :[(OR (NOT p1) (NOT p0) p2), (OR (NOT p1) (NOT p0)), p2, (NOT p1)]
Running random walk in product with property : Parking-PT-416-LTLFireability-13
Stuttering criterion allowed to conclude after 68 steps with 0 reset in 0 ms.
FORMULA Parking-PT-416-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-13 finished in 1164 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((X(G(p0))||G(p1)))&&(!p2 U (p3||G(!p2))))))'
Support contains 4 out of 271 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 243/243 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 269 transition count 241
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 269 transition count 241
Applied a total of 4 rules in 6 ms. Remains 269 /271 variables (removed 2) and now considering 241/243 (removed 2) transitions.
// Phase 1: matrix 241 rows 269 cols
[2024-05-25 16:49:53] [INFO ] Computed 56 invariants in 1 ms
[2024-05-25 16:49:53] [INFO ] Implicit Places using invariants in 210 ms returned [107, 142, 203, 250]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 212 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 265/271 places, 241/243 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 262 transition count 238
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 262 transition count 238
Applied a total of 6 rules in 5 ms. Remains 262 /265 variables (removed 3) and now considering 238/241 (removed 3) transitions.
// Phase 1: matrix 238 rows 262 cols
[2024-05-25 16:49:53] [INFO ] Computed 52 invariants in 1 ms
[2024-05-25 16:49:53] [INFO ] Implicit Places using invariants in 217 ms returned []
[2024-05-25 16:49:53] [INFO ] Invariant cache hit.
[2024-05-25 16:49:53] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-25 16:49:53] [INFO ] Implicit Places using invariants and state equation in 541 ms returned []
Implicit Place search using SMT with State Equation took 763 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 262/271 places, 238/243 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 988 ms. Remains : 262/271 places, 238/243 transitions.
Stuttering acceptance computed with spot in 254 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND p2 (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND p2 (NOT p3))), (OR (NOT p0) (AND p2 (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND p2 (NOT p3))), (OR (NOT p1) (AND p2 (NOT p3)))]
Running random walk in product with property : Parking-PT-416-LTLFireability-14
Entered a terminal (fully accepting) state of product in 360 steps with 4 reset in 6 ms.
FORMULA Parking-PT-416-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-14 finished in 1273 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(G(p1)&&(p0||X(p0))))))'
Support contains 1 out of 271 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 271/271 places, 243/243 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 270 transition count 235
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 263 transition count 234
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 262 transition count 234
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 16 place count 262 transition count 227
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 30 place count 255 transition count 227
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 32 place count 253 transition count 225
Iterating global reduction 3 with 2 rules applied. Total rules applied 34 place count 253 transition count 225
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 70 place count 235 transition count 207
Applied a total of 70 rules in 23 ms. Remains 235 /271 variables (removed 36) and now considering 207/243 (removed 36) transitions.
// Phase 1: matrix 207 rows 235 cols
[2024-05-25 16:49:54] [INFO ] Computed 56 invariants in 1 ms
[2024-05-25 16:49:54] [INFO ] Implicit Places using invariants in 175 ms returned [96, 125, 180, 217]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 178 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 231/271 places, 207/243 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 230 transition count 206
Applied a total of 2 rules in 8 ms. Remains 230 /231 variables (removed 1) and now considering 206/207 (removed 1) transitions.
// Phase 1: matrix 206 rows 230 cols
[2024-05-25 16:49:54] [INFO ] Computed 52 invariants in 1 ms
[2024-05-25 16:49:54] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-25 16:49:54] [INFO ] Invariant cache hit.
[2024-05-25 16:49:54] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 230/271 places, 206/243 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 653 ms. Remains : 230/271 places, 206/243 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-416-LTLFireability-15
Stuttering criterion allowed to conclude after 139 steps with 1 reset in 1 ms.
FORMULA Parking-PT-416-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-15 finished in 723 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(!p0)||(!p0&&F(G(p1))))))))'
Found a Shortening insensitive property : Parking-PT-416-LTLFireability-09
Stuttering acceptance computed with spot in 191 ms :[p0, (AND p0 (NOT p1)), p0, p0, p0]
Support contains 3 out of 271 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 271/271 places, 243/243 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 271 transition count 236
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 264 transition count 235
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 263 transition count 235
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 16 place count 263 transition count 228
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 30 place count 256 transition count 228
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 33 place count 253 transition count 225
Iterating global reduction 3 with 3 rules applied. Total rules applied 36 place count 253 transition count 225
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 70 place count 236 transition count 208
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 74 place count 234 transition count 246
Applied a total of 74 rules in 28 ms. Remains 234 /271 variables (removed 37) and now considering 246/243 (removed -3) transitions.
// Phase 1: matrix 246 rows 234 cols
[2024-05-25 16:49:55] [INFO ] Computed 56 invariants in 2 ms
[2024-05-25 16:49:56] [INFO ] Implicit Places using invariants in 221 ms returned [97, 125, 179, 216]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 223 ms to find 4 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 230/271 places, 246/243 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
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 2 place count 229 transition count 261
Applied a total of 2 rules in 8 ms. Remains 229 /230 variables (removed 1) and now considering 261/246 (removed -15) transitions.
// Phase 1: matrix 261 rows 229 cols
[2024-05-25 16:49:56] [INFO ] Computed 52 invariants in 2 ms
[2024-05-25 16:49:56] [INFO ] Implicit Places using invariants in 206 ms returned []
[2024-05-25 16:49:56] [INFO ] Invariant cache hit.
[2024-05-25 16:49:56] [INFO ] State equation strengthened by 118 read => feed constraints.
[2024-05-25 16:49:56] [INFO ] Implicit Places using invariants and state equation in 597 ms returned []
Implicit Place search using SMT with State Equation took 814 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 229/271 places, 261/243 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1076 ms. Remains : 229/271 places, 261/243 transitions.
Running random walk in product with property : Parking-PT-416-LTLFireability-09
Product exploration explored 100000 steps with 1344 reset in 394 ms.
Product exploration explored 100000 steps with 1342 reset in 450 ms.
Computed a total of 1 stabilizing places and 25 stable transitions
Computed a total of 1 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 176 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(AND p0 (NOT p1))]
RANDOM walk for 40000 steps (536 resets) in 208 ms. (191 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (20 resets) in 83 ms. (476 steps per ms) remains 1/1 properties
[2024-05-25 16:49:58] [INFO ] Invariant cache hit.
[2024-05-25 16:49:58] [INFO ] State equation strengthened by 118 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 67/70 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 159/229 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 261/490 variables, 229/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 118/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/490 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 490/490 variables, and 399 constraints, problems are : Problem set: 0 solved, 1 unsolved in 250 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 229/229 constraints, ReadFeed: 118/118 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 67/70 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 159/229 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 261/490 variables, 229/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 118/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 1/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/490 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 490/490 variables, and 400 constraints, problems are : Problem set: 0 solved, 1 unsolved in 310 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 229/229 constraints, ReadFeed: 118/118 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 573ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 46 ms.
Support contains 3 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 261/261 transitions.
Free-agglomeration rule applied 57 times.
Iterating global reduction 0 with 57 rules applied. Total rules applied 57 place count 229 transition count 204
Reduce places removed 57 places and 0 transitions.
Graph (complete) has 423 edges and 172 vertex of which 92 are kept as prefixes of interest. Removing 80 places using SCC suffix rule.1 ms
Discarding 80 places :
Also discarding 76 output transitions
Drop transitions (Output transitions of discarded places.) removed 76 transitions
Iterating post reduction 0 with 58 rules applied. Total rules applied 115 place count 92 transition count 128
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 147 place count 92 transition count 96
Applied a total of 147 rules in 44 ms. Remains 92 /229 variables (removed 137) and now considering 96/261 (removed 165) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 92/229 places, 96/261 transitions.
RANDOM walk for 40000 steps (8 resets) in 141 ms. (281 steps per ms) remains 1/1 properties
BEST_FIRST walk for 443 steps (0 resets) in 5 ms. (73 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 230 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 37 ms :[(AND p0 (NOT p1))]
Support contains 3 out of 229 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 229/229 places, 261/261 transitions.
Applied a total of 0 rules in 15 ms. Remains 229 /229 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-05-25 16:49:59] [INFO ] Invariant cache hit.
[2024-05-25 16:49:59] [INFO ] Implicit Places using invariants in 203 ms returned []
[2024-05-25 16:49:59] [INFO ] Invariant cache hit.
[2024-05-25 16:49:59] [INFO ] State equation strengthened by 118 read => feed constraints.
[2024-05-25 16:49:59] [INFO ] Implicit Places using invariants and state equation in 560 ms returned []
Implicit Place search using SMT with State Equation took 766 ms to find 0 implicit places.
[2024-05-25 16:49:59] [INFO ] Redundant transitions in 1 ms returned []
Running 236 sub problems to find dead transitions.
[2024-05-25 16:49:59] [INFO ] Invariant cache hit.
[2024-05-25 16:49:59] [INFO ] State equation strengthened by 118 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 261/490 variables, 229/281 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/490 variables, 118/399 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/490 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (OVERLAPS) 0/490 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Real declared 490/490 variables, and 399 constraints, problems are : Problem set: 0 solved, 236 unsolved in 16469 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 229/229 constraints, ReadFeed: 118/118 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 236 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 261/490 variables, 229/281 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/490 variables, 118/399 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/490 variables, 236/635 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (OVERLAPS) 0/490 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Int declared 490/490 variables, and 635 constraints, problems are : Problem set: 0 solved, 236 unsolved in 25766 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 229/229 constraints, ReadFeed: 118/118 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints]
After SMT, in 42527ms problems are : Problem set: 0 solved, 236 unsolved
Search for dead transitions found 0 dead transitions in 42531ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 43319 ms. Remains : 229/229 places, 261/261 transitions.
Computed a total of 1 stabilizing places and 25 stable transitions
Computed a total of 1 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 146 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(AND p0 (NOT p1))]
RANDOM walk for 40000 steps (535 resets) in 212 ms. (187 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (20 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
[2024-05-25 16:50:42] [INFO ] Invariant cache hit.
[2024-05-25 16:50:42] [INFO ] State equation strengthened by 118 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 67/70 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 159/229 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 261/490 variables, 229/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 118/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/490 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 490/490 variables, and 399 constraints, problems are : Problem set: 0 solved, 1 unsolved in 248 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 229/229 constraints, ReadFeed: 118/118 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 67/70 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 159/229 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 261/490 variables, 229/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 118/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 1/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/490 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 490/490 variables, and 400 constraints, problems are : Problem set: 0 solved, 1 unsolved in 299 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 229/229 constraints, ReadFeed: 118/118 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 561ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 37 ms.
Support contains 3 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 261/261 transitions.
Free-agglomeration rule applied 57 times.
Iterating global reduction 0 with 57 rules applied. Total rules applied 57 place count 229 transition count 204
Reduce places removed 57 places and 0 transitions.
Graph (complete) has 423 edges and 172 vertex of which 92 are kept as prefixes of interest. Removing 80 places using SCC suffix rule.0 ms
Discarding 80 places :
Also discarding 76 output transitions
Drop transitions (Output transitions of discarded places.) removed 76 transitions
Iterating post reduction 0 with 58 rules applied. Total rules applied 115 place count 92 transition count 128
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 147 place count 92 transition count 96
Applied a total of 147 rules in 21 ms. Remains 92 /229 variables (removed 137) and now considering 96/261 (removed 165) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 92/229 places, 96/261 transitions.
RANDOM walk for 40000 steps (8 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
BEST_FIRST walk for 869 steps (0 resets) in 4 ms. (173 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 13 factoid took 370 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 36 ms :[(AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 35 ms :[(AND p0 (NOT p1))]
Product exploration explored 100000 steps with 1328 reset in 383 ms.
Product exploration explored 100000 steps with 1344 reset in 438 ms.
Support contains 3 out of 229 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 229/229 places, 261/261 transitions.
Applied a total of 0 rules in 8 ms. Remains 229 /229 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2024-05-25 16:50:44] [INFO ] Invariant cache hit.
[2024-05-25 16:50:44] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-05-25 16:50:44] [INFO ] Invariant cache hit.
[2024-05-25 16:50:45] [INFO ] State equation strengthened by 118 read => feed constraints.
[2024-05-25 16:50:45] [INFO ] Implicit Places using invariants and state equation in 544 ms returned []
Implicit Place search using SMT with State Equation took 762 ms to find 0 implicit places.
[2024-05-25 16:50:45] [INFO ] Redundant transitions in 1 ms returned []
Running 236 sub problems to find dead transitions.
[2024-05-25 16:50:45] [INFO ] Invariant cache hit.
[2024-05-25 16:50:45] [INFO ] State equation strengthened by 118 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 261/490 variables, 229/281 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/490 variables, 118/399 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/490 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (OVERLAPS) 0/490 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Real declared 490/490 variables, and 399 constraints, problems are : Problem set: 0 solved, 236 unsolved in 15771 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 229/229 constraints, ReadFeed: 118/118 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 236 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 261/490 variables, 229/281 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/490 variables, 118/399 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/490 variables, 236/635 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (OVERLAPS) 0/490 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Int declared 490/490 variables, and 635 constraints, problems are : Problem set: 0 solved, 236 unsolved in 25247 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 229/229 constraints, ReadFeed: 118/118 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints]
After SMT, in 41233ms problems are : Problem set: 0 solved, 236 unsolved
Search for dead transitions found 0 dead transitions in 41236ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 42013 ms. Remains : 229/229 places, 261/261 transitions.
Treatment of property Parking-PT-416-LTLFireability-09 finished in 91229 ms.
[2024-05-25 16:51:26] [INFO ] Flatten gal took : 32 ms
[2024-05-25 16:51:26] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-05-25 16:51:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 271 places, 243 transitions and 809 arcs took 5 ms.
Total runtime 278649 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Parking-PT-416

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 271
TRANSITIONS: 243
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.006s, Sys 0.000s]


SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1684
MODEL NAME: /home/mcc/execution/414/model
271 places, 243 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA Parking-PT-416-LTLFireability-02 CANNOT_COMPUTE
FORMULA Parking-PT-416-LTLFireability-03 CANNOT_COMPUTE
FORMULA Parking-PT-416-LTLFireability-07 CANNOT_COMPUTE
FORMULA Parking-PT-416-LTLFireability-09 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716656448145

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

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="Parking-PT-416"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is Parking-PT-416, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r267-smll-171654405600076"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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