Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r294-smll-165463873100564.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is AutonomousCar-PT-10b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463873100564
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.3K Jun 7 15:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Jun 7 15:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Jun 7 15:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Jun 7 15:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Jun 3 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 3 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 3 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 3 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 3 16:02 NewModel
-rw-r--r-- 1 mcc users 12K Jun 7 15:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Jun 7 15:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Jun 7 15:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Jun 7 15:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 3 16:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 3 16:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 3 16:02 equiv_col
-rw-r--r-- 1 mcc users 4 Jun 3 16:02 instance
-rw-r--r-- 1 mcc users 6 Jun 3 16:02 iscolored
-rw-r--r-- 1 mcc users 1.6M Jun 3 16:02 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 AutonomousCar-PT-10b-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-10b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654935419089

Running Version 202205111006
[2022-06-11 08:17:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-11 08:17:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-11 08:17:01] [INFO ] Load time of PNML (sax parser for PT used): 565 ms
[2022-06-11 08:17:01] [INFO ] Transformed 425 places.
[2022-06-11 08:17:01] [INFO ] Transformed 2252 transitions.
[2022-06-11 08:17:01] [INFO ] Found NUPN structural information;
[2022-06-11 08:17:01] [INFO ] Parsed PT model containing 425 places and 2252 transitions in 800 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Support contains 42 out of 425 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 425/425 places, 2252/2252 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 64 place count 361 transition count 2188
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 361 transition count 2188
Ensure Unique test removed 400 transitions
Reduce isomorphic transitions removed 400 transitions.
Iterating post reduction 0 with 400 rules applied. Total rules applied 528 place count 361 transition count 1788
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 541 place count 348 transition count 1775
Iterating global reduction 1 with 13 rules applied. Total rules applied 554 place count 348 transition count 1775
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 555 place count 347 transition count 1774
Iterating global reduction 1 with 1 rules applied. Total rules applied 556 place count 347 transition count 1774
Applied a total of 556 rules in 181 ms. Remains 347 /425 variables (removed 78) and now considering 1774/2252 (removed 478) transitions.
// Phase 1: matrix 1774 rows 347 cols
[2022-06-11 08:17:02] [INFO ] Computed 15 place invariants in 55 ms
[2022-06-11 08:17:03] [INFO ] Implicit Places using invariants in 462 ms returned []
// Phase 1: matrix 1774 rows 347 cols
[2022-06-11 08:17:03] [INFO ] Computed 15 place invariants in 27 ms
[2022-06-11 08:17:04] [INFO ] Implicit Places using invariants and state equation in 1047 ms returned []
Implicit Place search using SMT with State Equation took 1621 ms to find 0 implicit places.
// Phase 1: matrix 1774 rows 347 cols
[2022-06-11 08:17:04] [INFO ] Computed 15 place invariants in 27 ms
[2022-06-11 08:17:05] [INFO ] Dead Transitions using invariants and state equation in 1407 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 347/425 places, 1774/2252 transitions.
Finished structural reductions, in 1 iterations. Remains : 347/425 places, 1774/2252 transitions.
Support contains 42 out of 347 places after structural reductions.
[2022-06-11 08:17:06] [INFO ] Flatten gal took : 533 ms
[2022-06-11 08:17:06] [INFO ] Flatten gal took : 329 ms
[2022-06-11 08:17:07] [INFO ] Input system was already deterministic with 1774 transitions.
Support contains 41 out of 347 places (down from 42) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 76 resets, run finished after 1025 ms. (steps per millisecond=9 ) properties (out of 35) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 30) seen :0
Running SMT prover for 30 properties.
// Phase 1: matrix 1774 rows 347 cols
[2022-06-11 08:17:09] [INFO ] Computed 15 place invariants in 14 ms
[2022-06-11 08:17:10] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2022-06-11 08:17:11] [INFO ] After 1159ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5 real:25
[2022-06-11 08:17:12] [INFO ] After 1724ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :5 real:25
Attempting to minimize the solution found.
Minimization took 314 ms.
[2022-06-11 08:17:12] [INFO ] After 2626ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :5 real:25
[2022-06-11 08:17:13] [INFO ] [Nat]Absence check using 15 positive place invariants in 12 ms returned sat
[2022-06-11 08:17:16] [INFO ] After 2528ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :29
[2022-06-11 08:17:19] [INFO ] Deduced a trap composed of 31 places in 844 ms of which 3 ms to minimize.
[2022-06-11 08:17:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 984 ms
[2022-06-11 08:17:20] [INFO ] After 6985ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :29
Attempting to minimize the solution found.
Minimization took 1601 ms.
[2022-06-11 08:17:22] [INFO ] After 9277ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :29
Fused 30 Parikh solutions to 28 different solutions.
Parikh walk visited 0 properties in 835 ms.
Support contains 36 out of 347 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Graph (trivial) has 282 edges and 347 vertex of which 4 / 347 are part of one of the 2 SCC in 8 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1862 edges and 345 vertex of which 343 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.37 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 124 transitions
Trivial Post-agglo rules discarded 124 transitions
Performed 124 trivial Post agglomeration. Transition count delta: 124
Iterating post reduction 0 with 126 rules applied. Total rules applied 128 place count 343 transition count 1644
Reduce places removed 124 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 1 with 183 rules applied. Total rules applied 311 place count 219 transition count 1585
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 346 place count 184 transition count 1585
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 346 place count 184 transition count 1580
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 356 place count 179 transition count 1580
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 2 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 474 place count 120 transition count 1521
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 475 place count 120 transition count 1520
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 483 place count 112 transition count 1449
Iterating global reduction 4 with 8 rules applied. Total rules applied 491 place count 112 transition count 1449
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 498 place count 112 transition count 1442
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 500 place count 111 transition count 1441
Free-agglomeration rule applied 23 times.
Iterating global reduction 5 with 23 rules applied. Total rules applied 523 place count 111 transition count 1418
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 5 with 23 rules applied. Total rules applied 546 place count 88 transition count 1418
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 555 place count 88 transition count 1418
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 556 place count 87 transition count 1417
Applied a total of 556 rules in 900 ms. Remains 87 /347 variables (removed 260) and now considering 1417/1774 (removed 357) transitions.
Finished structural reductions, in 1 iterations. Remains : 87/347 places, 1417/1774 transitions.
Incomplete random walk after 10000 steps, including 90 resets, run finished after 838 ms. (steps per millisecond=11 ) properties (out of 29) seen :4
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Running SMT prover for 23 properties.
// Phase 1: matrix 1417 rows 87 cols
[2022-06-11 08:17:24] [INFO ] Computed 15 place invariants in 12 ms
[2022-06-11 08:17:25] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2022-06-11 08:17:26] [INFO ] After 730ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5 real:18
[2022-06-11 08:17:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 08:17:26] [INFO ] After 202ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :5 real:18
[2022-06-11 08:17:27] [INFO ] After 542ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :5 real:18
Attempting to minimize the solution found.
Minimization took 198 ms.
[2022-06-11 08:17:27] [INFO ] After 1643ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :5 real:18
[2022-06-11 08:17:27] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2022-06-11 08:17:28] [INFO ] After 1504ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :23
[2022-06-11 08:17:29] [INFO ] After 862ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :23
[2022-06-11 08:17:31] [INFO ] After 2350ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :23
Attempting to minimize the solution found.
Minimization took 852 ms.
[2022-06-11 08:17:32] [INFO ] After 4933ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :23
Fused 23 Parikh solutions to 22 different solutions.
Parikh walk visited 0 properties in 295 ms.
Support contains 32 out of 87 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 87/87 places, 1417/1417 transitions.
Applied a total of 0 rules in 84 ms. Remains 87 /87 variables (removed 0) and now considering 1417/1417 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 87/87 places, 1417/1417 transitions.
Incomplete random walk after 10000 steps, including 78 resets, run finished after 715 ms. (steps per millisecond=13 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 23) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :1
Running SMT prover for 17 properties.
// Phase 1: matrix 1417 rows 87 cols
[2022-06-11 08:17:33] [INFO ] Computed 15 place invariants in 10 ms
[2022-06-11 08:17:33] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2022-06-11 08:17:34] [INFO ] After 652ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:14
[2022-06-11 08:17:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 08:17:34] [INFO ] After 116ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :3 real:14
[2022-06-11 08:17:34] [INFO ] After 317ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :3 real:14
Attempting to minimize the solution found.
Minimization took 123 ms.
[2022-06-11 08:17:35] [INFO ] After 1239ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :3 real:14
[2022-06-11 08:17:35] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2022-06-11 08:17:36] [INFO ] After 1139ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2022-06-11 08:17:37] [INFO ] After 649ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2022-06-11 08:17:38] [INFO ] After 1731ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 642 ms.
[2022-06-11 08:17:38] [INFO ] After 3681ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Parikh walk visited 0 properties in 262 ms.
Support contains 32 out of 87 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 87/87 places, 1417/1417 transitions.
Applied a total of 0 rules in 90 ms. Remains 87 /87 variables (removed 0) and now considering 1417/1417 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 87/87 places, 1417/1417 transitions.
Incomplete random walk after 10000 steps, including 98 resets, run finished after 683 ms. (steps per millisecond=14 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 292011 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :{}
Probabilistic random walk after 292011 steps, saw 44736 distinct states, run finished after 3003 ms. (steps per millisecond=97 ) properties seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 1417 rows 87 cols
[2022-06-11 08:17:42] [INFO ] Computed 15 place invariants in 19 ms
[2022-06-11 08:17:43] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2022-06-11 08:17:44] [INFO ] After 642ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:13
[2022-06-11 08:17:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 08:17:44] [INFO ] After 118ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :3 real:13
[2022-06-11 08:17:44] [INFO ] After 328ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :3 real:13
Attempting to minimize the solution found.
Minimization took 117 ms.
[2022-06-11 08:17:44] [INFO ] After 1201ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :3 real:13
[2022-06-11 08:17:44] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2022-06-11 08:17:45] [INFO ] After 1093ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2022-06-11 08:17:46] [INFO ] After 596ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :16
[2022-06-11 08:17:47] [INFO ] After 1615ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 605 ms.
[2022-06-11 08:17:48] [INFO ] After 3461ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Parikh walk visited 0 properties in 350 ms.
Support contains 32 out of 87 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 87/87 places, 1417/1417 transitions.
Applied a total of 0 rules in 81 ms. Remains 87 /87 variables (removed 0) and now considering 1417/1417 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 87/87 places, 1417/1417 transitions.
Incomplete random walk after 10000 steps, including 92 resets, run finished after 619 ms. (steps per millisecond=16 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 1417 rows 87 cols
[2022-06-11 08:17:49] [INFO ] Computed 15 place invariants in 8 ms
[2022-06-11 08:17:49] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2022-06-11 08:17:50] [INFO ] After 588ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:12
[2022-06-11 08:17:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 08:17:50] [INFO ] After 78ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :2 real:12
[2022-06-11 08:17:50] [INFO ] After 214ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:12
Attempting to minimize the solution found.
Minimization took 80 ms.
[2022-06-11 08:17:50] [INFO ] After 981ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:12
[2022-06-11 08:17:50] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2022-06-11 08:17:51] [INFO ] After 1025ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2022-06-11 08:17:52] [INFO ] After 533ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2022-06-11 08:17:53] [INFO ] After 1439ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 536 ms.
[2022-06-11 08:17:53] [INFO ] After 3143ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Parikh walk visited 0 properties in 188 ms.
Support contains 32 out of 87 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 87/87 places, 1417/1417 transitions.
Applied a total of 0 rules in 80 ms. Remains 87 /87 variables (removed 0) and now considering 1417/1417 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 87/87 places, 1417/1417 transitions.
Incomplete random walk after 10000 steps, including 95 resets, run finished after 648 ms. (steps per millisecond=15 ) properties (out of 14) seen :2
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 1417 rows 87 cols
[2022-06-11 08:17:55] [INFO ] Computed 15 place invariants in 8 ms
[2022-06-11 08:17:55] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 08:17:55] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2022-06-11 08:17:55] [INFO ] After 607ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-11 08:17:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 08:17:55] [INFO ] After 76ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-11 08:17:56] [INFO ] After 225ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 78 ms.
[2022-06-11 08:17:56] [INFO ] After 965ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 29 ms.
Support contains 15 out of 87 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 87/87 places, 1417/1417 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 81 transition count 1411
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 80 transition count 1400
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 80 transition count 1400
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 22 place count 76 transition count 1396
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 25 place count 76 transition count 1393
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 58 place count 73 transition count 1363
Applied a total of 58 rules in 235 ms. Remains 73 /87 variables (removed 14) and now considering 1363/1417 (removed 54) transitions.
Finished structural reductions, in 1 iterations. Remains : 73/87 places, 1363/1417 transitions.
Incomplete random walk after 10000 steps, including 27 resets, run finished after 422 ms. (steps per millisecond=23 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 381008 steps, run timeout after 3001 ms. (steps per millisecond=126 ) properties seen :{}
Probabilistic random walk after 381008 steps, saw 56276 distinct states, run finished after 3001 ms. (steps per millisecond=126 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1363 rows 73 cols
[2022-06-11 08:17:59] [INFO ] Computed 15 place invariants in 7 ms
[2022-06-11 08:18:00] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 08:18:00] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2022-06-11 08:18:00] [INFO ] After 556ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-11 08:18:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 08:18:00] [INFO ] After 71ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-11 08:18:00] [INFO ] After 199ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 72 ms.
[2022-06-11 08:18:00] [INFO ] After 879ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 24 ms.
Support contains 15 out of 73 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 73/73 places, 1363/1363 transitions.
Applied a total of 0 rules in 92 ms. Remains 73 /73 variables (removed 0) and now considering 1363/1363 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 73/73 places, 1363/1363 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 73/73 places, 1363/1363 transitions.
Applied a total of 0 rules in 90 ms. Remains 73 /73 variables (removed 0) and now considering 1363/1363 (removed 0) transitions.
// Phase 1: matrix 1363 rows 73 cols
[2022-06-11 08:18:01] [INFO ] Computed 15 place invariants in 7 ms
[2022-06-11 08:18:01] [INFO ] Implicit Places using invariants in 398 ms returned []
// Phase 1: matrix 1363 rows 73 cols
[2022-06-11 08:18:01] [INFO ] Computed 15 place invariants in 7 ms
[2022-06-11 08:18:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 08:18:02] [INFO ] Implicit Places using invariants and state equation in 968 ms returned [68, 72]
Discarding 2 places :
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 1376 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 71/73 places, 1362/1363 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 70 transition count 1361
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 70 transition count 1360
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 69 transition count 1360
Applied a total of 4 rules in 190 ms. Remains 69 /71 variables (removed 2) and now considering 1360/1362 (removed 2) transitions.
// Phase 1: matrix 1360 rows 69 cols
[2022-06-11 08:18:02] [INFO ] Computed 13 place invariants in 7 ms
[2022-06-11 08:18:03] [INFO ] Implicit Places using invariants in 373 ms returned []
// Phase 1: matrix 1360 rows 69 cols
[2022-06-11 08:18:03] [INFO ] Computed 13 place invariants in 7 ms
[2022-06-11 08:18:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-11 08:18:03] [INFO ] Implicit Places using invariants and state equation in 907 ms returned []
Implicit Place search using SMT with State Equation took 1283 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 69/73 places, 1360/1363 transitions.
Finished structural reductions, in 2 iterations. Remains : 69/73 places, 1360/1363 transitions.
Incomplete random walk after 10000 steps, including 9 resets, run finished after 446 ms. (steps per millisecond=22 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 431183 steps, run timeout after 3001 ms. (steps per millisecond=143 ) properties seen :{}
Probabilistic random walk after 431183 steps, saw 60627 distinct states, run finished after 3001 ms. (steps per millisecond=143 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1360 rows 69 cols
[2022-06-11 08:18:07] [INFO ] Computed 13 place invariants in 6 ms
[2022-06-11 08:18:07] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 08:18:07] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2022-06-11 08:18:08] [INFO ] After 537ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-11 08:18:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-11 08:18:08] [INFO ] After 71ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-11 08:18:08] [INFO ] After 199ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 71 ms.
[2022-06-11 08:18:08] [INFO ] After 853ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 22 ms.
Support contains 15 out of 69 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 69/69 places, 1360/1360 transitions.
Applied a total of 0 rules in 86 ms. Remains 69 /69 variables (removed 0) and now considering 1360/1360 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 69/69 places, 1360/1360 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 69/69 places, 1360/1360 transitions.
Applied a total of 0 rules in 81 ms. Remains 69 /69 variables (removed 0) and now considering 1360/1360 (removed 0) transitions.
// Phase 1: matrix 1360 rows 69 cols
[2022-06-11 08:18:08] [INFO ] Computed 13 place invariants in 7 ms
[2022-06-11 08:18:08] [INFO ] Implicit Places using invariants in 356 ms returned []
// Phase 1: matrix 1360 rows 69 cols
[2022-06-11 08:18:09] [INFO ] Computed 13 place invariants in 6 ms
[2022-06-11 08:18:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-11 08:18:09] [INFO ] Implicit Places using invariants and state equation in 893 ms returned []
Implicit Place search using SMT with State Equation took 1255 ms to find 0 implicit places.
[2022-06-11 08:18:10] [INFO ] Redundant transitions in 206 ms returned []
// Phase 1: matrix 1360 rows 69 cols
[2022-06-11 08:18:10] [INFO ] Computed 13 place invariants in 7 ms
[2022-06-11 08:18:11] [INFO ] Dead Transitions using invariants and state equation in 1117 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 69/69 places, 1360/1360 transitions.
Graph (complete) has 1036 edges and 69 vertex of which 68 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 68 transition count 1359
Applied a total of 2 rules in 98 ms. Remains 68 /69 variables (removed 1) and now considering 1359/1360 (removed 1) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1359 rows 68 cols
[2022-06-11 08:18:11] [INFO ] Computed 13 place invariants in 6 ms
[2022-06-11 08:18:11] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 08:18:11] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2022-06-11 08:18:12] [INFO ] After 546ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-11 08:18:12] [INFO ] After 672ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 70 ms.
[2022-06-11 08:18:12] [INFO ] After 786ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-06-11 08:18:12] [INFO ] Flatten gal took : 316 ms
[2022-06-11 08:18:12] [INFO ] Flatten gal took : 312 ms
[2022-06-11 08:18:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2131225608843052749.gal : 70 ms
[2022-06-11 08:18:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13849538930934704881.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms9288457116772903742;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2131225608843052749.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13849538930934704881.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality13849538930934704881.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 16
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :258 after 264
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :264 after 294
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :294 after 358
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :358 after 1374
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1374 after 1566
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1566 after 24980
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :24980 after 275424
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :275424 after 734432
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :734432 after 1.46123e+06
Detected timeout of ITS tools.
[2022-06-11 08:18:28] [INFO ] Flatten gal took : 264 ms
[2022-06-11 08:18:28] [INFO ] Applying decomposition
[2022-06-11 08:18:28] [INFO ] Flatten gal took : 359 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3769734654662623164.txt' '-o' '/tmp/graph3769734654662623164.bin' '-w' '/tmp/graph3769734654662623164.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3769734654662623164.bin' '-l' '-1' '-v' '-w' '/tmp/graph3769734654662623164.weights' '-q' '0' '-e' '0.001'
[2022-06-11 08:18:30] [INFO ] Decomposing Gal with order
[2022-06-11 08:18:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 08:18:31] [INFO ] Removed a total of 12307 redundant transitions.
[2022-06-11 08:18:31] [INFO ] Flatten gal took : 815 ms
[2022-06-11 08:18:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 94 labels/synchronizations in 308 ms.
[2022-06-11 08:18:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11306787856579691991.gal : 46 ms
[2022-06-11 08:18:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11825200407947922637.prop : 8 ms
Invoking ITS tools like this :cd /tmp/redAtoms9288457116772903742;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11306787856579691991.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11825200407947922637.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...300
Loading property file /tmp/ReachabilityCardinality11825200407947922637.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 128
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5064561033618850023
[2022-06-11 08:18:47] [INFO ] Built C files in 72ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5064561033618850023
Running compilation step : cd /tmp/ltsmin5064561033618850023;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5064561033618850023;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5064561033618850023;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
FORMULA AutonomousCar-PT-10b-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
Computed a total of 51 stabilizing places and 52 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 11 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Applied a total of 0 rules in 11 ms. Remains 347 /347 variables (removed 0) and now considering 1774/1774 (removed 0) transitions.
// Phase 1: matrix 1774 rows 347 cols
[2022-06-11 08:18:51] [INFO ] Computed 15 place invariants in 13 ms
[2022-06-11 08:18:51] [INFO ] Implicit Places using invariants in 525 ms returned []
// Phase 1: matrix 1774 rows 347 cols
[2022-06-11 08:18:51] [INFO ] Computed 15 place invariants in 14 ms
[2022-06-11 08:18:53] [INFO ] Implicit Places using invariants and state equation in 1548 ms returned []
Implicit Place search using SMT with State Equation took 2075 ms to find 0 implicit places.
// Phase 1: matrix 1774 rows 347 cols
[2022-06-11 08:18:53] [INFO ] Computed 15 place invariants in 14 ms
[2022-06-11 08:18:55] [INFO ] Dead Transitions using invariants and state equation in 1975 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 347/347 places, 1774/1774 transitions.
Stuttering acceptance computed with spot in 354 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (NEQ s67 1) (NEQ s87 1) (NEQ s117 1) (NEQ s142 1) (NEQ s162 1) (NEQ s192 1) (NEQ s212 1) (NEQ s237 1) (NEQ s262 1) (NEQ s287 1) (NEQ s314 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 765 reset in 836 ms.
Product exploration explored 100000 steps with 772 reset in 642 ms.
Computed a total of 51 stabilizing places and 52 stable transitions
Computed a total of 51 stabilizing places and 52 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 241 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 41 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Finished Best-First random walk after 6485 steps, including 8 resets, run visited all 1 properties in 13 ms. (steps per millisecond=498 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 181 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Support contains 11 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Applied a total of 0 rules in 12 ms. Remains 347 /347 variables (removed 0) and now considering 1774/1774 (removed 0) transitions.
// Phase 1: matrix 1774 rows 347 cols
[2022-06-11 08:18:57] [INFO ] Computed 15 place invariants in 14 ms
[2022-06-11 08:18:58] [INFO ] Implicit Places using invariants in 508 ms returned []
// Phase 1: matrix 1774 rows 347 cols
[2022-06-11 08:18:58] [INFO ] Computed 15 place invariants in 12 ms
[2022-06-11 08:18:59] [INFO ] Implicit Places using invariants and state equation in 1579 ms returned []
Implicit Place search using SMT with State Equation took 2090 ms to find 0 implicit places.
// Phase 1: matrix 1774 rows 347 cols
[2022-06-11 08:18:59] [INFO ] Computed 15 place invariants in 12 ms
[2022-06-11 08:19:01] [INFO ] Dead Transitions using invariants and state equation in 1332 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 347/347 places, 1774/1774 transitions.
Computed a total of 51 stabilizing places and 52 stable transitions
Computed a total of 51 stabilizing places and 52 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 179 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 77 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 305587 steps, run timeout after 3001 ms. (steps per millisecond=101 ) properties seen :{}
Probabilistic random walk after 305587 steps, saw 55944 distinct states, run finished after 3001 ms. (steps per millisecond=101 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1774 rows 347 cols
[2022-06-11 08:19:04] [INFO ] Computed 15 place invariants in 12 ms
[2022-06-11 08:19:04] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2022-06-11 08:19:05] [INFO ] After 902ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-11 08:19:05] [INFO ] After 1007ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 56 ms.
[2022-06-11 08:19:05] [INFO ] After 1159ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 11 out of 347 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Graph (trivial) has 310 edges and 347 vertex of which 4 / 347 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1862 edges and 345 vertex of which 343 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 0 with 128 rules applied. Total rules applied 130 place count 343 transition count 1642
Reduce places removed 126 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 1 with 185 rules applied. Total rules applied 315 place count 217 transition count 1583
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 350 place count 182 transition count 1583
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 350 place count 182 transition count 1577
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 362 place count 176 transition count 1577
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 506 place count 104 transition count 1505
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 507 place count 104 transition count 1504
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 522 place count 89 transition count 1359
Iterating global reduction 4 with 15 rules applied. Total rules applied 537 place count 89 transition count 1359
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 547 place count 89 transition count 1349
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 5 with 2 rules applied. Total rules applied 549 place count 88 transition count 1348
Free-agglomeration rule applied 16 times.
Iterating global reduction 5 with 16 rules applied. Total rules applied 565 place count 88 transition count 1332
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 581 place count 72 transition count 1332
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 588 place count 72 transition count 1332
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 589 place count 71 transition count 1331
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 590 place count 70 transition count 1331
Applied a total of 590 rules in 509 ms. Remains 70 /347 variables (removed 277) and now considering 1331/1774 (removed 443) transitions.
Finished structural reductions, in 1 iterations. Remains : 70/347 places, 1331/1774 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 511620 steps, run timeout after 3001 ms. (steps per millisecond=170 ) properties seen :{}
Probabilistic random walk after 511620 steps, saw 73476 distinct states, run finished after 3001 ms. (steps per millisecond=170 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1331 rows 70 cols
[2022-06-11 08:19:09] [INFO ] Computed 14 place invariants in 6 ms
[2022-06-11 08:19:09] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2022-06-11 08:19:10] [INFO ] After 523ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-11 08:19:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 08:19:10] [INFO ] After 37ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2022-06-11 08:19:10] [INFO ] After 99ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2022-06-11 08:19:10] [INFO ] After 701ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 11 out of 70 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 70/70 places, 1331/1331 transitions.
Applied a total of 0 rules in 76 ms. Remains 70 /70 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 70/70 places, 1331/1331 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 70/70 places, 1331/1331 transitions.
Applied a total of 0 rules in 81 ms. Remains 70 /70 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 70 cols
[2022-06-11 08:19:10] [INFO ] Computed 14 place invariants in 6 ms
[2022-06-11 08:19:10] [INFO ] Implicit Places using invariants in 376 ms returned []
// Phase 1: matrix 1331 rows 70 cols
[2022-06-11 08:19:10] [INFO ] Computed 14 place invariants in 6 ms
[2022-06-11 08:19:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 08:19:11] [INFO ] Implicit Places using invariants and state equation in 811 ms returned [65, 69]
Discarding 2 places :
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 1191 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 68/70 places, 1330/1331 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 67 transition count 1329
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 67 transition count 1328
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 66 transition count 1328
Applied a total of 4 rules in 184 ms. Remains 66 /68 variables (removed 2) and now considering 1328/1330 (removed 2) transitions.
// Phase 1: matrix 1328 rows 66 cols
[2022-06-11 08:19:11] [INFO ] Computed 12 place invariants in 6 ms
[2022-06-11 08:19:12] [INFO ] Implicit Places using invariants in 431 ms returned []
// Phase 1: matrix 1328 rows 66 cols
[2022-06-11 08:19:12] [INFO ] Computed 12 place invariants in 7 ms
[2022-06-11 08:19:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-11 08:19:13] [INFO ] Implicit Places using invariants and state equation in 846 ms returned []
Implicit Place search using SMT with State Equation took 1278 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 66/70 places, 1328/1331 transitions.
Finished structural reductions, in 2 iterations. Remains : 66/70 places, 1328/1331 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 511567 steps, run timeout after 3001 ms. (steps per millisecond=170 ) properties seen :{}
Probabilistic random walk after 511567 steps, saw 73191 distinct states, run finished after 3001 ms. (steps per millisecond=170 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1328 rows 66 cols
[2022-06-11 08:19:16] [INFO ] Computed 12 place invariants in 6 ms
[2022-06-11 08:19:16] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2022-06-11 08:19:16] [INFO ] After 521ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-11 08:19:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-11 08:19:17] [INFO ] After 36ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :1
[2022-06-11 08:19:17] [INFO ] After 96ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2022-06-11 08:19:17] [INFO ] After 715ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 11 out of 66 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 66/66 places, 1328/1328 transitions.
Applied a total of 0 rules in 76 ms. Remains 66 /66 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 1328/1328 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 66/66 places, 1328/1328 transitions.
Applied a total of 0 rules in 74 ms. Remains 66 /66 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
// Phase 1: matrix 1328 rows 66 cols
[2022-06-11 08:19:17] [INFO ] Computed 12 place invariants in 6 ms
[2022-06-11 08:19:17] [INFO ] Implicit Places using invariants in 340 ms returned []
// Phase 1: matrix 1328 rows 66 cols
[2022-06-11 08:19:17] [INFO ] Computed 12 place invariants in 12 ms
[2022-06-11 08:19:18] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-11 08:19:18] [INFO ] Implicit Places using invariants and state equation in 815 ms returned []
Implicit Place search using SMT with State Equation took 1175 ms to find 0 implicit places.
[2022-06-11 08:19:18] [INFO ] Redundant transitions in 140 ms returned []
// Phase 1: matrix 1328 rows 66 cols
[2022-06-11 08:19:18] [INFO ] Computed 12 place invariants in 8 ms
[2022-06-11 08:19:19] [INFO ] Dead Transitions using invariants and state equation in 1227 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 1328/1328 transitions.
Graph (complete) has 957 edges and 66 vertex of which 65 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 65 transition count 1327
Applied a total of 2 rules in 87 ms. Remains 65 /66 variables (removed 1) and now considering 1327/1328 (removed 1) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1327 rows 65 cols
[2022-06-11 08:19:19] [INFO ] Computed 12 place invariants in 7 ms
[2022-06-11 08:19:20] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2022-06-11 08:19:20] [INFO ] After 546ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 08:19:20] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2022-06-11 08:19:21] [INFO ] After 498ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 08:19:21] [INFO ] After 561ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2022-06-11 08:19:21] [INFO ] After 633ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-11 08:19:21] [INFO ] Flatten gal took : 276 ms
[2022-06-11 08:19:21] [INFO ] Flatten gal took : 258 ms
[2022-06-11 08:19:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14096740277575548522.gal : 33 ms
[2022-06-11 08:19:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5537819053975670992.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms17325033899528072658;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14096740277575548522.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5537819053975670992.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality5537819053975670992.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :33 after 38
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :38 after 862
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :862 after 5648
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :5648 after 6940
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :6940 after 8092
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :8092 after 25679
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :25679 after 155617
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :155617 after 1.29644e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.29644e+06 after 4.50164e+06
Detected timeout of ITS tools.
[2022-06-11 08:19:37] [INFO ] Flatten gal took : 243 ms
[2022-06-11 08:19:37] [INFO ] Applying decomposition
[2022-06-11 08:19:37] [INFO ] Flatten gal took : 260 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph432472322204581850.txt' '-o' '/tmp/graph432472322204581850.bin' '-w' '/tmp/graph432472322204581850.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph432472322204581850.bin' '-l' '-1' '-v' '-w' '/tmp/graph432472322204581850.weights' '-q' '0' '-e' '0.001'
[2022-06-11 08:19:37] [INFO ] Decomposing Gal with order
[2022-06-11 08:19:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 08:19:38] [INFO ] Removed a total of 12190 redundant transitions.
[2022-06-11 08:19:38] [INFO ] Flatten gal took : 438 ms
[2022-06-11 08:19:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 84 labels/synchronizations in 83 ms.
[2022-06-11 08:19:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11517312568976399197.gal : 16 ms
[2022-06-11 08:19:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15598448710482817106.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms17325033899528072658;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11517312568976399197.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15598448710482817106.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...300
Loading property file /tmp/ReachabilityCardinality15598448710482817106.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :47 after 62254
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1584425046649754303
[2022-06-11 08:19:53] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1584425046649754303
Running compilation step : cd /tmp/ltsmin1584425046649754303;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1584425046649754303;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1584425046649754303;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 189 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 81 reset in 291 ms.
Product exploration explored 100000 steps with 771 reset in 593 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Support contains 11 out of 347 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Graph (trivial) has 310 edges and 347 vertex of which 4 / 347 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 125 rules applied. Total rules applied 126 place count 345 transition count 1772
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 149 place count 345 transition count 1749
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 149 place count 345 transition count 1749
Deduced a syphon composed of 150 places in 2 ms
Iterating global reduction 2 with 25 rules applied. Total rules applied 174 place count 345 transition count 1749
Discarding 108 places :
Symmetric choice reduction at 2 with 108 rule applications. Total rules 282 place count 237 transition count 1641
Deduced a syphon composed of 43 places in 2 ms
Iterating global reduction 2 with 108 rules applied. Total rules applied 390 place count 237 transition count 1641
Performed 88 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 131 places in 1 ms
Iterating global reduction 2 with 88 rules applied. Total rules applied 478 place count 237 transition count 1654
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 480 place count 237 transition count 1652
Discarding 68 places :
Symmetric choice reduction at 3 with 68 rule applications. Total rules 548 place count 169 transition count 1454
Deduced a syphon composed of 78 places in 1 ms
Iterating global reduction 3 with 68 rules applied. Total rules applied 616 place count 169 transition count 1454
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 636 place count 169 transition count 1434
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 647 place count 158 transition count 1423
Deduced a syphon composed of 67 places in 1 ms
Iterating global reduction 4 with 11 rules applied. Total rules applied 658 place count 158 transition count 1423
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 659 place count 158 transition count 1423
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 661 place count 156 transition count 1421
Deduced a syphon composed of 66 places in 1 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 663 place count 156 transition count 1421
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 67 places in 1 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 664 place count 156 transition count 1423
Deduced a syphon composed of 67 places in 1 ms
Applied a total of 664 rules in 527 ms. Remains 156 /347 variables (removed 191) and now considering 1423/1774 (removed 351) transitions.
[2022-06-11 08:19:59] [INFO ] Redundant transitions in 58 ms returned []
// Phase 1: matrix 1423 rows 156 cols
[2022-06-11 08:19:59] [INFO ] Computed 14 place invariants in 14 ms
[2022-06-11 08:20:00] [INFO ] Dead Transitions using invariants and state equation in 888 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 156/347 places, 1423/1774 transitions.
Finished structural reductions, in 1 iterations. Remains : 156/347 places, 1423/1774 transitions.
Product exploration explored 100000 steps with 56 reset in 219 ms.
Product exploration explored 100000 steps with 912 reset in 701 ms.
Built C files in :
/tmp/ltsmin3011472532529745025
[2022-06-11 08:20:01] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3011472532529745025
Running compilation step : cd /tmp/ltsmin3011472532529745025;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3011472532529745025;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3011472532529745025;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 11 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Applied a total of 0 rules in 16 ms. Remains 347 /347 variables (removed 0) and now considering 1774/1774 (removed 0) transitions.
// Phase 1: matrix 1774 rows 347 cols
[2022-06-11 08:20:04] [INFO ] Computed 15 place invariants in 18 ms
[2022-06-11 08:20:04] [INFO ] Implicit Places using invariants in 559 ms returned []
// Phase 1: matrix 1774 rows 347 cols
[2022-06-11 08:20:04] [INFO ] Computed 15 place invariants in 16 ms
[2022-06-11 08:20:06] [INFO ] Implicit Places using invariants and state equation in 1539 ms returned []
Implicit Place search using SMT with State Equation took 2103 ms to find 0 implicit places.
// Phase 1: matrix 1774 rows 347 cols
[2022-06-11 08:20:06] [INFO ] Computed 15 place invariants in 20 ms
[2022-06-11 08:20:07] [INFO ] Dead Transitions using invariants and state equation in 1770 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 347/347 places, 1774/1774 transitions.
Built C files in :
/tmp/ltsmin3885625397538557901
[2022-06-11 08:20:08] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3885625397538557901
Running compilation step : cd /tmp/ltsmin3885625397538557901;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3885625397538557901;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3885625397538557901;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-11 08:20:11] [INFO ] Flatten gal took : 211 ms
[2022-06-11 08:20:11] [INFO ] Flatten gal took : 218 ms
[2022-06-11 08:20:11] [INFO ] Time to serialize gal into /tmp/LTL12509545692875771127.gal : 26 ms
[2022-06-11 08:20:11] [INFO ] Time to serialize properties into /tmp/LTL13109096082666354836.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12509545692875771127.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13109096082666354836.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1250954...268
Read 1 LTL properties
Checking formula 0 : !((X(G("(((((p74!=1)||(p99!=1))||((p136!=1)||(p167!=1)))||(((p192!=1)||(p229!=1))||((p254!=1)||(p285!=1))))||(((p316!=1)||(p347!=1))||...171
Formula 0 simplified : !XG"(((((p74!=1)||(p99!=1))||((p136!=1)||(p167!=1)))||(((p192!=1)||(p229!=1))||((p254!=1)||(p285!=1))))||(((p316!=1)||(p347!=1))||(p...165
Detected timeout of ITS tools.
[2022-06-11 08:20:27] [INFO ] Flatten gal took : 249 ms
[2022-06-11 08:20:27] [INFO ] Applying decomposition
[2022-06-11 08:20:27] [INFO ] Flatten gal took : 190 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph16033425338125693519.txt' '-o' '/tmp/graph16033425338125693519.bin' '-w' '/tmp/graph16033425338125693519.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16033425338125693519.bin' '-l' '-1' '-v' '-w' '/tmp/graph16033425338125693519.weights' '-q' '0' '-e' '0.001'
[2022-06-11 08:20:27] [INFO ] Decomposing Gal with order
[2022-06-11 08:20:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 08:20:28] [INFO ] Removed a total of 12142 redundant transitions.
[2022-06-11 08:20:28] [INFO ] Flatten gal took : 507 ms
[2022-06-11 08:20:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 88 labels/synchronizations in 59 ms.
[2022-06-11 08:20:28] [INFO ] Time to serialize gal into /tmp/LTL3818571458103049087.gal : 7 ms
[2022-06-11 08:20:28] [INFO ] Time to serialize properties into /tmp/LTL2118991857277229257.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3818571458103049087.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2118991857277229257.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3818571...245
Read 1 LTL properties
Checking formula 0 : !((X(G("(((((i7.u20.p74!=1)||(i7.u26.p99!=1))||((i7.u37.p136!=1)||(i7.u44.p167!=1)))||(((i7.u50.p192!=1)||(i7.u60.p229!=1))||((i7.u67....248
Formula 0 simplified : !XG"(((((i7.u20.p74!=1)||(i7.u26.p99!=1))||((i7.u37.p136!=1)||(i7.u44.p167!=1)))||(((i7.u50.p192!=1)||(i7.u60.p229!=1))||((i7.u67.p2...242
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9082794471719273653
[2022-06-11 08:20:43] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9082794471719273653
Running compilation step : cd /tmp/ltsmin9082794471719273653;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9082794471719273653;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9082794471719273653;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property AutonomousCar-PT-10b-LTLFireability-00 finished in 115976 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((F(p0)||p1))&&!(p2 U X(X(p1)))))'
Support contains 15 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Applied a total of 0 rules in 31 ms. Remains 347 /347 variables (removed 0) and now considering 1774/1774 (removed 0) transitions.
// Phase 1: matrix 1774 rows 347 cols
[2022-06-11 08:20:46] [INFO ] Computed 15 place invariants in 14 ms
[2022-06-11 08:20:47] [INFO ] Implicit Places using invariants in 513 ms returned []
// Phase 1: matrix 1774 rows 347 cols
[2022-06-11 08:20:47] [INFO ] Computed 15 place invariants in 13 ms
[2022-06-11 08:20:48] [INFO ] Implicit Places using invariants and state equation in 1300 ms returned []
Implicit Place search using SMT with State Equation took 1819 ms to find 0 implicit places.
// Phase 1: matrix 1774 rows 347 cols
[2022-06-11 08:20:48] [INFO ] Computed 15 place invariants in 16 ms
[2022-06-11 08:20:50] [INFO ] Dead Transitions using invariants and state equation in 1302 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 347/347 places, 1774/1774 transitions.
Stuttering acceptance computed with spot in 315 ms :[(OR (NOT p0) p1), p1, p1, (AND (NOT p1) (NOT p0)), p1, true]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(AND (EQ s4 1) (EQ s19 1) (EQ s86 1) (EQ s313 1)), p1:(AND (EQ s62 1) (EQ s92 1) (EQ s112 1) (EQ s137 1) (EQ s162 1) (EQ s187 1) (EQ s212 1) (EQ s237 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 33333 reset in 793 ms.
Product exploration explored 100000 steps with 33333 reset in 696 ms.
Computed a total of 51 stabilizing places and 52 stable transitions
Computed a total of 51 stabilizing places and 52 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT p1)))
Knowledge based reduction with 7 factoid took 234 ms. Reduced automaton from 6 states, 9 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA AutonomousCar-PT-10b-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-10b-LTLFireability-01 finished in 5276 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 347 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Graph (trivial) has 329 edges and 347 vertex of which 4 / 347 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 125 transitions
Trivial Post-agglo rules discarded 125 transitions
Performed 125 trivial Post agglomeration. Transition count delta: 125
Iterating post reduction 0 with 125 rules applied. Total rules applied 126 place count 344 transition count 1646
Reduce places removed 125 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 182 rules applied. Total rules applied 308 place count 219 transition count 1589
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 342 place count 185 transition count 1589
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 342 place count 185 transition count 1583
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 354 place count 179 transition count 1583
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 355 place count 178 transition count 1582
Iterating global reduction 3 with 1 rules applied. Total rules applied 356 place count 178 transition count 1582
Performed 81 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 81 places in 1 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 3 with 162 rules applied. Total rules applied 518 place count 97 transition count 1500
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 519 place count 97 transition count 1499
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 539 place count 77 transition count 1299
Iterating global reduction 4 with 20 rules applied. Total rules applied 559 place count 77 transition count 1299
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 569 place count 77 transition count 1289
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 573 place count 75 transition count 1287
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 575 place count 73 transition count 1285
Applied a total of 575 rules in 484 ms. Remains 73 /347 variables (removed 274) and now considering 1285/1774 (removed 489) transitions.
// Phase 1: matrix 1285 rows 73 cols
[2022-06-11 08:20:52] [INFO ] Computed 14 place invariants in 8 ms
[2022-06-11 08:20:53] [INFO ] Implicit Places using invariants in 757 ms returned []
// Phase 1: matrix 1285 rows 73 cols
[2022-06-11 08:20:53] [INFO ] Computed 14 place invariants in 8 ms
[2022-06-11 08:20:53] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-11 08:20:54] [INFO ] Implicit Places using invariants and state equation in 1294 ms returned [68, 72]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2067 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 71/347 places, 1285/1774 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 70 transition count 1284
Applied a total of 2 rules in 153 ms. Remains 70 /71 variables (removed 1) and now considering 1284/1285 (removed 1) transitions.
// Phase 1: matrix 1284 rows 70 cols
[2022-06-11 08:20:54] [INFO ] Computed 12 place invariants in 19 ms
[2022-06-11 08:20:55] [INFO ] Implicit Places using invariants in 723 ms returned []
// Phase 1: matrix 1284 rows 70 cols
[2022-06-11 08:20:55] [INFO ] Computed 12 place invariants in 9 ms
[2022-06-11 08:20:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 08:20:56] [INFO ] Implicit Places using invariants and state equation in 1300 ms returned []
Implicit Place search using SMT with State Equation took 2031 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 70/347 places, 1284/1774 transitions.
Finished structural reductions, in 2 iterations. Remains : 70/347 places, 1284/1774 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s7 1) (EQ s24 1) (EQ s66 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 19 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-10b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10b-LTLFireability-03 finished in 4801 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 11 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Applied a total of 0 rules in 20 ms. Remains 347 /347 variables (removed 0) and now considering 1774/1774 (removed 0) transitions.
// Phase 1: matrix 1774 rows 347 cols
[2022-06-11 08:20:57] [INFO ] Computed 15 place invariants in 12 ms
[2022-06-11 08:20:57] [INFO ] Implicit Places using invariants in 509 ms returned []
// Phase 1: matrix 1774 rows 347 cols
[2022-06-11 08:20:57] [INFO ] Computed 15 place invariants in 13 ms
[2022-06-11 08:20:59] [INFO ] Implicit Places using invariants and state equation in 1532 ms returned []
Implicit Place search using SMT with State Equation took 2043 ms to find 0 implicit places.
// Phase 1: matrix 1774 rows 347 cols
[2022-06-11 08:20:59] [INFO ] Computed 15 place invariants in 17 ms
[2022-06-11 08:21:00] [INFO ] Dead Transitions using invariants and state equation in 1589 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 347/347 places, 1774/1774 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-10b-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 s67 1) (EQ s92 1) (EQ s112 1) (EQ s137 1) (EQ s162 1) (EQ s187 1) (EQ s212 1) (EQ s237 1) (EQ s262 1) (EQ s287 1) (EQ s314 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]]
Stuttering criterion allowed to conclude after 126 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-10b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10b-LTLFireability-04 finished in 3759 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(F((F(p0)&&F(p1)&&F(p2)))))))'
Support contains 16 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Applied a total of 0 rules in 13 ms. Remains 347 /347 variables (removed 0) and now considering 1774/1774 (removed 0) transitions.
// Phase 1: matrix 1774 rows 347 cols
[2022-06-11 08:21:00] [INFO ] Computed 15 place invariants in 13 ms
[2022-06-11 08:21:01] [INFO ] Implicit Places using invariants in 360 ms returned []
// Phase 1: matrix 1774 rows 347 cols
[2022-06-11 08:21:01] [INFO ] Computed 15 place invariants in 13 ms
[2022-06-11 08:21:02] [INFO ] Implicit Places using invariants and state equation in 1303 ms returned []
Implicit Place search using SMT with State Equation took 1666 ms to find 0 implicit places.
// Phase 1: matrix 1774 rows 347 cols
[2022-06-11 08:21:02] [INFO ] Computed 15 place invariants in 12 ms
[2022-06-11 08:21:04] [INFO ] Dead Transitions using invariants and state equation in 1586 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 347/347 places, 1774/1774 transitions.
Stuttering acceptance computed with spot in 320 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}, { cond=(NOT p2), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s62 1) (EQ s87 1) (EQ s112 1) (EQ s137 1) (EQ s167 1) (EQ s187 1) (EQ s212 1) (EQ s237 1) (EQ s262 1) (EQ s287 1) (EQ s314 1)), p1:(OR (EQ s62...], nbAcceptance=0, 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]]
Stuttering criterion allowed to conclude after 143 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-10b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10b-LTLFireability-05 finished in 3619 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(G(p0)))||X(p1)))'
Support contains 17 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Applied a total of 0 rules in 13 ms. Remains 347 /347 variables (removed 0) and now considering 1774/1774 (removed 0) transitions.
// Phase 1: matrix 1774 rows 347 cols
[2022-06-11 08:21:04] [INFO ] Computed 15 place invariants in 13 ms
[2022-06-11 08:21:04] [INFO ] Implicit Places using invariants in 326 ms returned []
// Phase 1: matrix 1774 rows 347 cols
[2022-06-11 08:21:04] [INFO ] Computed 15 place invariants in 12 ms
[2022-06-11 08:21:06] [INFO ] Implicit Places using invariants and state equation in 1318 ms returned []
Implicit Place search using SMT with State Equation took 1654 ms to find 0 implicit places.
// Phase 1: matrix 1774 rows 347 cols
[2022-06-11 08:21:06] [INFO ] Computed 15 place invariants in 12 ms
[2022-06-11 08:21:07] [INFO ] Dead Transitions using invariants and state equation in 1486 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 347/347 places, 1774/1774 transitions.
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(OR (EQ s67 0) (EQ s87 0) (EQ s117 0) (EQ s137 0) (EQ s167 0) (EQ s187 0) (EQ s217 0) (EQ s242 0) (EQ s262 0) (EQ s292 0) (EQ s314 0)), p0:(OR (EQ s67 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 632 ms.
Product exploration explored 100000 steps with 50000 reset in 604 ms.
Computed a total of 51 stabilizing places and 52 stable transitions
Computed a total of 51 stabilizing places and 52 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA AutonomousCar-PT-10b-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-10b-LTLFireability-06 finished in 4651 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&(X(p0)||p1))))'
Support contains 12 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Applied a total of 0 rules in 14 ms. Remains 347 /347 variables (removed 0) and now considering 1774/1774 (removed 0) transitions.
// Phase 1: matrix 1774 rows 347 cols
[2022-06-11 08:21:09] [INFO ] Computed 15 place invariants in 12 ms
[2022-06-11 08:21:09] [INFO ] Implicit Places using invariants in 495 ms returned []
// Phase 1: matrix 1774 rows 347 cols
[2022-06-11 08:21:09] [INFO ] Computed 15 place invariants in 12 ms
[2022-06-11 08:21:11] [INFO ] Implicit Places using invariants and state equation in 1595 ms returned []
Implicit Place search using SMT with State Equation took 2094 ms to find 0 implicit places.
// Phase 1: matrix 1774 rows 347 cols
[2022-06-11 08:21:11] [INFO ] Computed 15 place invariants in 17 ms
[2022-06-11 08:21:12] [INFO ] Dead Transitions using invariants and state equation in 1426 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 347/347 places, 1774/1774 transitions.
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s266 1), p0:(AND (EQ s67 1) (EQ s92 1) (EQ s117 1) (EQ s137 1) (EQ s162 1) (EQ s187 1) (EQ s212 1) (EQ s242 1) (EQ s262 1) (EQ s287 1) (EQ s314 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-10b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10b-LTLFireability-07 finished in 3731 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(X(G((p0 U (p1 U X(p2)))))))||G(p2))))'
Support contains 17 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Applied a total of 0 rules in 13 ms. Remains 347 /347 variables (removed 0) and now considering 1774/1774 (removed 0) transitions.
// Phase 1: matrix 1774 rows 347 cols
[2022-06-11 08:21:12] [INFO ] Computed 15 place invariants in 17 ms
[2022-06-11 08:21:13] [INFO ] Implicit Places using invariants in 513 ms returned []
// Phase 1: matrix 1774 rows 347 cols
[2022-06-11 08:21:13] [INFO ] Computed 15 place invariants in 12 ms
[2022-06-11 08:21:14] [INFO ] Implicit Places using invariants and state equation in 1193 ms returned []
Implicit Place search using SMT with State Equation took 1715 ms to find 0 implicit places.
// Phase 1: matrix 1774 rows 347 cols
[2022-06-11 08:21:14] [INFO ] Computed 15 place invariants in 12 ms
[2022-06-11 08:21:16] [INFO ] Dead Transitions using invariants and state equation in 1617 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 347/347 places, 1774/1774 transitions.
Stuttering acceptance computed with spot in 433 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 6}], [{ cond=(NOT p2), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={0} source=5 dest: 5}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=6 dest: 6}], [{ cond=true, acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(AND (EQ s4 1) (EQ s14 1) (EQ s107 1) (EQ s313 1)), p0:(AND (EQ s4 1) (EQ s15 1) (EQ s86 1) (EQ s313 1)), p2:(AND (EQ s62 1) (EQ s92 1) (EQ s112 1) (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-10b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10b-LTLFireability-08 finished in 3823 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(p0))))'
Support contains 11 out of 347 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Graph (trivial) has 310 edges and 347 vertex of which 4 / 347 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 125 transitions
Trivial Post-agglo rules discarded 125 transitions
Performed 125 trivial Post agglomeration. Transition count delta: 125
Iterating post reduction 0 with 125 rules applied. Total rules applied 126 place count 344 transition count 1646
Reduce places removed 125 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 182 rules applied. Total rules applied 308 place count 219 transition count 1589
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 342 place count 185 transition count 1589
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 342 place count 185 transition count 1583
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 354 place count 179 transition count 1583
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 355 place count 178 transition count 1582
Iterating global reduction 3 with 1 rules applied. Total rules applied 356 place count 178 transition count 1582
Performed 71 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 71 places in 1 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 498 place count 107 transition count 1510
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 499 place count 107 transition count 1509
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 514 place count 92 transition count 1364
Iterating global reduction 4 with 15 rules applied. Total rules applied 529 place count 92 transition count 1364
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 539 place count 92 transition count 1354
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 543 place count 90 transition count 1352
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 545 place count 88 transition count 1350
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 546 place count 87 transition count 1350
Applied a total of 546 rules in 391 ms. Remains 87 /347 variables (removed 260) and now considering 1350/1774 (removed 424) transitions.
// Phase 1: matrix 1350 rows 87 cols
[2022-06-11 08:21:16] [INFO ] Computed 13 place invariants in 8 ms
[2022-06-11 08:21:17] [INFO ] Implicit Places using invariants in 391 ms returned []
// Phase 1: matrix 1350 rows 87 cols
[2022-06-11 08:21:17] [INFO ] Computed 13 place invariants in 8 ms
[2022-06-11 08:21:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-11 08:21:18] [INFO ] Implicit Places using invariants and state equation in 937 ms returned [82, 86]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1338 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 85/347 places, 1350/1774 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 84 transition count 1349
Applied a total of 2 rules in 105 ms. Remains 84 /85 variables (removed 1) and now considering 1349/1350 (removed 1) transitions.
// Phase 1: matrix 1349 rows 84 cols
[2022-06-11 08:21:18] [INFO ] Computed 11 place invariants in 10 ms
[2022-06-11 08:21:18] [INFO ] Implicit Places using invariants in 407 ms returned []
// Phase 1: matrix 1349 rows 84 cols
[2022-06-11 08:21:18] [INFO ] Computed 11 place invariants in 9 ms
[2022-06-11 08:21:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 08:21:19] [INFO ] Implicit Places using invariants and state equation in 930 ms returned []
Implicit Place search using SMT with State Equation took 1339 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 84/347 places, 1349/1774 transitions.
Finished structural reductions, in 2 iterations. Remains : 84/347 places, 1349/1774 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s14 1) (EQ s21 1) (EQ s28 1) (EQ s37 1) (EQ s41 1) (EQ s50 1) (EQ s56 1) (EQ s60 1) (EQ s69 1) (EQ s73 1) (EQ s80 1))], nbAcceptance=1, 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 43 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-10b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10b-LTLFireability-09 finished in 3236 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((G(p2)&&p1))&&p0)))'
Support contains 21 out of 347 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Graph (trivial) has 295 edges and 347 vertex of which 4 / 347 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 124 transitions
Trivial Post-agglo rules discarded 124 transitions
Performed 124 trivial Post agglomeration. Transition count delta: 124
Iterating post reduction 0 with 124 rules applied. Total rules applied 125 place count 344 transition count 1647
Reduce places removed 124 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 181 rules applied. Total rules applied 306 place count 220 transition count 1590
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 340 place count 186 transition count 1590
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 340 place count 186 transition count 1585
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 350 place count 181 transition count 1585
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 351 place count 180 transition count 1584
Iterating global reduction 3 with 1 rules applied. Total rules applied 352 place count 180 transition count 1584
Performed 65 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 482 place count 115 transition count 1518
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 483 place count 115 transition count 1517
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 494 place count 104 transition count 1416
Iterating global reduction 4 with 11 rules applied. Total rules applied 505 place count 104 transition count 1416
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 515 place count 104 transition count 1406
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 519 place count 102 transition count 1404
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 521 place count 100 transition count 1402
Applied a total of 521 rules in 348 ms. Remains 100 /347 variables (removed 247) and now considering 1402/1774 (removed 372) transitions.
// Phase 1: matrix 1402 rows 100 cols
[2022-06-11 08:21:20] [INFO ] Computed 14 place invariants in 9 ms
[2022-06-11 08:21:20] [INFO ] Implicit Places using invariants in 222 ms returned []
// Phase 1: matrix 1402 rows 100 cols
[2022-06-11 08:21:20] [INFO ] Computed 14 place invariants in 8 ms
[2022-06-11 08:21:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-11 08:21:21] [INFO ] Implicit Places using invariants and state equation in 802 ms returned [95, 99]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1030 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 98/347 places, 1402/1774 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 97 transition count 1401
Applied a total of 2 rules in 100 ms. Remains 97 /98 variables (removed 1) and now considering 1401/1402 (removed 1) transitions.
// Phase 1: matrix 1401 rows 97 cols
[2022-06-11 08:21:21] [INFO ] Computed 12 place invariants in 8 ms
[2022-06-11 08:21:21] [INFO ] Implicit Places using invariants in 213 ms returned []
// Phase 1: matrix 1401 rows 97 cols
[2022-06-11 08:21:21] [INFO ] Computed 12 place invariants in 8 ms
[2022-06-11 08:21:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 08:21:22] [INFO ] Implicit Places using invariants and state equation in 773 ms returned []
Implicit Place search using SMT with State Equation took 988 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 97/347 places, 1401/1774 transitions.
Finished structural reductions, in 2 iterations. Remains : 97/347 places, 1401/1774 transitions.
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p2 p1 p0), acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p2 p1), acceptance={} source=1 dest: 1}]], initial=0, aps=[p2:(OR (EQ s1 0) (EQ s4 0) (EQ s71 0) (EQ s92 0)), p1:(AND (EQ s16 1) (EQ s27 1) (EQ s35 1) (EQ s40 1) (EQ s48 1) (EQ s55 1) (EQ s63 1) (EQ s70 1) (EQ s78...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-10b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10b-LTLFireability-10 finished in 2592 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (!X((F(G(p0))||F(p0))) U p1)))'
Support contains 15 out of 347 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Graph (trivial) has 308 edges and 347 vertex of which 4 / 347 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 125 transitions
Trivial Post-agglo rules discarded 125 transitions
Performed 125 trivial Post agglomeration. Transition count delta: 125
Iterating post reduction 0 with 125 rules applied. Total rules applied 126 place count 344 transition count 1646
Reduce places removed 125 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 182 rules applied. Total rules applied 308 place count 219 transition count 1589
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 342 place count 185 transition count 1589
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 342 place count 185 transition count 1584
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 352 place count 180 transition count 1584
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 353 place count 179 transition count 1583
Iterating global reduction 3 with 1 rules applied. Total rules applied 354 place count 179 transition count 1583
Performed 70 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 494 place count 109 transition count 1512
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 495 place count 109 transition count 1511
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 511 place count 93 transition count 1354
Iterating global reduction 4 with 16 rules applied. Total rules applied 527 place count 93 transition count 1354
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 536 place count 93 transition count 1345
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 540 place count 91 transition count 1343
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 541 place count 91 transition count 1343
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 543 place count 89 transition count 1341
Applied a total of 543 rules in 432 ms. Remains 89 /347 variables (removed 258) and now considering 1341/1774 (removed 433) transitions.
// Phase 1: matrix 1341 rows 89 cols
[2022-06-11 08:21:22] [INFO ] Computed 14 place invariants in 13 ms
[2022-06-11 08:21:23] [INFO ] Implicit Places using invariants in 386 ms returned []
// Phase 1: matrix 1341 rows 89 cols
[2022-06-11 08:21:23] [INFO ] Computed 14 place invariants in 9 ms
[2022-06-11 08:21:23] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-11 08:21:24] [INFO ] Implicit Places using invariants and state equation in 842 ms returned [84, 88]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1235 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/347 places, 1341/1774 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 86 transition count 1340
Applied a total of 2 rules in 101 ms. Remains 86 /87 variables (removed 1) and now considering 1340/1341 (removed 1) transitions.
// Phase 1: matrix 1340 rows 86 cols
[2022-06-11 08:21:24] [INFO ] Computed 12 place invariants in 8 ms
[2022-06-11 08:21:24] [INFO ] Implicit Places using invariants in 381 ms returned []
// Phase 1: matrix 1340 rows 86 cols
[2022-06-11 08:21:24] [INFO ] Computed 12 place invariants in 9 ms
[2022-06-11 08:21:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 08:21:25] [INFO ] Implicit Places using invariants and state equation in 865 ms returned []
Implicit Place search using SMT with State Equation took 1251 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 86/347 places, 1340/1774 transitions.
Finished structural reductions, in 2 iterations. Remains : 86/347 places, 1340/1774 transitions.
Stuttering acceptance computed with spot in 136 ms :[p0, true, (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=p0, acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(AND (EQ s1 1) (EQ s5 1) (EQ s22 1) (EQ s81 1)), p1:(AND (EQ s16 1) (EQ s27 1) (EQ s31 1) (EQ s40 1) (EQ s46 1) (EQ s50 1) (EQ s59 1) (EQ s63 1) (EQ s7...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 46 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-10b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10b-LTLFireability-11 finished in 3179 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(p0)||G(p1)))||G((F(p2) U p3))))'
Support contains 17 out of 347 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Graph (trivial) has 306 edges and 347 vertex of which 4 / 347 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 124 transitions
Trivial Post-agglo rules discarded 124 transitions
Performed 124 trivial Post agglomeration. Transition count delta: 124
Iterating post reduction 0 with 124 rules applied. Total rules applied 125 place count 344 transition count 1647
Reduce places removed 124 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 181 rules applied. Total rules applied 306 place count 220 transition count 1590
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 340 place count 186 transition count 1590
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 340 place count 186 transition count 1585
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 350 place count 181 transition count 1585
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 351 place count 180 transition count 1584
Iterating global reduction 3 with 1 rules applied. Total rules applied 352 place count 180 transition count 1584
Performed 70 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 492 place count 110 transition count 1513
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 493 place count 110 transition count 1512
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 509 place count 94 transition count 1355
Iterating global reduction 4 with 16 rules applied. Total rules applied 525 place count 94 transition count 1355
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 534 place count 94 transition count 1346
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 538 place count 92 transition count 1344
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 539 place count 92 transition count 1344
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 541 place count 90 transition count 1342
Applied a total of 541 rules in 396 ms. Remains 90 /347 variables (removed 257) and now considering 1342/1774 (removed 432) transitions.
// Phase 1: matrix 1342 rows 90 cols
[2022-06-11 08:21:26] [INFO ] Computed 14 place invariants in 8 ms
[2022-06-11 08:21:26] [INFO ] Implicit Places using invariants in 363 ms returned []
// Phase 1: matrix 1342 rows 90 cols
[2022-06-11 08:21:26] [INFO ] Computed 14 place invariants in 8 ms
[2022-06-11 08:21:26] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-11 08:21:27] [INFO ] Implicit Places using invariants and state equation in 880 ms returned [85, 89]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1260 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/347 places, 1342/1774 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 87 transition count 1341
Applied a total of 2 rules in 118 ms. Remains 87 /88 variables (removed 1) and now considering 1341/1342 (removed 1) transitions.
// Phase 1: matrix 1341 rows 87 cols
[2022-06-11 08:21:27] [INFO ] Computed 12 place invariants in 8 ms
[2022-06-11 08:21:27] [INFO ] Implicit Places using invariants in 448 ms returned []
// Phase 1: matrix 1341 rows 87 cols
[2022-06-11 08:21:27] [INFO ] Computed 12 place invariants in 8 ms
[2022-06-11 08:21:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 08:21:28] [INFO ] Implicit Places using invariants and state equation in 840 ms returned []
Implicit Place search using SMT with State Equation took 1290 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 87/347 places, 1341/1774 transitions.
Finished structural reductions, in 2 iterations. Remains : 87/347 places, 1341/1774 transitions.
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p3) (NOT p0)) (AND (NOT p3) (NOT p1))), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p3) p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) p0 (NOT p1)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p3:(AND (EQ s1 1) (EQ s10 1) (EQ s76 1) (EQ s82 1)), p2:(AND (EQ s18 1) (EQ s24 1) (EQ s30 1) (EQ s36 1) (EQ s42 1) (EQ s46 1) (EQ s53 1) (EQ s62 1) (EQ s...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 31 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-10b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10b-LTLFireability-12 finished in 3233 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0)&&p1) U (p2 U X(p3))))'
Support contains 17 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Applied a total of 0 rules in 12 ms. Remains 347 /347 variables (removed 0) and now considering 1774/1774 (removed 0) transitions.
// Phase 1: matrix 1774 rows 347 cols
[2022-06-11 08:21:28] [INFO ] Computed 15 place invariants in 12 ms
[2022-06-11 08:21:29] [INFO ] Implicit Places using invariants in 483 ms returned []
// Phase 1: matrix 1774 rows 347 cols
[2022-06-11 08:21:29] [INFO ] Computed 15 place invariants in 12 ms
[2022-06-11 08:21:30] [INFO ] Implicit Places using invariants and state equation in 1224 ms returned []
Implicit Place search using SMT with State Equation took 1708 ms to find 0 implicit places.
// Phase 1: matrix 1774 rows 347 cols
[2022-06-11 08:21:30] [INFO ] Computed 15 place invariants in 14 ms
[2022-06-11 08:21:32] [INFO ] Dead Transitions using invariants and state equation in 1637 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 347/347 places, 1774/1774 transitions.
Stuttering acceptance computed with spot in 269 ms :[(NOT p3), (NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (NOT p3), true, (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p2) (NOT p0))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=0 dest: 2}, { cond=(AND p1 p0), acceptance={} source=0 dest: 3}, { cond=(OR (AND p2 (NOT p1)) (AND p2 (NOT p0))), acceptance={} source=0 dest: 4}], [{ cond=(NOT p3), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=2 dest: 5}, { cond=(AND p0 (NOT p3)), acceptance={} source=2 dest: 6}], [{ cond=(OR (AND (NOT p2) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p0) (NOT p3))), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1 p0 (NOT p3)), acceptance={0} source=3 dest: 2}, { cond=(AND p1 p0 (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(OR (AND p2 (NOT p1) (NOT p3)) (AND p2 (NOT p0) (NOT p3))), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=4 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(AND (EQ s62 1) (EQ s92 1) (EQ s112 1) (EQ s137 1) (EQ s167 1) (EQ s187 1) (EQ s217 1) (EQ s237 1) (EQ s262 1) (EQ s287 1) (EQ s314 1)), p1:(NEQ s228 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-10b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10b-LTLFireability-13 finished in 3661 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(F((F(G(X(X(p1))))&&p0))))))'
Support contains 16 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Applied a total of 0 rules in 13 ms. Remains 347 /347 variables (removed 0) and now considering 1774/1774 (removed 0) transitions.
// Phase 1: matrix 1774 rows 347 cols
[2022-06-11 08:21:32] [INFO ] Computed 15 place invariants in 12 ms
[2022-06-11 08:21:32] [INFO ] Implicit Places using invariants in 356 ms returned []
// Phase 1: matrix 1774 rows 347 cols
[2022-06-11 08:21:32] [INFO ] Computed 15 place invariants in 13 ms
[2022-06-11 08:21:34] [INFO ] Implicit Places using invariants and state equation in 1397 ms returned []
Implicit Place search using SMT with State Equation took 1762 ms to find 0 implicit places.
// Phase 1: matrix 1774 rows 347 cols
[2022-06-11 08:21:34] [INFO ] Computed 15 place invariants in 13 ms
[2022-06-11 08:21:35] [INFO ] Dead Transitions using invariants and state equation in 1617 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 347/347 places, 1774/1774 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s62 1) (EQ s92 1) (EQ s112 1) (EQ s137 1) (EQ s167 1) (EQ s187 1) (EQ s212 1) (EQ s237 1) (EQ s267 1) (EQ s292 1) (EQ s314 1)), p1:(OR (EQ s62...], 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 281 steps with 1 reset in 2 ms.
FORMULA AutonomousCar-PT-10b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10b-LTLFireability-14 finished in 3590 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 15 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Applied a total of 0 rules in 12 ms. Remains 347 /347 variables (removed 0) and now considering 1774/1774 (removed 0) transitions.
// Phase 1: matrix 1774 rows 347 cols
[2022-06-11 08:21:36] [INFO ] Computed 15 place invariants in 13 ms
[2022-06-11 08:21:36] [INFO ] Implicit Places using invariants in 410 ms returned []
// Phase 1: matrix 1774 rows 347 cols
[2022-06-11 08:21:36] [INFO ] Computed 15 place invariants in 12 ms
[2022-06-11 08:21:37] [INFO ] Implicit Places using invariants and state equation in 1344 ms returned []
Implicit Place search using SMT with State Equation took 1760 ms to find 0 implicit places.
// Phase 1: matrix 1774 rows 347 cols
[2022-06-11 08:21:37] [INFO ] Computed 15 place invariants in 13 ms
[2022-06-11 08:21:39] [INFO ] Dead Transitions using invariants and state equation in 1376 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 347/347 places, 1774/1774 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s67 1) (EQ s87 1) (EQ s117 1) (EQ s142 1) (EQ s167 1) (EQ s192 1) (EQ s212 1) (EQ s242 1) (EQ s262 1) (EQ s287 1) (EQ s314 1) (OR (EQ s67 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-10b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10b-LTLFireability-15 finished in 3266 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Found a SL insensitive property : AutonomousCar-PT-10b-LTLFireability-00
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Support contains 11 out of 347 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 347/347 places, 1774/1774 transitions.
Graph (trivial) has 310 edges and 347 vertex of which 4 / 347 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 125 transitions
Trivial Post-agglo rules discarded 125 transitions
Performed 125 trivial Post agglomeration. Transition count delta: 125
Iterating post reduction 0 with 125 rules applied. Total rules applied 126 place count 344 transition count 1646
Reduce places removed 125 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 182 rules applied. Total rules applied 308 place count 219 transition count 1589
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 342 place count 185 transition count 1589
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 342 place count 185 transition count 1583
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 354 place count 179 transition count 1583
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 355 place count 178 transition count 1582
Iterating global reduction 3 with 1 rules applied. Total rules applied 356 place count 178 transition count 1582
Performed 71 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 498 place count 107 transition count 1510
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 499 place count 107 transition count 1509
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 514 place count 92 transition count 1364
Iterating global reduction 4 with 15 rules applied. Total rules applied 529 place count 92 transition count 1364
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 539 place count 92 transition count 1354
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 543 place count 90 transition count 1352
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 545 place count 88 transition count 1350
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 546 place count 87 transition count 1350
Applied a total of 546 rules in 239 ms. Remains 87 /347 variables (removed 260) and now considering 1350/1774 (removed 424) transitions.
// Phase 1: matrix 1350 rows 87 cols
[2022-06-11 08:21:39] [INFO ] Computed 13 place invariants in 9 ms
[2022-06-11 08:21:40] [INFO ] Implicit Places using invariants in 394 ms returned []
// Phase 1: matrix 1350 rows 87 cols
[2022-06-11 08:21:40] [INFO ] Computed 13 place invariants in 8 ms
[2022-06-11 08:21:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-11 08:21:41] [INFO ] Implicit Places using invariants and state equation in 918 ms returned [82, 86]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1319 ms to find 2 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 85/347 places, 1350/1774 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 84 transition count 1349
Applied a total of 2 rules in 47 ms. Remains 84 /85 variables (removed 1) and now considering 1349/1350 (removed 1) transitions.
// Phase 1: matrix 1349 rows 84 cols
[2022-06-11 08:21:41] [INFO ] Computed 11 place invariants in 8 ms
[2022-06-11 08:21:41] [INFO ] Implicit Places using invariants in 380 ms returned []
// Phase 1: matrix 1349 rows 84 cols
[2022-06-11 08:21:41] [INFO ] Computed 11 place invariants in 8 ms
[2022-06-11 08:21:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 08:21:42] [INFO ] Implicit Places using invariants and state equation in 893 ms returned []
Implicit Place search using SMT with State Equation took 1298 ms to find 0 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 2 : 84/347 places, 1349/1774 transitions.
Finished structural reductions, in 2 iterations. Remains : 84/347 places, 1349/1774 transitions.
Running random walk in product with property : AutonomousCar-PT-10b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (NEQ s16 1) (NEQ s20 1) (NEQ s29 1) (NEQ s35 1) (NEQ s39 1) (NEQ s48 1) (NEQ s52 1) (NEQ s59 1) (NEQ s66 1) (NEQ s73 1) (NEQ s80 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, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 201 reset in 151 ms.
Product exploration explored 100000 steps with 3841 reset in 1409 ms.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 158 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 390 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 1) seen :0
Finished Best-First random walk after 5194 steps, including 15 resets, run visited all 1 properties in 14 ms. (steps per millisecond=371 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 180 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0)]
Support contains 11 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 1349/1349 transitions.
Applied a total of 0 rules in 6 ms. Remains 84 /84 variables (removed 0) and now considering 1349/1349 (removed 0) transitions.
// Phase 1: matrix 1349 rows 84 cols
[2022-06-11 08:21:44] [INFO ] Computed 11 place invariants in 8 ms
[2022-06-11 08:21:45] [INFO ] Implicit Places using invariants in 394 ms returned []
// Phase 1: matrix 1349 rows 84 cols
[2022-06-11 08:21:45] [INFO ] Computed 11 place invariants in 16 ms
[2022-06-11 08:21:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 08:21:46] [INFO ] Implicit Places using invariants and state equation in 916 ms returned []
Implicit Place search using SMT with State Equation took 1330 ms to find 0 implicit places.
// Phase 1: matrix 1349 rows 84 cols
[2022-06-11 08:21:46] [INFO ] Computed 11 place invariants in 9 ms
[2022-06-11 08:21:46] [INFO ] Dead Transitions using invariants and state equation in 764 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/84 places, 1349/1349 transitions.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 157 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 384 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 487739 steps, run timeout after 3001 ms. (steps per millisecond=162 ) properties seen :{}
Probabilistic random walk after 487739 steps, saw 78512 distinct states, run finished after 3001 ms. (steps per millisecond=162 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1349 rows 84 cols
[2022-06-11 08:21:50] [INFO ] Computed 11 place invariants in 7 ms
[2022-06-11 08:21:50] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2022-06-11 08:21:51] [INFO ] After 527ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-11 08:21:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 08:21:51] [INFO ] After 38ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2022-06-11 08:21:51] [INFO ] After 104ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2022-06-11 08:21:51] [INFO ] After 717ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 11 out of 84 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 84/84 places, 1349/1349 transitions.
Graph (complete) has 1045 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 83 transition count 1346
Free-agglomeration rule applied 16 times.
Iterating global reduction 1 with 16 rules applied. Total rules applied 19 place count 83 transition count 1330
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 35 place count 67 transition count 1330
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 67 transition count 1331
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 37 place count 66 transition count 1331
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 43 place count 66 transition count 1331
Applied a total of 43 rules in 342 ms. Remains 66 /84 variables (removed 18) and now considering 1331/1349 (removed 18) transitions.
Finished structural reductions, in 1 iterations. Remains : 66/84 places, 1331/1349 transitions.
Incomplete random walk after 10000 steps, including 33 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 497671 steps, run timeout after 3001 ms. (steps per millisecond=165 ) properties seen :{}
Probabilistic random walk after 497671 steps, saw 71224 distinct states, run finished after 3005 ms. (steps per millisecond=165 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1331 rows 66 cols
[2022-06-11 08:21:54] [INFO ] Computed 11 place invariants in 6 ms
[2022-06-11 08:21:54] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2022-06-11 08:21:55] [INFO ] After 507ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-11 08:21:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-11 08:21:55] [INFO ] After 37ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :1
[2022-06-11 08:21:55] [INFO ] After 101ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2022-06-11 08:21:55] [INFO ] After 697ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 11 out of 66 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 66/66 places, 1331/1331 transitions.
Applied a total of 0 rules in 80 ms. Remains 66 /66 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 1331/1331 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 66/66 places, 1331/1331 transitions.
Applied a total of 0 rules in 79 ms. Remains 66 /66 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 66 cols
[2022-06-11 08:21:55] [INFO ] Computed 11 place invariants in 7 ms
[2022-06-11 08:21:56] [INFO ] Implicit Places using invariants in 358 ms returned []
// Phase 1: matrix 1331 rows 66 cols
[2022-06-11 08:21:56] [INFO ] Computed 11 place invariants in 6 ms
[2022-06-11 08:21:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-11 08:21:56] [INFO ] Implicit Places using invariants and state equation in 840 ms returned []
Implicit Place search using SMT with State Equation took 1212 ms to find 0 implicit places.
[2022-06-11 08:21:57] [INFO ] Redundant transitions in 473 ms returned []
// Phase 1: matrix 1331 rows 66 cols
[2022-06-11 08:21:57] [INFO ] Computed 11 place invariants in 6 ms
[2022-06-11 08:21:58] [INFO ] Dead Transitions using invariants and state equation in 761 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 1331/1331 transitions.
Applied a total of 0 rules in 85 ms. Remains 66 /66 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1331 rows 66 cols
[2022-06-11 08:21:58] [INFO ] Computed 11 place invariants in 6 ms
[2022-06-11 08:21:58] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-06-11 08:21:58] [INFO ] After 532ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-11 08:21:58] [INFO ] After 597ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2022-06-11 08:21:58] [INFO ] After 683ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
[2022-06-11 08:21:59] [INFO ] Flatten gal took : 251 ms
[2022-06-11 08:21:59] [INFO ] Flatten gal took : 246 ms
[2022-06-11 08:21:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4696777656772126137.gal : 23 ms
[2022-06-11 08:21:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11385322558935538190.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms17582760693737167250;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4696777656772126137.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11385322558935538190.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality11385322558935538190.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 32
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :33 after 43
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :43 after 813
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :813 after 7804
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :7804 after 9664
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :9664 after 11252
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :11252 after 48132
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :48132 after 53856
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :53856 after 172543
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :172543 after 1.97375e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.97375e+06 after 1.36284e+07
Detected timeout of ITS tools.
[2022-06-11 08:22:14] [INFO ] Flatten gal took : 276 ms
[2022-06-11 08:22:14] [INFO ] Applying decomposition
[2022-06-11 08:22:15] [INFO ] Flatten gal took : 239 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2656370917143928298.txt' '-o' '/tmp/graph2656370917143928298.bin' '-w' '/tmp/graph2656370917143928298.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2656370917143928298.bin' '-l' '-1' '-v' '-w' '/tmp/graph2656370917143928298.weights' '-q' '0' '-e' '0.001'
[2022-06-11 08:22:15] [INFO ] Decomposing Gal with order
[2022-06-11 08:22:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 08:22:16] [INFO ] Removed a total of 12190 redundant transitions.
[2022-06-11 08:22:16] [INFO ] Flatten gal took : 409 ms
[2022-06-11 08:22:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 84 labels/synchronizations in 75 ms.
[2022-06-11 08:22:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16493599487448156475.gal : 17 ms
[2022-06-11 08:22:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8290927507924417331.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms17582760693737167250;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16493599487448156475.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8290927507924417331.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality8290927507924417331.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :34 after 62272
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3068449390886777139
[2022-06-11 08:22:31] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3068449390886777139
Running compilation step : cd /tmp/ltsmin3068449390886777139;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3068449390886777139;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3068449390886777139;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 161 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 62 reset in 103 ms.
Product exploration explored 100000 steps with 634 reset in 375 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 143 ms :[true, (NOT p0), (NOT p0)]
Support contains 11 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 1349/1349 transitions.
Applied a total of 0 rules in 152 ms. Remains 84 /84 variables (removed 0) and now considering 1349/1349 (removed 0) transitions.
[2022-06-11 08:22:36] [INFO ] Redundant transitions in 170 ms returned [1086]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1348 rows 84 cols
[2022-06-11 08:22:36] [INFO ] Computed 11 place invariants in 8 ms
[2022-06-11 08:22:36] [INFO ] Dead Transitions using invariants and state equation in 765 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/84 places, 1348/1349 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 84 transition count 1350
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 108 ms. Remains 84 /84 variables (removed 0) and now considering 1350/1348 (removed -2) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 84/84 places, 1350/1349 transitions.
Finished structural reductions, in 2 iterations. Remains : 84/84 places, 1350/1349 transitions.
Product exploration explored 100000 steps with 871 reset in 418 ms.
Product exploration explored 100000 steps with 327 reset in 223 ms.
Built C files in :
/tmp/ltsmin11803416972470568143
[2022-06-11 08:22:37] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11803416972470568143
Running compilation step : cd /tmp/ltsmin11803416972470568143;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11803416972470568143;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11803416972470568143;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 11 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 1349/1349 transitions.
Applied a total of 0 rules in 7 ms. Remains 84 /84 variables (removed 0) and now considering 1349/1349 (removed 0) transitions.
// Phase 1: matrix 1349 rows 84 cols
[2022-06-11 08:22:40] [INFO ] Computed 11 place invariants in 8 ms
[2022-06-11 08:22:41] [INFO ] Implicit Places using invariants in 446 ms returned []
// Phase 1: matrix 1349 rows 84 cols
[2022-06-11 08:22:41] [INFO ] Computed 11 place invariants in 8 ms
[2022-06-11 08:22:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 08:22:42] [INFO ] Implicit Places using invariants and state equation in 925 ms returned []
Implicit Place search using SMT with State Equation took 1396 ms to find 0 implicit places.
// Phase 1: matrix 1349 rows 84 cols
[2022-06-11 08:22:42] [INFO ] Computed 11 place invariants in 8 ms
[2022-06-11 08:22:43] [INFO ] Dead Transitions using invariants and state equation in 955 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/84 places, 1349/1349 transitions.
Built C files in :
/tmp/ltsmin4522740228863814955
[2022-06-11 08:22:43] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4522740228863814955
Running compilation step : cd /tmp/ltsmin4522740228863814955;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4522740228863814955;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4522740228863814955;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-11 08:22:46] [INFO ] Flatten gal took : 257 ms
[2022-06-11 08:22:46] [INFO ] Flatten gal took : 251 ms
[2022-06-11 08:22:46] [INFO ] Time to serialize gal into /tmp/LTL11979593736886070238.gal : 22 ms
[2022-06-11 08:22:46] [INFO ] Time to serialize properties into /tmp/LTL3650123858856727387.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11979593736886070238.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3650123858856727387.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1197959...267
Read 1 LTL properties
Checking formula 0 : !((X(G("(((((p74!=1)||(p99!=1))||((p136!=1)||(p167!=1)))||(((p192!=1)||(p229!=1))||((p254!=1)||(p285!=1))))||(((p316!=1)||(p347!=1))||...171
Formula 0 simplified : !XG"(((((p74!=1)||(p99!=1))||((p136!=1)||(p167!=1)))||(((p192!=1)||(p229!=1))||((p254!=1)||(p285!=1))))||(((p316!=1)||(p347!=1))||(p...165
Detected timeout of ITS tools.
[2022-06-11 08:23:02] [INFO ] Flatten gal took : 294 ms
[2022-06-11 08:23:02] [INFO ] Applying decomposition
[2022-06-11 08:23:02] [INFO ] Flatten gal took : 237 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1836006552412978374.txt' '-o' '/tmp/graph1836006552412978374.bin' '-w' '/tmp/graph1836006552412978374.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1836006552412978374.bin' '-l' '-1' '-v' '-w' '/tmp/graph1836006552412978374.weights' '-q' '0' '-e' '0.001'
[2022-06-11 08:23:02] [INFO ] Decomposing Gal with order
[2022-06-11 08:23:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 08:23:03] [INFO ] Removed a total of 11992 redundant transitions.
[2022-06-11 08:23:03] [INFO ] Flatten gal took : 390 ms
[2022-06-11 08:23:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 89 labels/synchronizations in 110 ms.
[2022-06-11 08:23:03] [INFO ] Time to serialize gal into /tmp/LTL10220101057780780588.gal : 18 ms
[2022-06-11 08:23:03] [INFO ] Time to serialize properties into /tmp/LTL5463004238738783955.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10220101057780780588.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5463004238738783955.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1022010...246
Read 1 LTL properties
Checking formula 0 : !((X(G("(((((i0.i1.u1.p74!=1)||(i0.i1.u2.p99!=1))||((i0.i0.u5.p136!=1)||(i0.i0.u7.p167!=1)))||(((i0.i0.u8.p192!=1)||(i0.i1.u11.p229!=1...275
Formula 0 simplified : !XG"(((((i0.i1.u1.p74!=1)||(i0.i1.u2.p99!=1))||((i0.i0.u5.p136!=1)||(i0.i0.u7.p167!=1)))||(((i0.i0.u8.p192!=1)||(i0.i1.u11.p229!=1))...269
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7849446721662469262
[2022-06-11 08:23:18] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7849446721662469262
Running compilation step : cd /tmp/ltsmin7849446721662469262;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7849446721662469262;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7849446721662469262;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property AutonomousCar-PT-10b-LTLFireability-00 finished in 102457 ms.
[2022-06-11 08:23:22] [INFO ] Flatten gal took : 231 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin85392798756808346
[2022-06-11 08:23:22] [INFO ] Too many transitions (1774) to apply POR reductions. Disabling POR matrices.
[2022-06-11 08:23:22] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin85392798756808346
Running compilation step : cd /tmp/ltsmin85392798756808346;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-06-11 08:23:22] [INFO ] Applying decomposition
[2022-06-11 08:23:22] [INFO ] Flatten gal took : 194 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10410285912508745928.txt' '-o' '/tmp/graph10410285912508745928.bin' '-w' '/tmp/graph10410285912508745928.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10410285912508745928.bin' '-l' '-1' '-v' '-w' '/tmp/graph10410285912508745928.weights' '-q' '0' '-e' '0.001'
[2022-06-11 08:23:23] [INFO ] Decomposing Gal with order
[2022-06-11 08:23:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 08:23:23] [INFO ] Removed a total of 12151 redundant transitions.
[2022-06-11 08:23:24] [INFO ] Flatten gal took : 494 ms
[2022-06-11 08:23:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 84 labels/synchronizations in 56 ms.
[2022-06-11 08:23:24] [INFO ] Time to serialize gal into /tmp/LTLFireability6888898622570641711.gal : 8 ms
[2022-06-11 08:23:24] [INFO ] Time to serialize properties into /tmp/LTLFireability17106502980114695517.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6888898622570641711.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17106502980114695517.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 1 LTL properties
Checking formula 0 : !((X(G("(((((i6.u19.p74!=1)||(i6.u24.p99!=1))||((i6.u34.p136!=1)||(i6.u43.p167!=1)))||(((i6.u49.p192!=1)||(i6.u59.p229!=1))||((i6.u66....248
Formula 0 simplified : !XG"(((((i6.u19.p74!=1)||(i6.u24.p99!=1))||((i6.u34.p136!=1)||(i6.u43.p167!=1)))||(((i6.u49.p192!=1)||(i6.u59.p229!=1))||((i6.u66.p2...242
Compilation finished in 11489 ms.
Running link step : cd /tmp/ltsmin85392798756808346;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 81 ms.
Running LTSmin : cd /tmp/ltsmin85392798756808346;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-06-11 08:45:32] [INFO ] Applying decomposition
[2022-06-11 08:45:33] [INFO ] Flatten gal took : 426 ms
[2022-06-11 08:45:33] [INFO ] Decomposing Gal with order
[2022-06-11 08:45:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 08:45:35] [INFO ] Removed a total of 12796 redundant transitions.
[2022-06-11 08:45:35] [INFO ] Flatten gal took : 1416 ms
[2022-06-11 08:45:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 492 labels/synchronizations in 166 ms.
[2022-06-11 08:45:35] [INFO ] Time to serialize gal into /tmp/LTLFireability6092662794404601108.gal : 3 ms
[2022-06-11 08:45:35] [INFO ] Time to serialize properties into /tmp/LTLFireability9852681381379651408.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6092662794404601108.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9852681381379651408.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...267
Read 1 LTL properties
Checking formula 0 : !((X(G("(((((i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u15.p74!=1)||(i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u16.p99!=1))||((i1.i0.i0.i0.i0.i0.i0.i0.i...443
Formula 0 simplified : !XG"(((((i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u15.p74!=1)||(i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u16.p99!=1))||((i1.i0.i0.i0.i0.i0.i0.i0.i0....437
Reverse transition relation is NOT exact ! Due to transitions t373, t413, t603, i0.u2.t330, i0.u3.t328, i1.t1771, i1.i0.u25.t33, i1.i0.u25.t36, i1.i0.u25.t...2256
Computing Next relation with stutter on 3.45702e+07 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
7641 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,76.492,1003772,1,0,1.54983e+06,218615,7307,6.14028e+06,1427,1.13601e+06,638764
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutonomousCar-PT-10b-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1916400 ms.

BK_STOP 1654937337657

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="AutonomousCar-PT-10b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is AutonomousCar-PT-10b, 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 r294-smll-165463873100564"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-10b.tgz
mv AutonomousCar-PT-10b 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 ;