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

--------------------
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 1716841740236

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-416
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-27 20:29:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-27 20:29:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 20:29:03] [INFO ] Load time of PNML (sax parser for PT used): 116 ms
[2024-05-27 20:29:03] [INFO ] Transformed 305 places.
[2024-05-27 20:29:03] [INFO ] Transformed 433 transitions.
[2024-05-27 20:29:03] [INFO ] Found NUPN structural information;
[2024-05-27 20:29:03] [INFO ] Parsed PT model containing 305 places and 433 transitions and 1289 arcs in 240 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 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 79 ms. Remains 303 /305 variables (removed 2) and now considering 255/257 (removed 2) transitions.
// Phase 1: matrix 255 rows 303 cols
[2024-05-27 20:29:03] [INFO ] Computed 76 invariants in 19 ms
[2024-05-27 20:29:03] [INFO ] Implicit Places using invariants in 571 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 612 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 17 ms. Remains 271 /283 variables (removed 12) and now considering 243/255 (removed 12) transitions.
// Phase 1: matrix 243 rows 271 cols
[2024-05-27 20:29:03] [INFO ] Computed 56 invariants in 7 ms
[2024-05-27 20:29:04] [INFO ] Implicit Places using invariants in 243 ms returned []
[2024-05-27 20:29:04] [INFO ] Invariant cache hit.
[2024-05-27 20:29:04] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-27 20:29:04] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 638 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 1347 ms. Remains : 271/305 places, 243/257 transitions.
Support contains 42 out of 271 places after structural reductions.
[2024-05-27 20:29:04] [INFO ] Flatten gal took : 78 ms
[2024-05-27 20:29:04] [INFO ] Flatten gal took : 31 ms
[2024-05-27 20:29:05] [INFO ] Input system was already deterministic with 243 transitions.
Support contains 40 out of 271 places (down from 42) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 128 resets, run finished after 658 ms. (steps per millisecond=15 ) properties (out of 31) seen :26
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-27 20:29:05] [INFO ] Invariant cache hit.
[2024-05-27 20:29:05] [INFO ] [Real]Absence check using 56 positive place invariants in 20 ms returned sat
[2024-05-27 20:29:06] [INFO ] After 153ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1
[2024-05-27 20:29:06] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-27 20:29:06] [INFO ] After 26ms SMT Verify possible using 60 Read/Feed constraints in real domain returned unsat :1 sat :1
[2024-05-27 20:29:06] [INFO ] After 74ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2024-05-27 20:29:06] [INFO ] After 397ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 243/243 transitions.
Drop transitions 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 271 transition count 235
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 263 transition count 235
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 263 transition count 227
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 255 transition count 227
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 34 place count 253 transition count 225
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 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 6 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 72 place count 235 transition count 207
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 74 place count 234 transition count 226
Free-agglomeration rule applied 55 times.
Iterating global reduction 2 with 55 rules applied. Total rules applied 129 place count 234 transition count 171
Reduce places removed 55 places and 0 transitions.
Graph (complete) has 392 edges and 179 vertex of which 52 are kept as prefixes of interest. Removing 127 places using SCC suffix rule.1 ms
Discarding 127 places :
Also discarding 119 output transitions
Drop transitions removed 119 transitions
Iterating post reduction 2 with 56 rules applied. Total rules applied 185 place count 52 transition count 52
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 195 place count 52 transition count 42
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 196 place count 51 transition count 41
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 4 with 37 rules applied. Total rules applied 233 place count 36 transition count 19
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 5 with 28 rules applied. Total rules applied 261 place count 14 transition count 13
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 265 place count 10 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 265 place count 10 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 269 place count 8 transition count 11
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 272 place count 5 transition count 8
Iterating global reduction 7 with 3 rules applied. Total rules applied 275 place count 5 transition count 8
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 278 place count 5 transition count 5
Applied a total of 278 rules in 109 ms. Remains 5 /271 variables (removed 266) and now considering 5/243 (removed 238) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 5/271 places, 5/243 transitions.
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Parikh walk visited 0 properties in 0 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.202304061127/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 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 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 0 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 39 ms. Remains 235 /271 variables (removed 36) and now considering 207/243 (removed 36) transitions.
// Phase 1: matrix 207 rows 235 cols
[2024-05-27 20:29:06] [INFO ] Computed 56 invariants in 4 ms
[2024-05-27 20:29:07] [INFO ] Implicit Places using invariants in 226 ms returned [96, 124, 179, 217]
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 : 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 15 ms. Remains 230 /231 variables (removed 1) and now considering 206/207 (removed 1) transitions.
// Phase 1: matrix 206 rows 230 cols
[2024-05-27 20:29:07] [INFO ] Computed 52 invariants in 2 ms
[2024-05-27 20:29:07] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-27 20:29:07] [INFO ] Invariant cache hit.
[2024-05-27 20:29:07] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 435 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 719 ms. Remains : 230/271 places, 206/243 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 232 ms :[true, (NOT p1)]
Running random walk in product with property : Parking-PT-416-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(EQ s144 1), p0:(OR (EQ s206 1) (NOT (AND (EQ s99 1) (EQ s124 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 87 steps with 0 reset in 4 ms.
FORMULA Parking-PT-416-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-00 finished in 1021 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 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 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 32 ms. Remains 235 /271 variables (removed 36) and now considering 207/243 (removed 36) transitions.
// Phase 1: matrix 207 rows 235 cols
[2024-05-27 20:29:07] [INFO ] Computed 56 invariants in 2 ms
[2024-05-27 20:29:08] [INFO ] Implicit Places using invariants in 190 ms returned [96, 124, 178, 217]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 192 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 14 ms. Remains 230 /231 variables (removed 1) and now considering 206/207 (removed 1) transitions.
// Phase 1: matrix 206 rows 230 cols
[2024-05-27 20:29:08] [INFO ] Computed 52 invariants in 5 ms
[2024-05-27 20:29:08] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-27 20:29:08] [INFO ] Invariant cache hit.
[2024-05-27 20:29:08] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 470 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 708 ms. Remains : 230/271 places, 206/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-02 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s205 0), p1:(NEQ s205 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1333 reset in 578 ms.
Product exploration explored 100000 steps with 1317 reset in 599 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 (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 116 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 (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 132 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-27 20:29:10] [INFO ] Invariant cache hit.
[2024-05-27 20:29:10] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2024-05-27 20:29:10] [INFO ] [Nat]Absence check using 52 positive place invariants in 13 ms returned sat
[2024-05-27 20:29:10] [INFO ] After 78ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (G (NOT (AND p0 (NOT p1)))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 11 factoid took 214 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 36 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 34 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 8 ms. Remains 230 /230 variables (removed 0) and now considering 206/206 (removed 0) transitions.
[2024-05-27 20:29:10] [INFO ] Invariant cache hit.
[2024-05-27 20:29:10] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-05-27 20:29:10] [INFO ] Invariant cache hit.
[2024-05-27 20:29:11] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
[2024-05-27 20:29:11] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-27 20:29:11] [INFO ] Invariant cache hit.
[2024-05-27 20:29:11] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 683 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 77 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)]
Finished random walk after 864 steps, including 11 resets, run visited all 1 properties in 4 ms. (steps per millisecond=216 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 99 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 39 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Product exploration explored 100000 steps with 1329 reset in 396 ms.
Product exploration explored 100000 steps with 1325 reset in 388 ms.
Built C files in :
/tmp/ltsmin6954616581658837376
[2024-05-27 20:29:12] [INFO ] Computing symmetric may disable matrix : 206 transitions.
[2024-05-27 20:29:12] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:29:12] [INFO ] Computing symmetric may enable matrix : 206 transitions.
[2024-05-27 20:29:12] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:29:12] [INFO ] Computing Do-Not-Accords matrix : 206 transitions.
[2024-05-27 20:29:12] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:29:12] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6954616581658837376
Running compilation step : cd /tmp/ltsmin6954616581658837376;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 788 ms.
Running link step : cd /tmp/ltsmin6954616581658837376;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin6954616581658837376;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8908237558156749642.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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-27 20:29:27] [INFO ] Invariant cache hit.
[2024-05-27 20:29:27] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-27 20:29:27] [INFO ] Invariant cache hit.
[2024-05-27 20:29:28] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
[2024-05-27 20:29:28] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-27 20:29:28] [INFO ] Invariant cache hit.
[2024-05-27 20:29:28] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 683 ms. Remains : 230/230 places, 206/206 transitions.
Built C files in :
/tmp/ltsmin7441152237762297338
[2024-05-27 20:29:28] [INFO ] Computing symmetric may disable matrix : 206 transitions.
[2024-05-27 20:29:28] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:29:28] [INFO ] Computing symmetric may enable matrix : 206 transitions.
[2024-05-27 20:29:28] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:29:28] [INFO ] Computing Do-Not-Accords matrix : 206 transitions.
[2024-05-27 20:29:28] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:29:28] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7441152237762297338
Running compilation step : cd /tmp/ltsmin7441152237762297338;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 554 ms.
Running link step : cd /tmp/ltsmin7441152237762297338;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin7441152237762297338;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2848141666083350856.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 20:29:43] [INFO ] Flatten gal took : 19 ms
[2024-05-27 20:29:43] [INFO ] Flatten gal took : 18 ms
[2024-05-27 20:29:43] [INFO ] Time to serialize gal into /tmp/LTL9371844803852921771.gal : 5 ms
[2024-05-27 20:29:43] [INFO ] Time to serialize properties into /tmp/LTL9829845789701809521.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9371844803852921771.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11096010258893379135.hoa' '-atoms' '/tmp/LTL9829845789701809521.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9829845789701809521.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11096010258893379135.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 130321 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1352 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,13.5725,375384,1,0,429,1.9188e+06,24,475,5152,2.33846e+06,913
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Parking-PT-416-LTLFireability-02 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Detected timeout of ITS tools.
Treatment of property Parking-PT-416-LTLFireability-02 finished in 50796 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&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 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 25 ms. Remains 233 /271 variables (removed 38) and now considering 205/243 (removed 38) transitions.
// Phase 1: matrix 205 rows 233 cols
[2024-05-27 20:29:58] [INFO ] Computed 56 invariants in 1 ms
[2024-05-27 20:29:58] [INFO ] Implicit Places using invariants in 157 ms returned [96, 124, 178, 215]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 158 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 0 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 15 ms. Remains 228 /229 variables (removed 1) and now considering 204/205 (removed 1) transitions.
// Phase 1: matrix 204 rows 228 cols
[2024-05-27 20:29:58] [INFO ] Computed 52 invariants in 2 ms
[2024-05-27 20:29:58] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-27 20:29:58] [INFO ] Invariant cache hit.
[2024-05-27 20:29:59] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 466 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 666 ms. Remains : 228/271 places, 204/243 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Parking-PT-416-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (NEQ s181 1) (NEQ s222 1)), p1:(OR (EQ s85 0) (EQ s104 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1375 reset in 419 ms.
Product exploration explored 100000 steps with 1380 reset in 452 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 137 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 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 356 steps, including 4 resets, run visited all 2 properties in 5 ms. (steps per millisecond=71 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 182 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 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 106 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 7 ms. Remains 228 /228 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2024-05-27 20:30:00] [INFO ] Invariant cache hit.
[2024-05-27 20:30:01] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-05-27 20:30:01] [INFO ] Invariant cache hit.
[2024-05-27 20:30:01] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
[2024-05-27 20:30:01] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-27 20:30:01] [INFO ] Invariant cache hit.
[2024-05-27 20:30:01] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 667 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 123 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)]
Finished random walk after 139 steps, including 1 resets, run visited all 2 properties in 2 ms. (steps per millisecond=69 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 184 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 320 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 1376 reset in 332 ms.
Product exploration explored 100000 steps with 1381 reset in 371 ms.
Built C files in :
/tmp/ltsmin16824973937334275045
[2024-05-27 20:30:03] [INFO ] Computing symmetric may disable matrix : 204 transitions.
[2024-05-27 20:30:03] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:30:03] [INFO ] Computing symmetric may enable matrix : 204 transitions.
[2024-05-27 20:30:03] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:30:03] [INFO ] Computing Do-Not-Accords matrix : 204 transitions.
[2024-05-27 20:30:03] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:30:03] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16824973937334275045
Running compilation step : cd /tmp/ltsmin16824973937334275045;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 551 ms.
Running link step : cd /tmp/ltsmin16824973937334275045;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin16824973937334275045;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10641563207076922944.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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 8 ms. Remains 228 /228 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2024-05-27 20:30:18] [INFO ] Invariant cache hit.
[2024-05-27 20:30:18] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-27 20:30:18] [INFO ] Invariant cache hit.
[2024-05-27 20:30:18] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
[2024-05-27 20:30:18] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-27 20:30:18] [INFO ] Invariant cache hit.
[2024-05-27 20:30:19] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 676 ms. Remains : 228/228 places, 204/204 transitions.
Built C files in :
/tmp/ltsmin11466464693886855092
[2024-05-27 20:30:19] [INFO ] Computing symmetric may disable matrix : 204 transitions.
[2024-05-27 20:30:19] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:30:19] [INFO ] Computing symmetric may enable matrix : 204 transitions.
[2024-05-27 20:30:19] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:30:19] [INFO ] Computing Do-Not-Accords matrix : 204 transitions.
[2024-05-27 20:30:19] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:30:19] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11466464693886855092
Running compilation step : cd /tmp/ltsmin11466464693886855092;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 528 ms.
Running link step : cd /tmp/ltsmin11466464693886855092;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin11466464693886855092;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18245995987191703214.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 20:30:34] [INFO ] Flatten gal took : 15 ms
[2024-05-27 20:30:34] [INFO ] Flatten gal took : 14 ms
[2024-05-27 20:30:34] [INFO ] Time to serialize gal into /tmp/LTL9541865878979804334.gal : 4 ms
[2024-05-27 20:30:34] [INFO ] Time to serialize properties into /tmp/LTL1805880368471558361.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9541865878979804334.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8766439886751493368.hoa' '-atoms' '/tmp/LTL1805880368471558361.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL1805880368471558361.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8766439886751493368.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 130321 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
432 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,4.34971,133388,1,0,90,678915,30,102,5422,565974,193
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Parking-PT-416-LTLFireability-03 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Parking-PT-416-LTLFireability-03 finished in 40848 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 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-27 20:30:39] [INFO ] Computed 56 invariants in 3 ms
[2024-05-27 20:30:39] [INFO ] Implicit Places using invariants in 206 ms returned [107, 203, 249]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 207 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-27 20:30:39] [INFO ] Computed 53 invariants in 2 ms
[2024-05-27 20:30:39] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-27 20:30:39] [INFO ] Invariant cache hit.
[2024-05-27 20:30:40] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-27 20:30:40] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 587 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 806 ms. Remains : 263/271 places, 238/243 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-416-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s140 1) (EQ s141 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1013 ms.
Product exploration explored 100000 steps with 50000 reset in 1048 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 26 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 2989 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(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 5 ms. Remains 269 /271 variables (removed 2) and now considering 241/243 (removed 2) transitions.
// Phase 1: matrix 241 rows 269 cols
[2024-05-27 20:30:42] [INFO ] Computed 56 invariants in 2 ms
[2024-05-27 20:30:42] [INFO ] Implicit Places using invariants in 195 ms returned [107, 142, 250]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 196 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 5 ms. Remains 263 /266 variables (removed 3) and now considering 238/241 (removed 3) transitions.
// Phase 1: matrix 238 rows 263 cols
[2024-05-27 20:30:42] [INFO ] Computed 53 invariants in 2 ms
[2024-05-27 20:30:42] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-05-27 20:30:42] [INFO ] Invariant cache hit.
[2024-05-27 20:30:43] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-27 20:30:43] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 611 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 818 ms. Remains : 263/271 places, 238/243 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-416-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s178 1) (EQ s200 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 71 steps with 0 reset in 0 ms.
FORMULA Parking-PT-416-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-05 finished in 937 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 3 out of 271 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 271/271 places, 243/243 transitions.
Drop transitions 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 34 ms. Remains 235 /271 variables (removed 36) and now considering 247/243 (removed -4) transitions.
// Phase 1: matrix 247 rows 235 cols
[2024-05-27 20:30:43] [INFO ] Computed 56 invariants in 1 ms
[2024-05-27 20:30:43] [INFO ] Implicit Places using invariants in 189 ms returned [96, 124, 178, 217]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 191 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 21 ms. Remains 230 /231 variables (removed 1) and now considering 262/247 (removed -15) transitions.
// Phase 1: matrix 262 rows 230 cols
[2024-05-27 20:30:43] [INFO ] Computed 52 invariants in 1 ms
[2024-05-27 20:30:43] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-27 20:30:43] [INFO ] Invariant cache hit.
[2024-05-27 20:30:44] [INFO ] State equation strengthened by 123 read => feed constraints.
[2024-05-27 20:30:44] [INFO ] Implicit Places using invariants and state equation in 476 ms returned []
Implicit Place search using SMT with State Equation took 655 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 903 ms. Remains : 230/271 places, 262/243 transitions.
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-416-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s209 1), p1:(OR (EQ s149 1) (EQ s137 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 77 steps with 0 reset in 1 ms.
FORMULA Parking-PT-416-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-06 finished in 955 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 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 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 1 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 22 ms. Remains 234 /271 variables (removed 37) and now considering 206/243 (removed 37) transitions.
// Phase 1: matrix 206 rows 234 cols
[2024-05-27 20:30:44] [INFO ] Computed 56 invariants in 1 ms
[2024-05-27 20:30:44] [INFO ] Implicit Places using invariants in 151 ms returned [96, 125, 179, 216]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 153 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-27 20:30:44] [INFO ] Computed 52 invariants in 1 ms
[2024-05-27 20:30:44] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-05-27 20:30:44] [INFO ] Invariant cache hit.
[2024-05-27 20:30:44] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 443 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 628 ms. Remains : 229/271 places, 205/243 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-416-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s98 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1334 reset in 313 ms.
Product exploration explored 100000 steps with 1344 reset in 365 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 75 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 69 ms :[(NOT p0), (NOT p0)]
Finished random walk after 198 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=99 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 100 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 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 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-27 20:30:46] [INFO ] Invariant cache hit.
[2024-05-27 20:30:46] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-05-27 20:30:46] [INFO ] Invariant cache hit.
[2024-05-27 20:30:46] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
[2024-05-27 20:30:46] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-27 20:30:46] [INFO ] Invariant cache hit.
[2024-05-27 20:30:46] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 669 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 73 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Finished random walk after 130 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=130 )
Parikh walk visited 0 properties in 0 ms.
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 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1337 reset in 316 ms.
Product exploration explored 100000 steps with 1331 reset in 366 ms.
Built C files in :
/tmp/ltsmin16234225531572515380
[2024-05-27 20:30:48] [INFO ] Computing symmetric may disable matrix : 205 transitions.
[2024-05-27 20:30:48] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:30:48] [INFO ] Computing symmetric may enable matrix : 205 transitions.
[2024-05-27 20:30:48] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:30:48] [INFO ] Computing Do-Not-Accords matrix : 205 transitions.
[2024-05-27 20:30:48] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:30:48] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16234225531572515380
Running compilation step : cd /tmp/ltsmin16234225531572515380;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 579 ms.
Running link step : cd /tmp/ltsmin16234225531572515380;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin16234225531572515380;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2700881798291167788.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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 5 ms. Remains 229 /229 variables (removed 0) and now considering 205/205 (removed 0) transitions.
[2024-05-27 20:31:03] [INFO ] Invariant cache hit.
[2024-05-27 20:31:03] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-27 20:31:03] [INFO ] Invariant cache hit.
[2024-05-27 20:31:03] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 448 ms to find 0 implicit places.
[2024-05-27 20:31:03] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-27 20:31:03] [INFO ] Invariant cache hit.
[2024-05-27 20:31:03] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 627 ms. Remains : 229/229 places, 205/205 transitions.
Built C files in :
/tmp/ltsmin11459220946431048574
[2024-05-27 20:31:03] [INFO ] Computing symmetric may disable matrix : 205 transitions.
[2024-05-27 20:31:03] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:31:03] [INFO ] Computing symmetric may enable matrix : 205 transitions.
[2024-05-27 20:31:03] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:31:03] [INFO ] Computing Do-Not-Accords matrix : 205 transitions.
[2024-05-27 20:31:03] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:31:03] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11459220946431048574
Running compilation step : cd /tmp/ltsmin11459220946431048574;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 556 ms.
Running link step : cd /tmp/ltsmin11459220946431048574;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin11459220946431048574;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8608167872789459998.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 20:31:18] [INFO ] Flatten gal took : 15 ms
[2024-05-27 20:31:18] [INFO ] Flatten gal took : 16 ms
[2024-05-27 20:31:18] [INFO ] Time to serialize gal into /tmp/LTL16781623765485578942.gal : 3 ms
[2024-05-27 20:31:18] [INFO ] Time to serialize properties into /tmp/LTL2347875567711970288.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16781623765485578942.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17902465505604575943.hoa' '-atoms' '/tmp/LTL2347875567711970288.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL2347875567711970288.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17902465505604575943.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 130321 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
188 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.90407,66932,1,0,9,346818,24,5,5431,75180,22
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Parking-PT-416-LTLFireability-07 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Parking-PT-416-LTLFireability-07 finished in 36630 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!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 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 1 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 25 ms. Remains 239 /271 variables (removed 32) and now considering 251/243 (removed -8) transitions.
// Phase 1: matrix 251 rows 239 cols
[2024-05-27 20:31:21] [INFO ] Computed 56 invariants in 2 ms
[2024-05-27 20:31:21] [INFO ] Implicit Places using invariants in 162 ms returned [129, 182]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 163 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 0 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 15 ms. Remains 235 /237 variables (removed 2) and now considering 265/251 (removed -14) transitions.
// Phase 1: matrix 265 rows 235 cols
[2024-05-27 20:31:21] [INFO ] Computed 54 invariants in 2 ms
[2024-05-27 20:31:21] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-27 20:31:21] [INFO ] Invariant cache hit.
[2024-05-27 20:31:21] [INFO ] State equation strengthened by 124 read => feed constraints.
[2024-05-27 20:31:21] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 602 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 806 ms. Remains : 235/271 places, 265/243 transitions.
Stuttering acceptance computed with spot in 168 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 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 0}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p2:(AND (EQ s217 1) (EQ s232 1)), p0:(AND (EQ s99 1) (EQ s128 1)), p1:(EQ s57 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Parking-PT-416-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-08 finished in 1007 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(!p0)||(!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 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-27 20:31:22] [INFO ] Computed 56 invariants in 1 ms
[2024-05-27 20:31:22] [INFO ] Implicit Places using invariants in 182 ms returned [107, 142, 203, 249]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 183 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-27 20:31:22] [INFO ] Computed 52 invariants in 1 ms
[2024-05-27 20:31:22] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-05-27 20:31:22] [INFO ] Invariant cache hit.
[2024-05-27 20:31:22] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-27 20:31:22] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 516 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 712 ms. Remains : 261/271 places, 237/243 transitions.
Stuttering acceptance computed with spot in 175 ms :[p0, (AND p0 (NOT p1)), p0, p0, p0]
Running random walk in product with property : Parking-PT-416-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=p0, acceptance={0, 1} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(AND (EQ s117 1) (EQ s142 1)), p1:(EQ s57 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1286 reset in 352 ms.
Product exploration explored 100000 steps with 1286 reset in 409 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)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 72 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 32 ms :[(AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 127 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-27 20:31:23] [INFO ] Invariant cache hit.
[2024-05-27 20:31:23] [INFO ] [Real]Absence check using 52 positive place invariants in 16 ms returned sat
[2024-05-27 20:31:24] [INFO ] After 271ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 20:31:24] [INFO ] [Nat]Absence check using 52 positive place invariants in 15 ms returned sat
[2024-05-27 20:31:24] [INFO ] After 125ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 20:31:24] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-27 20:31:24] [INFO ] After 27ms SMT Verify possible using 60 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-27 20:31:24] [INFO ] After 53ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-27 20:31:24] [INFO ] After 274ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 54 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=54 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (AND p0 p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 158 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 33 ms :[(AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 34 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 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 19 ms. Remains 230 /261 variables (removed 31) and now considering 226/237 (removed 11) transitions.
// Phase 1: matrix 226 rows 230 cols
[2024-05-27 20:31:24] [INFO ] Computed 52 invariants in 1 ms
[2024-05-27 20:31:24] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-27 20:31:24] [INFO ] Invariant cache hit.
[2024-05-27 20:31:25] [INFO ] State equation strengthened by 98 read => feed constraints.
[2024-05-27 20:31:25] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
[2024-05-27 20:31:25] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-27 20:31:25] [INFO ] Invariant cache hit.
[2024-05-27 20:31:25] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
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 759 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 (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 104 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 35 ms :[(AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 131 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-27 20:31:25] [INFO ] Invariant cache hit.
[2024-05-27 20:31:25] [INFO ] [Real]Absence check using 52 positive place invariants in 14 ms returned sat
[2024-05-27 20:31:25] [INFO ] After 186ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 20:31:25] [INFO ] [Nat]Absence check using 52 positive place invariants in 15 ms returned sat
[2024-05-27 20:31:26] [INFO ] After 112ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 20:31:26] [INFO ] State equation strengthened by 98 read => feed constraints.
[2024-05-27 20:31:26] [INFO ] After 33ms SMT Verify possible using 98 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-27 20:31:26] [INFO ] After 58ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2024-05-27 20:31:26] [INFO ] After 269ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 226/226 transitions.
Free-agglomeration rule applied 62 times.
Iterating global reduction 0 with 62 rules applied. Total rules applied 62 place count 230 transition count 164
Reduce places removed 62 places and 0 transitions.
Graph (complete) has 379 edges and 168 vertex of which 92 are kept as prefixes of interest. Removing 76 places using SCC suffix rule.1 ms
Discarding 76 places :
Also discarding 60 output transitions
Drop transitions removed 60 transitions
Iterating post reduction 0 with 63 rules applied. Total rules applied 125 place count 92 transition count 104
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 133 place count 92 transition count 96
Applied a total of 133 rules in 19 ms. Remains 92 /230 variables (removed 138) and now considering 96/226 (removed 130) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 92/230 places, 96/226 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Finished Best-First random walk after 82 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=82 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (AND p0 p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 221 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 38 ms :[(AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 41 ms :[(AND p0 (NOT p1))]
Product exploration explored 100000 steps with 1319 reset in 364 ms.
Product exploration explored 100000 steps with 1321 reset in 392 ms.
Built C files in :
/tmp/ltsmin9473128085459178785
[2024-05-27 20:31:27] [INFO ] Computing symmetric may disable matrix : 226 transitions.
[2024-05-27 20:31:27] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:31:27] [INFO ] Computing symmetric may enable matrix : 226 transitions.
[2024-05-27 20:31:27] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:31:27] [INFO ] Computing Do-Not-Accords matrix : 226 transitions.
[2024-05-27 20:31:27] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:31:27] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9473128085459178785
Running compilation step : cd /tmp/ltsmin9473128085459178785;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 613 ms.
Running link step : cd /tmp/ltsmin9473128085459178785;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin9473128085459178785;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10959666764620879683.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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-27 20:31:42] [INFO ] Invariant cache hit.
[2024-05-27 20:31:42] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-05-27 20:31:42] [INFO ] Invariant cache hit.
[2024-05-27 20:31:42] [INFO ] State equation strengthened by 98 read => feed constraints.
[2024-05-27 20:31:43] [INFO ] Implicit Places using invariants and state equation in 420 ms returned []
Implicit Place search using SMT with State Equation took 603 ms to find 0 implicit places.
[2024-05-27 20:31:43] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-27 20:31:43] [INFO ] Invariant cache hit.
[2024-05-27 20:31:43] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 787 ms. Remains : 230/230 places, 226/226 transitions.
Built C files in :
/tmp/ltsmin9848919869741025563
[2024-05-27 20:31:43] [INFO ] Computing symmetric may disable matrix : 226 transitions.
[2024-05-27 20:31:43] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:31:43] [INFO ] Computing symmetric may enable matrix : 226 transitions.
[2024-05-27 20:31:43] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:31:43] [INFO ] Computing Do-Not-Accords matrix : 226 transitions.
[2024-05-27 20:31:43] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:31:43] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9848919869741025563
Running compilation step : cd /tmp/ltsmin9848919869741025563;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 612 ms.
Running link step : cd /tmp/ltsmin9848919869741025563;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin9848919869741025563;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18171294710640371295.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 20:31:58] [INFO ] Flatten gal took : 21 ms
[2024-05-27 20:31:58] [INFO ] Flatten gal took : 20 ms
[2024-05-27 20:31:58] [INFO ] Time to serialize gal into /tmp/LTL16238367992432282737.gal : 2 ms
[2024-05-27 20:31:58] [INFO ] Time to serialize properties into /tmp/LTL556565199612836060.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16238367992432282737.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9866674207550702628.hoa' '-atoms' '/tmp/LTL556565199612836060.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL556565199612836060.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9866674207550702628.hoa
Reverse transition relation is NOT exact ! Due to transitions t40, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...166
Computing Next relation with stutter on 130321 deadlock states
Detected timeout of ITS tools.
[2024-05-27 20:32:13] [INFO ] Flatten gal took : 17 ms
[2024-05-27 20:32:13] [INFO ] Flatten gal took : 17 ms
[2024-05-27 20:32:13] [INFO ] Time to serialize gal into /tmp/LTL4221294554977718290.gal : 2 ms
[2024-05-27 20:32:13] [INFO ] Time to serialize properties into /tmp/LTL17004282811694803429.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4221294554977718290.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17004282811694803429.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(F((G("((p132!=1)||(p164!=1))"))||((F(G("(p61==1)")))&&("((p132!=1)||(p164!=1))")))))))
Formula 0 simplified : XXG(F!"((p132!=1)||(p164!=1))" & (!"((p132!=1)||(p164!=1))" | GF!"(p61==1)"))
Reverse transition relation is NOT exact ! Due to transitions t40, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...166
Computing Next relation with stutter on 130321 deadlock states
Detected timeout of ITS tools.
[2024-05-27 20:32:28] [INFO ] Flatten gal took : 16 ms
[2024-05-27 20:32:28] [INFO ] Applying decomposition
[2024-05-27 20:32:28] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph499844829542182090.txt' '-o' '/tmp/graph499844829542182090.bin' '-w' '/tmp/graph499844829542182090.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph499844829542182090.bin' '-l' '-1' '-v' '-w' '/tmp/graph499844829542182090.weights' '-q' '0' '-e' '0.001'
[2024-05-27 20:32:28] [INFO ] Decomposing Gal with order
[2024-05-27 20:32:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 20:32:28] [INFO ] Removed a total of 304 redundant transitions.
[2024-05-27 20:32:28] [INFO ] Flatten gal took : 95 ms
[2024-05-27 20:32:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 21 ms.
[2024-05-27 20:32:28] [INFO ] Time to serialize gal into /tmp/LTL12070584526544718129.gal : 9 ms
[2024-05-27 20:32:28] [INFO ] Time to serialize properties into /tmp/LTL17968026608118313149.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12070584526544718129.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17968026608118313149.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X(F((G("((i4.u46.p132!=1)||(i4.u46.p164!=1))"))||((F(G("(i2.u22.p61==1)")))&&("((i4.u46.p132!=1)||(i4.u46.p164!=1))")))))))
Formula 0 simplified : XXG(F!"((i4.u46.p132!=1)||(i4.u46.p164!=1))" & (!"((i4.u46.p132!=1)||(i4.u46.p164!=1))" | GF!"(i2.u22.p61==1)"))
Reverse transition relation is NOT exact ! Due to transitions i4.u46.t40, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/t...173
Computing Next relation with stutter on 130321 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
526 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.31238,158160,1,0,388594,3202,3839,395384,485,15120,197866
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Parking-PT-416-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property Parking-PT-416-LTLFireability-09 finished in 73041 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(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 7 ms. Remains 268 /271 variables (removed 3) and now considering 240/243 (removed 3) transitions.
// Phase 1: matrix 240 rows 268 cols
[2024-05-27 20:32:35] [INFO ] Computed 56 invariants in 1 ms
[2024-05-27 20:32:35] [INFO ] Implicit Places using invariants in 197 ms returned [107, 142, 203, 249]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 199 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-27 20:32:35] [INFO ] Computed 52 invariants in 1 ms
[2024-05-27 20:32:35] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-05-27 20:32:35] [INFO ] Invariant cache hit.
[2024-05-27 20:32:35] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-27 20:32:35] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 575 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 787 ms. Remains : 261/271 places, 237/243 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-416-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s56 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Parking-PT-416-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-10 finished in 931 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(!p0)&&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 4 ms. Remains 268 /271 variables (removed 3) and now considering 240/243 (removed 3) transitions.
// Phase 1: matrix 240 rows 268 cols
[2024-05-27 20:32:35] [INFO ] Computed 56 invariants in 1 ms
[2024-05-27 20:32:36] [INFO ] Implicit Places using invariants in 162 ms returned [107, 142, 203, 249]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 163 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 4 ms. Remains 261 /264 variables (removed 3) and now considering 237/240 (removed 3) transitions.
// Phase 1: matrix 237 rows 261 cols
[2024-05-27 20:32:36] [INFO ] Computed 52 invariants in 1 ms
[2024-05-27 20:32:36] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-27 20:32:36] [INFO ] Invariant cache hit.
[2024-05-27 20:32:36] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-27 20:32:36] [INFO ] Implicit Places using invariants and state equation in 370 ms returned []
Implicit Place search using SMT with State Equation took 530 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 702 ms. Remains : 261/271 places, 237/243 transitions.
Stuttering acceptance computed with spot in 184 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 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s114 1) (EQ s142 1)), p2:(NEQ s115 1), p0:(NEQ s233 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 946 ms.
Product exploration explored 100000 steps with 50000 reset in 967 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 (NOT (AND p0 p1 p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 20 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 2848 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 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 4 ms. Remains 268 /271 variables (removed 3) and now considering 240/243 (removed 3) transitions.
// Phase 1: matrix 240 rows 268 cols
[2024-05-27 20:32:38] [INFO ] Computed 56 invariants in 4 ms
[2024-05-27 20:32:38] [INFO ] Implicit Places using invariants in 171 ms returned [107, 142, 203, 249]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 172 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 4 ms. Remains 261 /264 variables (removed 3) and now considering 237/240 (removed 3) transitions.
// Phase 1: matrix 237 rows 261 cols
[2024-05-27 20:32:38] [INFO ] Computed 52 invariants in 1 ms
[2024-05-27 20:32:39] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-27 20:32:39] [INFO ] Invariant cache hit.
[2024-05-27 20:32:39] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-27 20:32:39] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 530 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 712 ms. Remains : 261/271 places, 237/243 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : Parking-PT-416-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (EQ s105 1) (EQ s141 1)), p0:(AND (EQ s148 1) (EQ s166 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Parking-PT-416-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-12 finished in 815 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(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-27 20:32:39] [INFO ] Computed 56 invariants in 1 ms
[2024-05-27 20:32:39] [INFO ] Implicit Places using invariants in 161 ms returned [107, 142, 203, 249]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 163 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-27 20:32:39] [INFO ] Computed 52 invariants in 0 ms
[2024-05-27 20:32:39] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-27 20:32:39] [INFO ] Invariant cache hit.
[2024-05-27 20:32:40] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-27 20:32:40] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 533 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 706 ms. Remains : 261/271 places, 237/243 transitions.
Stuttering acceptance computed with spot in 155 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 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND p0 p1), acceptance={} source=0 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=p2, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s169 1) (EQ s201 1)), p1:(EQ s121 1), p2:(EQ s239 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 88 steps with 0 reset in 1 ms.
FORMULA Parking-PT-416-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-13 finished in 878 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((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 5 ms. Remains 269 /271 variables (removed 2) and now considering 241/243 (removed 2) transitions.
// Phase 1: matrix 241 rows 269 cols
[2024-05-27 20:32:40] [INFO ] Computed 56 invariants in 1 ms
[2024-05-27 20:32:40] [INFO ] Implicit Places using invariants in 170 ms returned [107, 142, 203, 250]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 171 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 4 ms. Remains 262 /265 variables (removed 3) and now considering 238/241 (removed 3) transitions.
// Phase 1: matrix 238 rows 262 cols
[2024-05-27 20:32:40] [INFO ] Computed 52 invariants in 1 ms
[2024-05-27 20:32:40] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-27 20:32:40] [INFO ] Invariant cache hit.
[2024-05-27 20:32:41] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-27 20:32:41] [INFO ] Implicit Places using invariants and state equation in 424 ms returned []
Implicit Place search using SMT with State Equation took 581 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 762 ms. Remains : 262/271 places, 238/243 transitions.
Stuttering acceptance computed with spot in 248 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 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p3) p2), acceptance={} source=1 dest: 0}, { cond=(OR p3 (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p3) p2), acceptance={} source=2 dest: 0}, { cond=(OR (AND p3 (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={} source=2 dest: 3}, { cond=(OR (AND p3 p1) (AND (NOT p2) p1)), acceptance={} source=2 dest: 4}], [{ cond=(OR (AND (NOT p3) p2) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(OR (AND p3 p0) (AND (NOT p2) p0)), acceptance={} source=3 dest: 3}], [{ cond=(OR (AND (NOT p3) p2) (AND (NOT p1) (NOT p0))), acceptance={} source=4 dest: 0}, { cond=(OR (AND p3 (NOT p1) p0) (AND (NOT p2) (NOT p1) p0)), acceptance={} source=4 dest: 3}, { cond=(OR (AND p3 p1 p0) (AND (NOT p2) p1 p0)), acceptance={} source=4 dest: 4}, { cond=(OR (AND p3 p1 (NOT p0)) (AND (NOT p2) p1 (NOT p0))), acceptance={} source=4 dest: 5}], [{ cond=(OR (AND (NOT p3) p2) (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(OR (AND p3 p1) (AND (NOT p2) p1)), acceptance={} source=5 dest: 5}]], initial=1, aps=[p3:(AND (NEQ s121 1) (NOT (AND (EQ s179 1) (EQ s202 1)))), p2:(EQ s121 1), p1:(OR (EQ s179 0) (EQ s202 0)), p0:(EQ s200 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 14736 steps with 189 reset in 100 ms.
FORMULA Parking-PT-416-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-14 finished in 1134 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(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 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 36 ms. Remains 235 /271 variables (removed 36) and now considering 207/243 (removed 36) transitions.
// Phase 1: matrix 207 rows 235 cols
[2024-05-27 20:32:41] [INFO ] Computed 56 invariants in 1 ms
[2024-05-27 20:32:41] [INFO ] Implicit Places using invariants in 197 ms returned [96, 125, 180, 217]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 199 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 6 ms. Remains 230 /231 variables (removed 1) and now considering 206/207 (removed 1) transitions.
// Phase 1: matrix 206 rows 230 cols
[2024-05-27 20:32:41] [INFO ] Computed 52 invariants in 1 ms
[2024-05-27 20:32:42] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-27 20:32:42] [INFO ] Invariant cache hit.
[2024-05-27 20:32:42] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 398 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 640 ms. Remains : 230/271 places, 206/243 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-416-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s125 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 215 steps with 3 reset in 1 ms.
FORMULA Parking-PT-416-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-416-LTLFireability-15 finished in 695 ms.
All properties solved by simple procedures.
Total runtime 219562 ms.

BK_STOP 1716841963383

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is 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 r285-smll-171654421800048"
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 ;