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.r078-tall-165260110700731.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 FamilyReunion-PT-L00050M0005C002P002G001, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260110700731
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.4M
-rw-r--r-- 1 mcc users 101K Apr 30 08:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 605K Apr 30 08:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 278K Apr 30 08:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 1002K Apr 30 08:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 64K May 9 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 277K May 9 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 80K May 9 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 229K May 9 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K May 9 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 26K May 9 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 24 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 4.7M May 10 09:33 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 FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-00
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-01
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-02
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-03
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-04
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-05
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-06
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-07
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-08
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-09
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-10
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-11
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-12
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-13
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-14
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652722438173

Running Version 202205111006
[2022-05-16 17:33:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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-05-16 17:33:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 17:33:59] [INFO ] Load time of PNML (sax parser for PT used): 353 ms
[2022-05-16 17:33:59] [INFO ] Transformed 12194 places.
[2022-05-16 17:33:59] [INFO ] Transformed 10560 transitions.
[2022-05-16 17:33:59] [INFO ] Parsed PT model containing 12194 places and 10560 transitions in 511 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 263 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Reduce places removed 17 places and 0 transitions.
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 2480 out of 12177 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12177/12177 places, 10560/10560 transitions.
Reduce places removed 163 places and 0 transitions.
Discarding 1224 places :
Implicit places reduction removed 1224 places
Iterating post reduction 0 with 1387 rules applied. Total rules applied 1387 place count 10790 transition count 10560
Discarding 761 places :
Symmetric choice reduction at 1 with 761 rule applications. Total rules 2148 place count 10029 transition count 9799
Iterating global reduction 1 with 761 rules applied. Total rules applied 2909 place count 10029 transition count 9799
Discarding 49 places :
Symmetric choice reduction at 1 with 49 rule applications. Total rules 2958 place count 9980 transition count 9750
Iterating global reduction 1 with 49 rules applied. Total rules applied 3007 place count 9980 transition count 9750
Applied a total of 3007 rules in 5129 ms. Remains 9980 /12177 variables (removed 2197) and now considering 9750/10560 (removed 810) transitions.
// Phase 1: matrix 9750 rows 9980 cols
[2022-05-16 17:34:06] [INFO ] Computed 1436 place invariants in 639 ms
[2022-05-16 17:34:07] [INFO ] Implicit Places using invariants in 1753 ms returned []
// Phase 1: matrix 9750 rows 9980 cols
[2022-05-16 17:34:07] [INFO ] Computed 1436 place invariants in 223 ms
[2022-05-16 17:34:08] [INFO ] Implicit Places using invariants and state equation in 1108 ms returned []
Implicit Place search using SMT with State Equation took 2898 ms to find 0 implicit places.
// Phase 1: matrix 9750 rows 9980 cols
[2022-05-16 17:34:09] [INFO ] Computed 1436 place invariants in 200 ms
[2022-05-16 17:34:10] [INFO ] Dead Transitions using invariants and state equation in 1169 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9980/12177 places, 9750/10560 transitions.
Finished structural reductions, in 1 iterations. Remains : 9980/12177 places, 9750/10560 transitions.
Support contains 2480 out of 9980 places after structural reductions.
[2022-05-16 17:34:10] [INFO ] Flatten gal took : 502 ms
[2022-05-16 17:34:11] [INFO ] Flatten gal took : 328 ms
[2022-05-16 17:34:11] [INFO ] Input system was already deterministic with 9750 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 521 ms. (steps per millisecond=19 ) properties (out of 24) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 9750 rows 9980 cols
[2022-05-16 17:34:12] [INFO ] Computed 1436 place invariants in 232 ms
[2022-05-16 17:34:14] [INFO ] [Real]Absence check using 1 positive place invariants in 11 ms returned sat
[2022-05-16 17:34:15] [INFO ] [Real]Absence check using 1 positive and 1435 generalized place invariants in 567 ms returned sat
[2022-05-16 17:34:35] [INFO ] After 19519ms SMT Verify possible using state equation in real domain returned unsat :2 sat :2
[2022-05-16 17:34:37] [INFO ] After 21049ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 688 ms.
[2022-05-16 17:34:37] [INFO ] After 24683ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :2
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 73 ms.
Support contains 102 out of 9980 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 9980/9980 places, 9750/9750 transitions.
Graph (complete) has 14900 edges and 9980 vertex of which 9963 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.24 ms
Discarding 17 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Discarding 612 places :
Implicit places reduction removed 612 places
Drop transitions removed 5558 transitions
Trivial Post-agglo rules discarded 5558 transitions
Performed 5558 trivial Post agglomeration. Transition count delta: 5558
Iterating post reduction 0 with 6170 rules applied. Total rules applied 6171 place count 9351 transition count 4185
Reduce places removed 5558 places and 0 transitions.
Iterating post reduction 1 with 5558 rules applied. Total rules applied 11729 place count 3793 transition count 4185
Performed 612 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 612 Pre rules applied. Total rules applied 11729 place count 3793 transition count 3573
Deduced a syphon composed of 612 places in 3 ms
Ensure Unique test removed 306 places
Reduce places removed 918 places and 0 transitions.
Iterating global reduction 2 with 1530 rules applied. Total rules applied 13259 place count 2875 transition count 3573
Drop transitions removed 204 transitions
Trivial Post-agglo rules discarded 204 transitions
Performed 204 trivial Post agglomeration. Transition count delta: 204
Iterating post reduction 2 with 204 rules applied. Total rules applied 13463 place count 2875 transition count 3369
Reduce places removed 204 places and 0 transitions.
Iterating post reduction 3 with 204 rules applied. Total rules applied 13667 place count 2671 transition count 3369
Discarding 568 places :
Symmetric choice reduction at 4 with 568 rule applications. Total rules 14235 place count 2103 transition count 2500
Iterating global reduction 4 with 568 rules applied. Total rules applied 14803 place count 2103 transition count 2500
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 153 places :
Implicit places reduction removed 153 places
Drop transitions removed 307 transitions
Trivial Post-agglo rules discarded 307 transitions
Performed 307 trivial Post agglomeration. Transition count delta: 307
Iterating post reduction 4 with 562 rules applied. Total rules applied 15365 place count 1950 transition count 2091
Reduce places removed 307 places and 0 transitions.
Iterating post reduction 5 with 307 rules applied. Total rules applied 15672 place count 1643 transition count 2091
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 102 Pre rules applied. Total rules applied 15672 place count 1643 transition count 1989
Deduced a syphon composed of 102 places in 2 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 6 with 204 rules applied. Total rules applied 15876 place count 1541 transition count 1989
Discarding 260 places :
Symmetric choice reduction at 6 with 260 rule applications. Total rules 16136 place count 1281 transition count 1479
Iterating global reduction 6 with 260 rules applied. Total rules applied 16396 place count 1281 transition count 1479
Ensure Unique test removed 459 transitions
Reduce isomorphic transitions removed 459 transitions.
Discarding 204 places :
Implicit places reduction removed 204 places
Drop transitions removed 255 transitions
Trivial Post-agglo rules discarded 255 transitions
Performed 255 trivial Post agglomeration. Transition count delta: 255
Iterating post reduction 6 with 918 rules applied. Total rules applied 17314 place count 1077 transition count 765
Reduce places removed 255 places and 0 transitions.
Iterating post reduction 7 with 255 rules applied. Total rules applied 17569 place count 822 transition count 765
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 51 Pre rules applied. Total rules applied 17569 place count 822 transition count 714
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 8 with 102 rules applied. Total rules applied 17671 place count 771 transition count 714
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 17672 place count 770 transition count 663
Iterating global reduction 8 with 1 rules applied. Total rules applied 17673 place count 770 transition count 663
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 8 with 51 rules applied. Total rules applied 17724 place count 719 transition count 663
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 51 Pre rules applied. Total rules applied 17724 place count 719 transition count 612
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 9 with 102 rules applied. Total rules applied 17826 place count 668 transition count 612
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Deduced a syphon composed of 102 places in 0 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 9 with 204 rules applied. Total rules applied 18030 place count 566 transition count 510
Free-agglomeration rule (complex) applied 102 times.
Iterating global reduction 9 with 102 rules applied. Total rules applied 18132 place count 566 transition count 408
Ensure Unique test removed 51 places
Reduce places removed 153 places and 0 transitions.
Iterating post reduction 9 with 153 rules applied. Total rules applied 18285 place count 413 transition count 408
Reduce places removed 51 places and 51 transitions.
Iterating global reduction 10 with 51 rules applied. Total rules applied 18336 place count 362 transition count 357
Applied a total of 18336 rules in 774 ms. Remains 362 /9980 variables (removed 9618) and now considering 357/9750 (removed 9393) transitions.
Finished structural reductions, in 1 iterations. Remains : 362/9980 places, 357/9750 transitions.
Finished random walk after 47 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=23 )
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 9980 stabilizing places and 9750 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 9980 transition count 9750
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&p1)))'
Support contains 153 out of 9980 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9980/9980 places, 9750/9750 transitions.
Reduce places removed 10 places and 0 transitions.
Discarding 612 places :
Implicit places reduction removed 612 places
Iterating post reduction 0 with 622 rules applied. Total rules applied 622 place count 9358 transition count 9750
Discarding 822 places :
Symmetric choice reduction at 1 with 822 rule applications. Total rules 1444 place count 8536 transition count 8877
Iterating global reduction 1 with 822 rules applied. Total rules applied 2266 place count 8536 transition count 8877
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2317 place count 8485 transition count 8877
Discarding 363 places :
Symmetric choice reduction at 2 with 363 rule applications. Total rules 2680 place count 8122 transition count 8264
Iterating global reduction 2 with 363 rules applied. Total rules applied 3043 place count 8122 transition count 8264
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 102 places :
Implicit places reduction removed 102 places
Iterating post reduction 2 with 204 rules applied. Total rules applied 3247 place count 8020 transition count 8162
Discarding 260 places :
Symmetric choice reduction at 3 with 260 rule applications. Total rules 3507 place count 7760 transition count 7652
Iterating global reduction 3 with 260 rules applied. Total rules applied 3767 place count 7760 transition count 7652
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 102 places :
Implicit places reduction removed 102 places
Iterating post reduction 3 with 204 rules applied. Total rules applied 3971 place count 7658 transition count 7550
Discarding 358 places :
Symmetric choice reduction at 4 with 358 rule applications. Total rules 4329 place count 7300 transition count 7142
Iterating global reduction 4 with 358 rules applied. Total rules applied 4687 place count 7300 transition count 7142
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 4 with 51 rules applied. Total rules applied 4738 place count 7249 transition count 7142
Discarding 255 places :
Symmetric choice reduction at 5 with 255 rule applications. Total rules 4993 place count 6994 transition count 6887
Iterating global reduction 5 with 255 rules applied. Total rules applied 5248 place count 6994 transition count 6887
Discarding 255 places :
Symmetric choice reduction at 5 with 255 rule applications. Total rules 5503 place count 6739 transition count 6632
Iterating global reduction 5 with 255 rules applied. Total rules applied 5758 place count 6739 transition count 6632
Discarding 255 places :
Symmetric choice reduction at 5 with 255 rule applications. Total rules 6013 place count 6484 transition count 6377
Iterating global reduction 5 with 255 rules applied. Total rules applied 6268 place count 6484 transition count 6377
Discarding 255 places :
Symmetric choice reduction at 5 with 255 rule applications. Total rules 6523 place count 6229 transition count 6122
Iterating global reduction 5 with 255 rules applied. Total rules applied 6778 place count 6229 transition count 6122
Discarding 255 places :
Symmetric choice reduction at 5 with 255 rule applications. Total rules 7033 place count 5974 transition count 5867
Iterating global reduction 5 with 255 rules applied. Total rules applied 7288 place count 5974 transition count 5867
Discarding 255 places :
Symmetric choice reduction at 5 with 255 rule applications. Total rules 7543 place count 5719 transition count 5612
Iterating global reduction 5 with 255 rules applied. Total rules applied 7798 place count 5719 transition count 5612
Discarding 255 places :
Symmetric choice reduction at 5 with 255 rule applications. Total rules 8053 place count 5464 transition count 5357
Iterating global reduction 5 with 255 rules applied. Total rules applied 8308 place count 5464 transition count 5357
Discarding 255 places :
Symmetric choice reduction at 5 with 255 rule applications. Total rules 8563 place count 5209 transition count 5102
Iterating global reduction 5 with 255 rules applied. Total rules applied 8818 place count 5209 transition count 5102
Discarding 255 places :
Symmetric choice reduction at 5 with 255 rule applications. Total rules 9073 place count 4954 transition count 4847
Iterating global reduction 5 with 255 rules applied. Total rules applied 9328 place count 4954 transition count 4847
Discarding 255 places :
Symmetric choice reduction at 5 with 255 rule applications. Total rules 9583 place count 4699 transition count 4592
Iterating global reduction 5 with 255 rules applied. Total rules applied 9838 place count 4699 transition count 4592
Discarding 255 places :
Symmetric choice reduction at 5 with 255 rule applications. Total rules 10093 place count 4444 transition count 4337
Iterating global reduction 5 with 255 rules applied. Total rules applied 10348 place count 4444 transition count 4337
Discarding 255 places :
Symmetric choice reduction at 5 with 255 rule applications. Total rules 10603 place count 4189 transition count 4082
Iterating global reduction 5 with 255 rules applied. Total rules applied 10858 place count 4189 transition count 4082
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 5 with 306 rules applied. Total rules applied 11164 place count 4138 transition count 3827
Applied a total of 11164 rules in 13235 ms. Remains 4138 /9980 variables (removed 5842) and now considering 3827/9750 (removed 5923) transitions.
// Phase 1: matrix 3827 rows 4138 cols
[2022-05-16 17:34:52] [INFO ] Computed 464 place invariants in 55 ms
[2022-05-16 17:34:53] [INFO ] Implicit Places using invariants in 1076 ms returned [1723, 2751]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1080 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4136/9980 places, 3827/9750 transitions.
Applied a total of 0 rules in 339 ms. Remains 4136 /4136 variables (removed 0) and now considering 3827/3827 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 4136/9980 places, 3827/9750 transitions.
Stuttering acceptance computed with spot in 533 ms :[true, (OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 2}]], initial=1, aps=[p0:(LEQ 2 (ADD s1941 s1942 s1943 s1944 s1945 s1946 s1947 s1948 s1949 s1950 s1951 s1952 s1953 s1954 s1955 s1956 s1957 s1958 s1959 s1960 s1961 s1962 s1963 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-01 finished in 15275 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((p0 U p1))&&F((X(p1)&&p2)))))'
Support contains 561 out of 9980 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9980/9980 places, 9750/9750 transitions.
Reduce places removed 10 places and 0 transitions.
Discarding 612 places :
Implicit places reduction removed 612 places
Iterating post reduction 0 with 622 rules applied. Total rules applied 622 place count 9358 transition count 9750
Discarding 822 places :
Symmetric choice reduction at 1 with 822 rule applications. Total rules 1444 place count 8536 transition count 8877
Iterating global reduction 1 with 822 rules applied. Total rules applied 2266 place count 8536 transition count 8877
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2317 place count 8485 transition count 8877
Discarding 363 places :
Symmetric choice reduction at 2 with 363 rule applications. Total rules 2680 place count 8122 transition count 8264
Iterating global reduction 2 with 363 rules applied. Total rules applied 3043 place count 8122 transition count 8264
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 102 places :
Implicit places reduction removed 102 places
Iterating post reduction 2 with 204 rules applied. Total rules applied 3247 place count 8020 transition count 8162
Discarding 209 places :
Symmetric choice reduction at 3 with 209 rule applications. Total rules 3456 place count 7811 transition count 7703
Iterating global reduction 3 with 209 rules applied. Total rules applied 3665 place count 7811 transition count 7703
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 102 places :
Implicit places reduction removed 102 places
Iterating post reduction 3 with 204 rules applied. Total rules applied 3869 place count 7709 transition count 7601
Discarding 102 places :
Symmetric choice reduction at 4 with 102 rule applications. Total rules 3971 place count 7607 transition count 7499
Iterating global reduction 4 with 102 rules applied. Total rules applied 4073 place count 7607 transition count 7499
Applied a total of 4073 rules in 5963 ms. Remains 7607 /9980 variables (removed 2373) and now considering 7499/9750 (removed 2251) transitions.
// Phase 1: matrix 7499 rows 7607 cols
[2022-05-16 17:35:00] [INFO ] Computed 566 place invariants in 113 ms
[2022-05-16 17:35:01] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 17:35:02] [INFO ] Implicit Places using invariants in 1936 ms returned [359, 6212]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1943 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 7605/9980 places, 7499/9750 transitions.
Applied a total of 0 rules in 1035 ms. Remains 7605 /7605 variables (removed 0) and now considering 7499/7499 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 7605/9980 places, 7499/9750 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (OR (NOT p2) (NOT p1)), (NOT p1), true]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=p2, acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (OR (LEQ (ADD s3774 s3775 s3776 s3777 s3778 s3779 s3780 s3781 s3782 s3783 s3784 s3785 s3786 s3787 s3788 s3789 s3790 s3791 s3792 s3793 s3794 s3795 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 72145 steps with 44 reset in 1842 ms.
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-02 finished in 11470 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 153 out of 9980 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9980/9980 places, 9750/9750 transitions.
Reduce places removed 10 places and 0 transitions.
Discarding 612 places :
Implicit places reduction removed 612 places
Iterating post reduction 0 with 622 rules applied. Total rules applied 622 place count 9358 transition count 9750
Discarding 771 places :
Symmetric choice reduction at 1 with 771 rule applications. Total rules 1393 place count 8587 transition count 8928
Iterating global reduction 1 with 771 rules applied. Total rules applied 2164 place count 8587 transition count 8928
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2215 place count 8536 transition count 8928
Discarding 363 places :
Symmetric choice reduction at 2 with 363 rule applications. Total rules 2578 place count 8173 transition count 8315
Iterating global reduction 2 with 363 rules applied. Total rules applied 2941 place count 8173 transition count 8315
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 102 places :
Implicit places reduction removed 102 places
Iterating post reduction 2 with 204 rules applied. Total rules applied 3145 place count 8071 transition count 8213
Discarding 209 places :
Symmetric choice reduction at 3 with 209 rule applications. Total rules 3354 place count 7862 transition count 7754
Iterating global reduction 3 with 209 rules applied. Total rules applied 3563 place count 7862 transition count 7754
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 102 places :
Implicit places reduction removed 102 places
Iterating post reduction 3 with 204 rules applied. Total rules applied 3767 place count 7760 transition count 7652
Discarding 357 places :
Symmetric choice reduction at 4 with 357 rule applications. Total rules 4124 place count 7403 transition count 7295
Iterating global reduction 4 with 357 rules applied. Total rules applied 4481 place count 7403 transition count 7295
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 4736 place count 7148 transition count 7040
Iterating global reduction 4 with 255 rules applied. Total rules applied 4991 place count 7148 transition count 7040
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 5246 place count 6893 transition count 6785
Iterating global reduction 4 with 255 rules applied. Total rules applied 5501 place count 6893 transition count 6785
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 5756 place count 6638 transition count 6530
Iterating global reduction 4 with 255 rules applied. Total rules applied 6011 place count 6638 transition count 6530
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 6266 place count 6383 transition count 6275
Iterating global reduction 4 with 255 rules applied. Total rules applied 6521 place count 6383 transition count 6275
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 6776 place count 6128 transition count 6020
Iterating global reduction 4 with 255 rules applied. Total rules applied 7031 place count 6128 transition count 6020
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 7286 place count 5873 transition count 5765
Iterating global reduction 4 with 255 rules applied. Total rules applied 7541 place count 5873 transition count 5765
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 7796 place count 5618 transition count 5510
Iterating global reduction 4 with 255 rules applied. Total rules applied 8051 place count 5618 transition count 5510
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 8306 place count 5363 transition count 5255
Iterating global reduction 4 with 255 rules applied. Total rules applied 8561 place count 5363 transition count 5255
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 8816 place count 5108 transition count 5000
Iterating global reduction 4 with 255 rules applied. Total rules applied 9071 place count 5108 transition count 5000
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 9326 place count 4853 transition count 4745
Iterating global reduction 4 with 255 rules applied. Total rules applied 9581 place count 4853 transition count 4745
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 9836 place count 4598 transition count 4490
Iterating global reduction 4 with 255 rules applied. Total rules applied 10091 place count 4598 transition count 4490
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 10346 place count 4343 transition count 4235
Iterating global reduction 4 with 255 rules applied. Total rules applied 10601 place count 4343 transition count 4235
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 4 with 306 rules applied. Total rules applied 10907 place count 4292 transition count 3980
Applied a total of 10907 rules in 13142 ms. Remains 4292 /9980 variables (removed 5688) and now considering 3980/9750 (removed 5770) transitions.
// Phase 1: matrix 3980 rows 4292 cols
[2022-05-16 17:35:18] [INFO ] Computed 515 place invariants in 49 ms
[2022-05-16 17:35:19] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 17:35:19] [INFO ] Implicit Places using invariants in 1106 ms returned [1092, 1100, 2892]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1111 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4289/9980 places, 3980/9750 transitions.
Applied a total of 0 rules in 325 ms. Remains 4289 /4289 variables (removed 0) and now considering 3980/3980 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 4289/9980 places, 3980/9750 transitions.
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-03 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:(GT (ADD s1121 s1122 s1123 s1124 s1125 s1126 s1127 s1128 s1129 s1130 s1131 s1132 s1133 s1134 s1135 s1136 s1137 s1138 s1139 s1140 s1141 s1142 s1143 s114...], 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 1 ms.
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-03 finished in 14706 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U !(G(p1) U (G(p2)&&p0))))'
Support contains 818 out of 9980 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9980/9980 places, 9750/9750 transitions.
Graph (complete) has 14900 edges and 9980 vertex of which 9812 are kept as prefixes of interest. Removing 168 places using SCC suffix rule.24 ms
Discarding 168 places :
Also discarding 109 output transitions
Drop transitions removed 109 transitions
Reduce places removed 51 places and 51 transitions.
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 306 places :
Implicit places reduction removed 306 places
Drop transitions removed 3518 transitions
Trivial Post-agglo rules discarded 3518 transitions
Performed 3518 trivial Post agglomeration. Transition count delta: 3518
Iterating post reduction 0 with 3926 rules applied. Total rules applied 3927 place count 9455 transition count 5970
Reduce places removed 3518 places and 0 transitions.
Performed 306 Post agglomeration using F-continuation condition.Transition count delta: 306
Iterating post reduction 1 with 3824 rules applied. Total rules applied 7751 place count 5937 transition count 5664
Reduce places removed 306 places and 0 transitions.
Iterating post reduction 2 with 306 rules applied. Total rules applied 8057 place count 5631 transition count 5664
Performed 969 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 969 Pre rules applied. Total rules applied 8057 place count 5631 transition count 4695
Deduced a syphon composed of 969 places in 3 ms
Ensure Unique test removed 612 places
Reduce places removed 1581 places and 0 transitions.
Iterating global reduction 3 with 2550 rules applied. Total rules applied 10607 place count 4050 transition count 4695
Drop transitions removed 204 transitions
Trivial Post-agglo rules discarded 204 transitions
Performed 204 trivial Post agglomeration. Transition count delta: 204
Iterating post reduction 3 with 204 rules applied. Total rules applied 10811 place count 4050 transition count 4491
Reduce places removed 204 places and 0 transitions.
Iterating post reduction 4 with 204 rules applied. Total rules applied 11015 place count 3846 transition count 4491
Discarding 510 places :
Symmetric choice reduction at 5 with 510 rule applications. Total rules 11525 place count 3336 transition count 3981
Iterating global reduction 5 with 510 rules applied. Total rules applied 12035 place count 3336 transition count 3981
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 12036 place count 3336 transition count 3980
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 12037 place count 3335 transition count 3980
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 102 Pre rules applied. Total rules applied 12037 place count 3335 transition count 3878
Deduced a syphon composed of 102 places in 2 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 7 with 204 rules applied. Total rules applied 12241 place count 3233 transition count 3878
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 12245 place count 3229 transition count 3674
Iterating global reduction 7 with 4 rules applied. Total rules applied 12249 place count 3229 transition count 3674
Ensure Unique test removed 204 transitions
Reduce isomorphic transitions removed 204 transitions.
Discarding 153 places :
Implicit places reduction removed 153 places
Drop transitions removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 7 with 510 rules applied. Total rules applied 12759 place count 3076 transition count 3317
Reduce places removed 153 places and 0 transitions.
Iterating post reduction 8 with 153 rules applied. Total rules applied 12912 place count 2923 transition count 3317
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 51 Pre rules applied. Total rules applied 12912 place count 2923 transition count 3266
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 9 with 102 rules applied. Total rules applied 13014 place count 2872 transition count 3266
Performed 204 Post agglomeration using F-continuation condition.Transition count delta: 204
Deduced a syphon composed of 204 places in 1 ms
Reduce places removed 204 places and 0 transitions.
Iterating global reduction 9 with 408 rules applied. Total rules applied 13422 place count 2668 transition count 3062
Applied a total of 13422 rules in 1087 ms. Remains 2668 /9980 variables (removed 7312) and now considering 3062/9750 (removed 6688) transitions.
// Phase 1: matrix 3062 rows 2668 cols
[2022-05-16 17:35:21] [INFO ] Computed 313 place invariants in 26 ms
[2022-05-16 17:35:22] [INFO ] Implicit Places using invariants in 1408 ms returned [51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 459, 919, 920, 921, 922, 923, 924, 925, 926, 927, 928, 929, 930, 931, 932, 933, 934, 935, 936, 937, 938, 939, 940, 941, 942, 943, 944, 945, 946, 947, 948, 949, 950, 951, 952, 953, 954, 955, 956, 957, 958, 959, 960, 961, 962, 963, 964, 965, 966, 967, 968, 969, 1021, 1022, 1023, 1024, 1025, 1026, 1027, 1028, 1029, 1030, 1031, 1032, 1033, 1034, 1035, 1036, 1037, 1038, 1039, 1040, 1041, 1042, 1043, 1044, 1045, 1046, 1047, 1048, 1049, 1050, 1051, 1052, 1053, 1054, 1055, 1056, 1057, 1058, 1059, 1060, 1061, 1062, 1063, 1064, 1065, 1066, 1067, 1068, 1069, 1070, 1071, 1443, 1444, 1445, 1446, 1447, 1448, 1449, 1450, 1451, 1452, 1453, 1454, 1455, 1456, 1457, 1458, 1459, 1460, 1461, 1462, 1463, 1464, 1465, 1466, 1467, 1468, 1469, 1470, 1471, 1472, 1473, 1474, 1475, 1476, 1477, 1478, 1479, 1480, 1481, 1482, 1483, 1484, 1485, 1486, 1487, 1488, 1489, 1490, 1491, 1492, 1493, 1494, 1495, 1496, 1497, 1498, 1499, 1500, 1501, 1502, 1503, 1504, 1505, 1506, 1507, 1508, 1509, 1510, 1511, 1512, 1513, 1514, 1515, 1516, 1517, 1518, 1519, 1520, 1521, 1522, 1523, 1524, 1525, 1526, 1527, 1528, 1529, 1530, 1531, 1532, 1533, 1534, 1535, 1536, 1537, 1538, 1539, 1540, 1541, 1542, 1543, 1544, 2208, 2209, 2210, 2211, 2212, 2213, 2214, 2215, 2216, 2217, 2218, 2219, 2220, 2221, 2222, 2223, 2224, 2225, 2226, 2227, 2228, 2229, 2230, 2231, 2232, 2233, 2234, 2235, 2236, 2237, 2238, 2239, 2240, 2241, 2242, 2243, 2244, 2245, 2246, 2247, 2248, 2249, 2250, 2251, 2252, 2253, 2254, 2255, 2256, 2257, 2258, 2616]
Discarding 308 places :
Implicit Place search using SMT only with invariants took 1428 ms to find 308 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2360/9980 places, 3062/9750 transitions.
Drop transitions removed 357 transitions
Trivial Post-agglo rules discarded 357 transitions
Performed 357 trivial Post agglomeration. Transition count delta: 357
Iterating post reduction 0 with 357 rules applied. Total rules applied 357 place count 2360 transition count 2705
Reduce places removed 357 places and 0 transitions.
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Iterating post reduction 1 with 408 rules applied. Total rules applied 765 place count 2003 transition count 2654
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 2 with 51 rules applied. Total rules applied 816 place count 1952 transition count 2654
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 51 Pre rules applied. Total rules applied 816 place count 1952 transition count 2603
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 918 place count 1901 transition count 2603
Discarding 50 places :
Symmetric choice reduction at 3 with 50 rule applications. Total rules 968 place count 1851 transition count 2503
Iterating global reduction 3 with 50 rules applied. Total rules applied 1018 place count 1851 transition count 2503
Discarding 50 places :
Symmetric choice reduction at 3 with 50 rule applications. Total rules 1068 place count 1801 transition count 2403
Iterating global reduction 3 with 50 rules applied. Total rules applied 1118 place count 1801 transition count 2403
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: -459
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 1220 place count 1750 transition count 2862
Applied a total of 1220 rules in 310 ms. Remains 1750 /2360 variables (removed 610) and now considering 2862/3062 (removed 200) transitions.
// Phase 1: matrix 2862 rows 1750 cols
[2022-05-16 17:35:23] [INFO ] Computed 5 place invariants in 25 ms
[2022-05-16 17:35:23] [INFO ] Implicit Places using invariants in 362 ms returned [409]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 367 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1749/9980 places, 2862/9750 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1749 transition count 2860
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1747 transition count 2860
Applied a total of 4 rules in 52 ms. Remains 1747 /1749 variables (removed 2) and now considering 2860/2862 (removed 2) transitions.
// Phase 1: matrix 2860 rows 1747 cols
[2022-05-16 17:35:23] [INFO ] Computed 4 place invariants in 31 ms
[2022-05-16 17:35:23] [INFO ] Implicit Places using invariants in 260 ms returned []
// Phase 1: matrix 2860 rows 1747 cols
[2022-05-16 17:35:23] [INFO ] Computed 4 place invariants in 23 ms
[2022-05-16 17:35:25] [INFO ] Implicit Places using invariants and state equation in 1364 ms returned []
Implicit Place search using SMT with State Equation took 1648 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1747/9980 places, 2860/9750 transitions.
Finished structural reductions, in 3 iterations. Remains : 1747/9980 places, 2860/9750 transitions.
Stuttering acceptance computed with spot in 139 ms :[(AND p0 p2), (AND p0 p2), (AND p1 p0 p2), (AND p0 p2 p1)]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND p0 p2), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p2), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND p1 p0 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=3 dest: 3}, { cond=(AND p1 p0 p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT 1 (ADD s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 1809 reset in 2474 ms.
Product exploration explored 100000 steps with 1807 reset in 2405 ms.
Computed a total of 1747 stabilizing places and 2860 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1747 transition count 2860
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p2 p1), (X (AND p1 p0 p2)), (X (NOT (AND p1 (NOT p0) p2))), (X (AND p0 p2)), (X p1), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (AND p0 p2))), (F (G p0)), (F (G p2)), (F (G p1))]
False Knowledge obtained : [(X (X (AND p1 p0 p2))), (X (X (NOT (AND p1 p0 p2)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 10 factoid took 1063 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 148 ms :[(AND p0 p2), (AND p0 p2), (AND p1 p0 p2), (AND p0 p2 p1)]
Finished random walk after 346 steps, including 0 resets, run visited all 4 properties in 8 ms. (steps per millisecond=43 )
Knowledge obtained : [(AND p0 p2 p1), (X (AND p1 p0 p2)), (X (NOT (AND p1 (NOT p0) p2))), (X (AND p0 p2)), (X p1), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (AND p0 p2))), (F (G p0)), (F (G p2)), (F (G p1))]
False Knowledge obtained : [(X (X (AND p1 p0 p2))), (X (X (NOT (AND p1 p0 p2)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND p0 p1 p2))), (F (NOT (AND p0 p2))), (F (NOT p1)), (F (AND (NOT p0) p1 p2))]
Knowledge based reduction with 10 factoid took 507 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 178 ms :[(AND p0 p2), (AND p0 p2), (AND p1 p0 p2), (AND p0 p2 p1)]
Stuttering acceptance computed with spot in 180 ms :[(AND p0 p2), (AND p0 p2), (AND p1 p0 p2), (AND p0 p2 p1)]
// Phase 1: matrix 2860 rows 1747 cols
[2022-05-16 17:35:34] [INFO ] Computed 4 place invariants in 29 ms
[2022-05-16 17:35:37] [INFO ] [Real]Absence check using 4 positive place invariants in 42 ms returned sat
[2022-05-16 17:35:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:35:39] [INFO ] [Real]Absence check using state equation in 1661 ms returned sat
[2022-05-16 17:35:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 17:35:42] [INFO ] [Nat]Absence check using 4 positive place invariants in 75 ms returned sat
[2022-05-16 17:35:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 17:35:45] [INFO ] [Nat]Absence check using state equation in 2835 ms returned sat
[2022-05-16 17:35:46] [INFO ] Computed and/alt/rep : 2246/3113/2246 causal constraints (skipped 308 transitions) in 154 ms.
[2022-05-16 17:35:52] [INFO ] Added : 235 causal constraints over 47 iterations in 6496 ms. Result :sat
Could not prove EG (AND p0 p2)
Support contains 818 out of 1747 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1747/1747 places, 2860/2860 transitions.
Applied a total of 0 rules in 23 ms. Remains 1747 /1747 variables (removed 0) and now considering 2860/2860 (removed 0) transitions.
// Phase 1: matrix 2860 rows 1747 cols
[2022-05-16 17:35:52] [INFO ] Computed 4 place invariants in 28 ms
[2022-05-16 17:35:52] [INFO ] Implicit Places using invariants in 257 ms returned []
// Phase 1: matrix 2860 rows 1747 cols
[2022-05-16 17:35:52] [INFO ] Computed 4 place invariants in 35 ms
[2022-05-16 17:35:54] [INFO ] Implicit Places using invariants and state equation in 1321 ms returned []
Implicit Place search using SMT with State Equation took 1581 ms to find 0 implicit places.
// Phase 1: matrix 2860 rows 1747 cols
[2022-05-16 17:35:54] [INFO ] Computed 4 place invariants in 29 ms
[2022-05-16 17:35:55] [INFO ] Dead Transitions using invariants and state equation in 1184 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1747/1747 places, 2860/2860 transitions.
Computed a total of 1747 stabilizing places and 2860 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1747 transition count 2860
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p2 p1), (X (AND p0 p1 p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (AND p0 p2)), (X p1), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND p0 p2))), (F (G p0)), (F (G p2)), (F (G p1))]
False Knowledge obtained : [(X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 10 factoid took 473 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 141 ms :[(AND p0 p2), (AND p0 p2), (AND p1 p0 p2), (AND p0 p2 p1)]
Finished random walk after 321 steps, including 0 resets, run visited all 4 properties in 7 ms. (steps per millisecond=45 )
Knowledge obtained : [(AND p0 p2 p1), (X (AND p0 p1 p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (AND p0 p2)), (X p1), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND p0 p2))), (F (G p0)), (F (G p2)), (F (G p1))]
False Knowledge obtained : [(X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND p0 p1 p2))), (F (NOT (AND p0 p2))), (F (NOT p1)), (F (AND (NOT p0) p1 p2))]
Knowledge based reduction with 10 factoid took 1258 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 141 ms :[(AND p0 p2), (AND p0 p2), (AND p1 p0 p2), (AND p0 p2 p1)]
Stuttering acceptance computed with spot in 133 ms :[(AND p0 p2), (AND p0 p2), (AND p1 p0 p2), (AND p0 p2 p1)]
// Phase 1: matrix 2860 rows 1747 cols
[2022-05-16 17:35:58] [INFO ] Computed 4 place invariants in 32 ms
[2022-05-16 17:36:02] [INFO ] [Real]Absence check using 4 positive place invariants in 48 ms returned sat
[2022-05-16 17:36:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:36:03] [INFO ] [Real]Absence check using state equation in 1724 ms returned sat
[2022-05-16 17:36:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 17:36:07] [INFO ] [Nat]Absence check using 4 positive place invariants in 76 ms returned sat
[2022-05-16 17:36:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 17:36:10] [INFO ] [Nat]Absence check using state equation in 2873 ms returned sat
[2022-05-16 17:36:10] [INFO ] Computed and/alt/rep : 2246/3113/2246 causal constraints (skipped 308 transitions) in 150 ms.
[2022-05-16 17:36:16] [INFO ] Added : 235 causal constraints over 47 iterations in 6456 ms. Result :sat
Could not prove EG (AND p0 p2)
Stuttering acceptance computed with spot in 154 ms :[(AND p0 p2), (AND p0 p2), (AND p1 p0 p2), (AND p0 p2 p1)]
Product exploration explored 100000 steps with 1810 reset in 1808 ms.
Product exploration explored 100000 steps with 1794 reset in 1845 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 199 ms :[(AND p0 p2), (AND p0 p2), (AND p1 p0 p2), (AND p0 p2 p1)]
Support contains 818 out of 1747 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1747/1747 places, 2860/2860 transitions.
Applied a total of 0 rules in 75 ms. Remains 1747 /1747 variables (removed 0) and now considering 2860/2860 (removed 0) transitions.
[2022-05-16 17:36:21] [INFO ] Redundant transitions in 325 ms returned []
// Phase 1: matrix 2860 rows 1747 cols
[2022-05-16 17:36:21] [INFO ] Computed 4 place invariants in 26 ms
[2022-05-16 17:36:22] [INFO ] Dead Transitions using invariants and state equation in 1126 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1747/1747 places, 2860/2860 transitions.
Product exploration explored 100000 steps with 1755 reset in 1975 ms.
Product exploration explored 100000 steps with 1815 reset in 1996 ms.
Built C files in :
/tmp/ltsmin1845014365111160126
[2022-05-16 17:36:26] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1845014365111160126
Running compilation step : cd /tmp/ltsmin1845014365111160126;'/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/ltsmin1845014365111160126;'/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/ltsmin1845014365111160126;'/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 818 out of 1747 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1747/1747 places, 2860/2860 transitions.
Applied a total of 0 rules in 51 ms. Remains 1747 /1747 variables (removed 0) and now considering 2860/2860 (removed 0) transitions.
// Phase 1: matrix 2860 rows 1747 cols
[2022-05-16 17:36:29] [INFO ] Computed 4 place invariants in 37 ms
[2022-05-16 17:36:29] [INFO ] Implicit Places using invariants in 327 ms returned []
// Phase 1: matrix 2860 rows 1747 cols
[2022-05-16 17:36:29] [INFO ] Computed 4 place invariants in 24 ms
[2022-05-16 17:36:31] [INFO ] Implicit Places using invariants and state equation in 1347 ms returned []
Implicit Place search using SMT with State Equation took 1677 ms to find 0 implicit places.
// Phase 1: matrix 2860 rows 1747 cols
[2022-05-16 17:36:31] [INFO ] Computed 4 place invariants in 23 ms
[2022-05-16 17:36:32] [INFO ] Dead Transitions using invariants and state equation in 1161 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1747/1747 places, 2860/2860 transitions.
Built C files in :
/tmp/ltsmin12057369976103582643
[2022-05-16 17:36:32] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12057369976103582643
Running compilation step : cd /tmp/ltsmin12057369976103582643;'/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/ltsmin12057369976103582643;'/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/ltsmin12057369976103582643;'/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-05-16 17:36:35] [INFO ] Flatten gal took : 62 ms
[2022-05-16 17:36:35] [INFO ] Flatten gal took : 65 ms
[2022-05-16 17:36:35] [INFO ] Time to serialize gal into /tmp/LTL9329874004574666154.gal : 20 ms
[2022-05-16 17:36:35] [INFO ] Time to serialize properties into /tmp/LTL9392403270776950305.ltl : 50 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/LTL9329874004574666154.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9392403270776950305.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/LTL9329874...266
Read 1 LTL properties
Checking formula 0 : !(((F("(((((((l32_0+l32_1)+(l32_2+l32_3))+((l32_4+l32_5)+(l32_6+l32_7)))+(((l32_8+l32_9)+(l32_10+l32_11))+((l32_12+l32_13)+(l32_14+l32...8931
Formula 0 simplified : !(F"(((((((l32_0+l32_1)+(l32_2+l32_3))+((l32_4+l32_5)+(l32_6+l32_7)))+(((l32_8+l32_9)+(l32_10+l32_11))+((l32_12+l32_13)+(l32_14+l32_...8920
Detected timeout of ITS tools.
[2022-05-16 17:36:51] [INFO ] Flatten gal took : 54 ms
[2022-05-16 17:36:51] [INFO ] Applying decomposition
[2022-05-16 17:36:51] [INFO ] Flatten gal took : 53 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/graph13655738654013679139.txt' '-o' '/tmp/graph13655738654013679139.bin' '-w' '/tmp/graph13655738654013679139.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13655738654013679139.bin' '-l' '-1' '-v' '-w' '/tmp/graph13655738654013679139.weights' '-q' '0' '-e' '0.001'
[2022-05-16 17:36:51] [INFO ] Decomposing Gal with order
[2022-05-16 17:36:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 17:36:52] [INFO ] Removed a total of 956 redundant transitions.
[2022-05-16 17:36:53] [INFO ] Flatten gal took : 1158 ms
[2022-05-16 17:36:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 398 labels/synchronizations in 54 ms.
[2022-05-16 17:36:53] [INFO ] Time to serialize gal into /tmp/LTL13576413180549734041.gal : 16 ms
[2022-05-16 17:36:53] [INFO ] Time to serialize properties into /tmp/LTL7356157676810439578.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/LTL13576413180549734041.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7356157676810439578.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/LTL1357641...267
Read 1 LTL properties
Checking formula 0 : !(((F("(((((((gi44.gu44.l32_0+gi44.gu44.l32_1)+(gi44.gu44.l32_2+gi44.gu44.l32_3))+((gi44.gu44.l32_4+gi44.gu44.l32_5)+(gi44.gu44.l32_6+...16558
Formula 0 simplified : !(F"(((((((gi44.gu44.l32_0+gi44.gu44.l32_1)+(gi44.gu44.l32_2+gi44.gu44.l32_3))+((gi44.gu44.l32_4+gi44.gu44.l32_5)+(gi44.gu44.l32_6+g...16547
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin944974220670940208
[2022-05-16 17:37:08] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin944974220670940208
Running compilation step : cd /tmp/ltsmin944974220670940208;'/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/ltsmin944974220670940208;'/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/ltsmin944974220670940208;'/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 FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-04 finished in 111175 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(F((F(G((F(G(p0))||p1)))&&!p1)))))'
Support contains 615 out of 9980 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9980/9980 places, 9750/9750 transitions.
Reduce places removed 10 places and 0 transitions.
Discarding 306 places :
Implicit places reduction removed 306 places
Iterating post reduction 0 with 316 rules applied. Total rules applied 316 place count 9664 transition count 9750
Discarding 567 places :
Symmetric choice reduction at 1 with 567 rule applications. Total rules 883 place count 9097 transition count 9132
Iterating global reduction 1 with 567 rules applied. Total rules applied 1450 place count 9097 transition count 9132
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 1501 place count 9046 transition count 9132
Discarding 361 places :
Symmetric choice reduction at 2 with 361 rule applications. Total rules 1862 place count 8685 transition count 8621
Iterating global reduction 2 with 361 rules applied. Total rules applied 2223 place count 8685 transition count 8621
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 102 places :
Implicit places reduction removed 102 places
Iterating post reduction 2 with 204 rules applied. Total rules applied 2427 place count 8583 transition count 8519
Discarding 158 places :
Symmetric choice reduction at 3 with 158 rule applications. Total rules 2585 place count 8425 transition count 8111
Iterating global reduction 3 with 158 rules applied. Total rules applied 2743 place count 8425 transition count 8111
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 3 with 51 rules applied. Total rules applied 2794 place count 8374 transition count 8111
Discarding 103 places :
Symmetric choice reduction at 4 with 103 rule applications. Total rules 2897 place count 8271 transition count 7958
Iterating global reduction 4 with 103 rules applied. Total rules applied 3000 place count 8271 transition count 7958
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 4 with 51 rules applied. Total rules applied 3051 place count 8220 transition count 7958
Applied a total of 3051 rules in 6685 ms. Remains 8220 /9980 variables (removed 1760) and now considering 7958/9750 (removed 1792) transitions.
// Phase 1: matrix 7958 rows 8220 cols
[2022-05-16 17:37:18] [INFO ] Computed 872 place invariants in 153 ms
[2022-05-16 17:37:19] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 17:37:19] [INFO ] Implicit Places using invariants in 1028 ms returned []
// Phase 1: matrix 7958 rows 8220 cols
[2022-05-16 17:37:19] [INFO ] Computed 872 place invariants in 136 ms
[2022-05-16 17:37:20] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 17:37:20] [INFO ] Implicit Places using invariants and state equation in 930 ms returned []
Implicit Place search using SMT with State Equation took 1962 ms to find 0 implicit places.
// Phase 1: matrix 7958 rows 8220 cols
[2022-05-16 17:37:20] [INFO ] Computed 872 place invariants in 143 ms
[2022-05-16 17:37:21] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 17:37:21] [INFO ] Dead Transitions using invariants and state equation in 925 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 8220/9980 places, 7958/9750 transitions.
Finished structural reductions, in 1 iterations. Remains : 8220/9980 places, 7958/9750 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p1:(GT 2 (ADD s5615 s5616 s5617 s5618 s5619 s5620 s5621 s5622 s5623 s5624 s5625 s5626 s5627 s5628 s5629 s5630 s5631 s5632 s5633 s5634 s5635 s5636 s5637 s5...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 62 reset in 3432 ms.
Product exploration explored 100000 steps with 66 reset in 3391 ms.
Computed a total of 8220 stabilizing places and 7958 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 8220 transition count 7958
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 353 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 59 ms :[p1, p1]
Finished random walk after 465 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=42 )
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 9 factoid took 314 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 30 ms :[p1]
Stuttering acceptance computed with spot in 25 ms :[p1]
// Phase 1: matrix 7958 rows 8220 cols
[2022-05-16 17:37:31] [INFO ] Computed 872 place invariants in 138 ms
Proved EG p1
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (G p1)]
Property proved to be false thanks to negative knowledge :(G p1)
Knowledge based reduction with 9 factoid took 163 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 0 AP.
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-05 finished in 33066 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 312 out of 9980 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9980/9980 places, 9750/9750 transitions.
Graph (complete) has 14900 edges and 9980 vertex of which 5826 are kept as prefixes of interest. Removing 4154 places using SCC suffix rule.14 ms
Discarding 4154 places :
Also discarding 4089 output transitions
Drop transitions removed 4089 transitions
Reduce places removed 51 places and 51 transitions.
Discarding 306 places :
Implicit places reduction removed 306 places
Drop transitions removed 2805 transitions
Trivial Post-agglo rules discarded 2805 transitions
Performed 2805 trivial Post agglomeration. Transition count delta: 2805
Iterating post reduction 0 with 3111 rules applied. Total rules applied 3112 place count 5469 transition count 2805
Reduce places removed 2805 places and 0 transitions.
Performed 306 Post agglomeration using F-continuation condition.Transition count delta: 306
Iterating post reduction 1 with 3111 rules applied. Total rules applied 6223 place count 2664 transition count 2499
Reduce places removed 306 places and 0 transitions.
Iterating post reduction 2 with 306 rules applied. Total rules applied 6529 place count 2358 transition count 2499
Performed 357 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 357 Pre rules applied. Total rules applied 6529 place count 2358 transition count 2142
Deduced a syphon composed of 357 places in 0 ms
Ensure Unique test removed 306 places
Reduce places removed 663 places and 0 transitions.
Iterating global reduction 3 with 1020 rules applied. Total rules applied 7549 place count 1695 transition count 2142
Discarding 555 places :
Symmetric choice reduction at 3 with 555 rule applications. Total rules 8104 place count 1140 transition count 1587
Iterating global reduction 3 with 555 rules applied. Total rules applied 8659 place count 1140 transition count 1587
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 51 Pre rules applied. Total rules applied 8659 place count 1140 transition count 1536
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 8761 place count 1089 transition count 1536
Discarding 50 places :
Symmetric choice reduction at 3 with 50 rule applications. Total rules 8811 place count 1039 transition count 1236
Iterating global reduction 3 with 50 rules applied. Total rules applied 8861 place count 1039 transition count 1236
Applied a total of 8861 rules in 295 ms. Remains 1039 /9980 variables (removed 8941) and now considering 1236/9750 (removed 8514) transitions.
// Phase 1: matrix 1236 rows 1039 cols
[2022-05-16 17:37:44] [INFO ] Computed 53 place invariants in 12 ms
[2022-05-16 17:37:45] [INFO ] Implicit Places using invariants in 357 ms returned [51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 1020]
Discarding 52 places :
Implicit Place search using SMT only with invariants took 359 ms to find 52 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 987/9980 places, 1236/9750 transitions.
Drop transitions removed 306 transitions
Trivial Post-agglo rules discarded 306 transitions
Performed 306 trivial Post agglomeration. Transition count delta: 306
Iterating post reduction 0 with 306 rules applied. Total rules applied 306 place count 987 transition count 930
Reduce places removed 306 places and 0 transitions.
Iterating post reduction 1 with 306 rules applied. Total rules applied 612 place count 681 transition count 930
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 612 place count 681 transition count 924
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 624 place count 675 transition count 924
Applied a total of 624 rules in 17 ms. Remains 675 /987 variables (removed 312) and now considering 924/1236 (removed 312) transitions.
// Phase 1: matrix 924 rows 675 cols
[2022-05-16 17:37:45] [INFO ] Computed 1 place invariants in 14 ms
[2022-05-16 17:37:45] [INFO ] Implicit Places using invariants in 86 ms returned []
// Phase 1: matrix 924 rows 675 cols
[2022-05-16 17:37:45] [INFO ] Computed 1 place invariants in 8 ms
[2022-05-16 17:37:45] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 675/9980 places, 924/9750 transitions.
Finished structural reductions, in 2 iterations. Remains : 675/9980 places, 924/9750 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT (ADD s669 s670 s671 s672 s673 s674) (ADD s357 s358 s359 s360 s361 s362 s363 s364 s365 s366 s367 s368 s369 s370 s371 s372 s373 s374 s375 s376 s377 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 487 reset in 1417 ms.
Product exploration explored 100000 steps with 487 reset in 1395 ms.
Computed a total of 675 stabilizing places and 924 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 675 transition count 924
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 125 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Finished random walk after 139 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=23 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 135 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
// Phase 1: matrix 924 rows 675 cols
[2022-05-16 17:37:49] [INFO ] Computed 1 place invariants in 18 ms
[2022-05-16 17:37:50] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2022-05-16 17:37:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:37:51] [INFO ] [Real]Absence check using state equation in 510 ms returned sat
[2022-05-16 17:37:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 17:37:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 22 ms returned sat
[2022-05-16 17:37:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 17:37:52] [INFO ] [Nat]Absence check using state equation in 334 ms returned sat
[2022-05-16 17:37:52] [INFO ] Computed and/alt/rep : 612/612/612 causal constraints (skipped 6 transitions) in 48 ms.
[2022-05-16 17:37:53] [INFO ] Added : 80 causal constraints over 16 iterations in 782 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 312 out of 675 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 675/675 places, 924/924 transitions.
Applied a total of 0 rules in 9 ms. Remains 675 /675 variables (removed 0) and now considering 924/924 (removed 0) transitions.
// Phase 1: matrix 924 rows 675 cols
[2022-05-16 17:37:53] [INFO ] Computed 1 place invariants in 10 ms
[2022-05-16 17:37:53] [INFO ] Implicit Places using invariants in 90 ms returned []
// Phase 1: matrix 924 rows 675 cols
[2022-05-16 17:37:53] [INFO ] Computed 1 place invariants in 8 ms
[2022-05-16 17:37:53] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
[2022-05-16 17:37:53] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 924 rows 675 cols
[2022-05-16 17:37:53] [INFO ] Computed 1 place invariants in 11 ms
[2022-05-16 17:37:54] [INFO ] Dead Transitions using invariants and state equation in 332 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 675/675 places, 924/924 transitions.
Computed a total of 675 stabilizing places and 924 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 675 transition count 924
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 112 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 147 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=24 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 141 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
// Phase 1: matrix 924 rows 675 cols
[2022-05-16 17:37:55] [INFO ] Computed 1 place invariants in 15 ms
[2022-05-16 17:37:56] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-05-16 17:37:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:37:56] [INFO ] [Real]Absence check using state equation in 514 ms returned sat
[2022-05-16 17:37:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 17:37:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 23 ms returned sat
[2022-05-16 17:37:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 17:37:57] [INFO ] [Nat]Absence check using state equation in 323 ms returned sat
[2022-05-16 17:37:58] [INFO ] Computed and/alt/rep : 612/612/612 causal constraints (skipped 6 transitions) in 43 ms.
[2022-05-16 17:37:58] [INFO ] Added : 80 causal constraints over 16 iterations in 806 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 487 reset in 1334 ms.
Product exploration explored 100000 steps with 487 reset in 1371 ms.
Built C files in :
/tmp/ltsmin4204854618631885993
[2022-05-16 17:38:01] [INFO ] Computing symmetric may disable matrix : 924 transitions.
[2022-05-16 17:38:01] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 17:38:01] [INFO ] Computing symmetric may enable matrix : 924 transitions.
[2022-05-16 17:38:01] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 17:38:01] [INFO ] Computing Do-Not-Accords matrix : 924 transitions.
[2022-05-16 17:38:01] [INFO ] Computation of Completed DNA matrix. took 30 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 17:38:01] [INFO ] Built C files in 140ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4204854618631885993
Running compilation step : cd /tmp/ltsmin4204854618631885993;'/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'
Compilation finished in 2295 ms.
Running link step : cd /tmp/ltsmin4204854618631885993;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin4204854618631885993;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11014897848921385761.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 312 out of 675 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 675/675 places, 924/924 transitions.
Applied a total of 0 rules in 11 ms. Remains 675 /675 variables (removed 0) and now considering 924/924 (removed 0) transitions.
// Phase 1: matrix 924 rows 675 cols
[2022-05-16 17:38:16] [INFO ] Computed 1 place invariants in 16 ms
[2022-05-16 17:38:16] [INFO ] Implicit Places using invariants in 112 ms returned []
// Phase 1: matrix 924 rows 675 cols
[2022-05-16 17:38:16] [INFO ] Computed 1 place invariants in 13 ms
[2022-05-16 17:38:17] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
[2022-05-16 17:38:17] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 924 rows 675 cols
[2022-05-16 17:38:17] [INFO ] Computed 1 place invariants in 17 ms
[2022-05-16 17:38:17] [INFO ] Dead Transitions using invariants and state equation in 370 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 675/675 places, 924/924 transitions.
Built C files in :
/tmp/ltsmin3849354079575351366
[2022-05-16 17:38:17] [INFO ] Computing symmetric may disable matrix : 924 transitions.
[2022-05-16 17:38:17] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 17:38:17] [INFO ] Computing symmetric may enable matrix : 924 transitions.
[2022-05-16 17:38:17] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 17:38:17] [INFO ] Computing Do-Not-Accords matrix : 924 transitions.
[2022-05-16 17:38:17] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 17:38:17] [INFO ] Built C files in 115ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3849354079575351366
Running compilation step : cd /tmp/ltsmin3849354079575351366;'/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'
Compilation finished in 2297 ms.
Running link step : cd /tmp/ltsmin3849354079575351366;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin3849354079575351366;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11351936809342742714.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 17:38:32] [INFO ] Flatten gal took : 18 ms
[2022-05-16 17:38:32] [INFO ] Flatten gal took : 17 ms
[2022-05-16 17:38:32] [INFO ] Time to serialize gal into /tmp/LTL9300499001454097235.gal : 3 ms
[2022-05-16 17:38:32] [INFO ] Time to serialize properties into /tmp/LTL2609814109927838851.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/LTL9300499001454097235.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2609814109927838851.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/LTL9300499...266
Read 1 LTL properties
Checking formula 0 : !((F(G("((((m11_0+m11_1)+(m11_2+m11_3))+(m11_4+m11_5))>(((((((((m6_0_0+m6_1_0)+(m6_2_0+m6_3_0))+((m6_4_0+m6_5_0)+(m6_6_0+m6_7_0)))+(((...3079
Formula 0 simplified : !FG"((((m11_0+m11_1)+(m11_2+m11_3))+(m11_4+m11_5))>(((((((((m6_0_0+m6_1_0)+(m6_2_0+m6_3_0))+((m6_4_0+m6_5_0)+(m6_6_0+m6_7_0)))+(((m6...3073
Detected timeout of ITS tools.
[2022-05-16 17:38:47] [INFO ] Flatten gal took : 17 ms
[2022-05-16 17:38:47] [INFO ] Applying decomposition
[2022-05-16 17:38:47] [INFO ] Flatten gal took : 17 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/graph4431081068564914515.txt' '-o' '/tmp/graph4431081068564914515.bin' '-w' '/tmp/graph4431081068564914515.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4431081068564914515.bin' '-l' '-1' '-v' '-w' '/tmp/graph4431081068564914515.weights' '-q' '0' '-e' '0.001'
[2022-05-16 17:38:48] [INFO ] Decomposing Gal with order
[2022-05-16 17:38:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 17:38:48] [INFO ] Removed a total of 150 redundant transitions.
[2022-05-16 17:38:48] [INFO ] Flatten gal took : 205 ms
[2022-05-16 17:38:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 153 labels/synchronizations in 9 ms.
[2022-05-16 17:38:48] [INFO ] Time to serialize gal into /tmp/LTL14120163716728011562.gal : 4 ms
[2022-05-16 17:38:48] [INFO ] Time to serialize properties into /tmp/LTL10624264671020661502.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/LTL14120163716728011562.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10624264671020661502.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/LTL1412016...268
Read 1 LTL properties
Checking formula 0 : !((F(G("((((gu52.m11_0+gu52.m11_1)+(gu52.m11_2+gu52.m11_3))+(gu52.m11_4+gu52.m11_5))>(((((((((gu52.m6_0_0+gu52.m6_1_0)+(gu52.m6_2_0+gu...4639
Formula 0 simplified : !FG"((((gu52.m11_0+gu52.m11_1)+(gu52.m11_2+gu52.m11_3))+(gu52.m11_4+gu52.m11_5))>(((((((((gu52.m6_0_0+gu52.m6_1_0)+(gu52.m6_2_0+gu52...4633
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14812250031087151706
[2022-05-16 17:39:03] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14812250031087151706
Running compilation step : cd /tmp/ltsmin14812250031087151706;'/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'
Compilation finished in 1307 ms.
Running link step : cd /tmp/ltsmin14812250031087151706;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin14812250031087151706;'/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' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-06 finished in 93880 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 156 out of 9980 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9980/9980 places, 9750/9750 transitions.
Reduce places removed 10 places and 0 transitions.
Discarding 612 places :
Implicit places reduction removed 612 places
Iterating post reduction 0 with 622 rules applied. Total rules applied 622 place count 9358 transition count 9750
Discarding 717 places :
Symmetric choice reduction at 1 with 717 rule applications. Total rules 1339 place count 8641 transition count 8982
Iterating global reduction 1 with 717 rules applied. Total rules applied 2056 place count 8641 transition count 8982
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2107 place count 8590 transition count 8982
Discarding 361 places :
Symmetric choice reduction at 2 with 361 rule applications. Total rules 2468 place count 8229 transition count 8471
Iterating global reduction 2 with 361 rules applied. Total rules applied 2829 place count 8229 transition count 8471
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 102 places :
Implicit places reduction removed 102 places
Iterating post reduction 2 with 204 rules applied. Total rules applied 3033 place count 8127 transition count 8369
Discarding 158 places :
Symmetric choice reduction at 3 with 158 rule applications. Total rules 3191 place count 7969 transition count 7961
Iterating global reduction 3 with 158 rules applied. Total rules applied 3349 place count 7969 transition count 7961
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 3 with 51 rules applied. Total rules applied 3400 place count 7918 transition count 7961
Discarding 256 places :
Symmetric choice reduction at 4 with 256 rule applications. Total rules 3656 place count 7662 transition count 7655
Iterating global reduction 4 with 256 rules applied. Total rules applied 3912 place count 7662 transition count 7655
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 4167 place count 7407 transition count 7400
Iterating global reduction 4 with 255 rules applied. Total rules applied 4422 place count 7407 transition count 7400
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 4677 place count 7152 transition count 7145
Iterating global reduction 4 with 255 rules applied. Total rules applied 4932 place count 7152 transition count 7145
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 5187 place count 6897 transition count 6890
Iterating global reduction 4 with 255 rules applied. Total rules applied 5442 place count 6897 transition count 6890
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 5697 place count 6642 transition count 6635
Iterating global reduction 4 with 255 rules applied. Total rules applied 5952 place count 6642 transition count 6635
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 6207 place count 6387 transition count 6380
Iterating global reduction 4 with 255 rules applied. Total rules applied 6462 place count 6387 transition count 6380
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 6717 place count 6132 transition count 6125
Iterating global reduction 4 with 255 rules applied. Total rules applied 6972 place count 6132 transition count 6125
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 7227 place count 5877 transition count 5870
Iterating global reduction 4 with 255 rules applied. Total rules applied 7482 place count 5877 transition count 5870
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 7737 place count 5622 transition count 5615
Iterating global reduction 4 with 255 rules applied. Total rules applied 7992 place count 5622 transition count 5615
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 8247 place count 5367 transition count 5360
Iterating global reduction 4 with 255 rules applied. Total rules applied 8502 place count 5367 transition count 5360
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 8757 place count 5112 transition count 5105
Iterating global reduction 4 with 255 rules applied. Total rules applied 9012 place count 5112 transition count 5105
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 9267 place count 4857 transition count 4850
Iterating global reduction 4 with 255 rules applied. Total rules applied 9522 place count 4857 transition count 4850
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 9777 place count 4602 transition count 4595
Iterating global reduction 4 with 255 rules applied. Total rules applied 10032 place count 4602 transition count 4595
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 4 with 306 rules applied. Total rules applied 10338 place count 4551 transition count 4340
Applied a total of 10338 rules in 14149 ms. Remains 4551 /9980 variables (removed 5429) and now considering 4340/9750 (removed 5410) transitions.
// Phase 1: matrix 4340 rows 4551 cols
[2022-05-16 17:39:32] [INFO ] Computed 566 place invariants in 43 ms
[2022-05-16 17:39:33] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 17:39:33] [INFO ] Implicit Places using invariants in 1234 ms returned [417, 454]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1261 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4549/9980 places, 4340/9750 transitions.
Applied a total of 0 rules in 354 ms. Remains 4549 /4549 variables (removed 0) and now considering 4340/4340 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 4549/9980 places, 4340/9750 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s1072 s1073 s1074 s1075 s1076 s1077 s1078 s1079 s1080 s1081 s1082 s1083 s1084 s1085 s1086 s1087 s1088 s1089 s1090 s1091 s1092 s1093 s1094 s10...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 2690 ms.
Product exploration explored 100000 steps with 50000 reset in 2751 ms.
Computed a total of 4549 stabilizing places and 4340 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4549 transition count 4340
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 66 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-07 finished in 22558 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 9980 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9980/9980 places, 9750/9750 transitions.
Reduce places removed 10 places and 0 transitions.
Discarding 612 places :
Implicit places reduction removed 612 places
Iterating post reduction 0 with 622 rules applied. Total rules applied 622 place count 9358 transition count 9750
Discarding 822 places :
Symmetric choice reduction at 1 with 822 rule applications. Total rules 1444 place count 8536 transition count 8877
Iterating global reduction 1 with 822 rules applied. Total rules applied 2266 place count 8536 transition count 8877
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2317 place count 8485 transition count 8877
Discarding 362 places :
Symmetric choice reduction at 2 with 362 rule applications. Total rules 2679 place count 8123 transition count 8315
Iterating global reduction 2 with 362 rules applied. Total rules applied 3041 place count 8123 transition count 8315
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 2 with 153 rules applied. Total rules applied 3194 place count 8072 transition count 8213
Discarding 209 places :
Symmetric choice reduction at 3 with 209 rule applications. Total rules 3403 place count 7863 transition count 7754
Iterating global reduction 3 with 209 rules applied. Total rules applied 3612 place count 7863 transition count 7754
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 102 places :
Implicit places reduction removed 102 places
Iterating post reduction 3 with 204 rules applied. Total rules applied 3816 place count 7761 transition count 7652
Discarding 307 places :
Symmetric choice reduction at 4 with 307 rule applications. Total rules 4123 place count 7454 transition count 7295
Iterating global reduction 4 with 307 rules applied. Total rules applied 4430 place count 7454 transition count 7295
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 4 with 51 rules applied. Total rules applied 4481 place count 7403 transition count 7295
Discarding 255 places :
Symmetric choice reduction at 5 with 255 rule applications. Total rules 4736 place count 7148 transition count 7040
Iterating global reduction 5 with 255 rules applied. Total rules applied 4991 place count 7148 transition count 7040
Discarding 255 places :
Symmetric choice reduction at 5 with 255 rule applications. Total rules 5246 place count 6893 transition count 6785
Iterating global reduction 5 with 255 rules applied. Total rules applied 5501 place count 6893 transition count 6785
Discarding 255 places :
Symmetric choice reduction at 5 with 255 rule applications. Total rules 5756 place count 6638 transition count 6530
Iterating global reduction 5 with 255 rules applied. Total rules applied 6011 place count 6638 transition count 6530
Discarding 255 places :
Symmetric choice reduction at 5 with 255 rule applications. Total rules 6266 place count 6383 transition count 6275
Iterating global reduction 5 with 255 rules applied. Total rules applied 6521 place count 6383 transition count 6275
Discarding 255 places :
Symmetric choice reduction at 5 with 255 rule applications. Total rules 6776 place count 6128 transition count 6020
Iterating global reduction 5 with 255 rules applied. Total rules applied 7031 place count 6128 transition count 6020
Discarding 255 places :
Symmetric choice reduction at 5 with 255 rule applications. Total rules 7286 place count 5873 transition count 5765
Iterating global reduction 5 with 255 rules applied. Total rules applied 7541 place count 5873 transition count 5765
Discarding 255 places :
Symmetric choice reduction at 5 with 255 rule applications. Total rules 7796 place count 5618 transition count 5510
Iterating global reduction 5 with 255 rules applied. Total rules applied 8051 place count 5618 transition count 5510
Discarding 255 places :
Symmetric choice reduction at 5 with 255 rule applications. Total rules 8306 place count 5363 transition count 5255
Iterating global reduction 5 with 255 rules applied. Total rules applied 8561 place count 5363 transition count 5255
Discarding 255 places :
Symmetric choice reduction at 5 with 255 rule applications. Total rules 8816 place count 5108 transition count 5000
Iterating global reduction 5 with 255 rules applied. Total rules applied 9071 place count 5108 transition count 5000
Discarding 255 places :
Symmetric choice reduction at 5 with 255 rule applications. Total rules 9326 place count 4853 transition count 4745
Iterating global reduction 5 with 255 rules applied. Total rules applied 9581 place count 4853 transition count 4745
Discarding 255 places :
Symmetric choice reduction at 5 with 255 rule applications. Total rules 9836 place count 4598 transition count 4490
Iterating global reduction 5 with 255 rules applied. Total rules applied 10091 place count 4598 transition count 4490
Discarding 255 places :
Symmetric choice reduction at 5 with 255 rule applications. Total rules 10346 place count 4343 transition count 4235
Iterating global reduction 5 with 255 rules applied. Total rules applied 10601 place count 4343 transition count 4235
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 5 with 306 rules applied. Total rules applied 10907 place count 4292 transition count 3980
Applied a total of 10907 rules in 13958 ms. Remains 4292 /9980 variables (removed 5688) and now considering 3980/9750 (removed 5770) transitions.
// Phase 1: matrix 3980 rows 4292 cols
[2022-05-16 17:39:55] [INFO ] Computed 515 place invariants in 52 ms
[2022-05-16 17:39:55] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 17:39:56] [INFO ] Implicit Places using invariants in 1146 ms returned [1723, 2727]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1161 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4290/9980 places, 3980/9750 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 4289 transition count 3979
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 4289 transition count 3979
Applied a total of 2 rules in 683 ms. Remains 4289 /4290 variables (removed 1) and now considering 3979/3980 (removed 1) transitions.
// Phase 1: matrix 3979 rows 4289 cols
[2022-05-16 17:39:56] [INFO ] Computed 513 place invariants in 49 ms
[2022-05-16 17:39:57] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 17:39:57] [INFO ] Implicit Places using invariants in 1158 ms returned [2727, 3911]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1161 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 4287/9980 places, 3979/9750 transitions.
Applied a total of 0 rules in 355 ms. Remains 4287 /4287 variables (removed 0) and now considering 3979/3979 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 4287/9980 places, 3979/9750 transitions.
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GT 1 s3777)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1210 steps with 0 reset in 8 ms.
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-09 finished in 17495 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!F(p0) U (G(p0)||p1))||X(p2))))'
Support contains 6 out of 9980 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9980/9980 places, 9750/9750 transitions.
Reduce places removed 10 places and 0 transitions.
Discarding 612 places :
Implicit places reduction removed 612 places
Iterating post reduction 0 with 622 rules applied. Total rules applied 622 place count 9358 transition count 9750
Discarding 820 places :
Symmetric choice reduction at 1 with 820 rule applications. Total rules 1442 place count 8538 transition count 8880
Iterating global reduction 1 with 820 rules applied. Total rules applied 2262 place count 8538 transition count 8880
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2313 place count 8487 transition count 8880
Discarding 361 places :
Symmetric choice reduction at 2 with 361 rule applications. Total rules 2674 place count 8126 transition count 8369
Iterating global reduction 2 with 361 rules applied. Total rules applied 3035 place count 8126 transition count 8369
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 2 with 153 rules applied. Total rules applied 3188 place count 8075 transition count 8267
Discarding 157 places :
Symmetric choice reduction at 3 with 157 rule applications. Total rules 3345 place count 7918 transition count 7860
Iterating global reduction 3 with 157 rules applied. Total rules applied 3502 place count 7918 transition count 7860
Ensure Unique test removed 101 transitions
Reduce isomorphic transitions removed 101 transitions.
Discarding 101 places :
Implicit places reduction removed 101 places
Iterating post reduction 3 with 202 rules applied. Total rules applied 3704 place count 7817 transition count 7759
Discarding 306 places :
Symmetric choice reduction at 4 with 306 rule applications. Total rules 4010 place count 7511 transition count 7453
Iterating global reduction 4 with 306 rules applied. Total rules applied 4316 place count 7511 transition count 7453
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 4571 place count 7256 transition count 7198
Iterating global reduction 4 with 255 rules applied. Total rules applied 4826 place count 7256 transition count 7198
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 5081 place count 7001 transition count 6943
Iterating global reduction 4 with 255 rules applied. Total rules applied 5336 place count 7001 transition count 6943
Discarding 254 places :
Symmetric choice reduction at 4 with 254 rule applications. Total rules 5590 place count 6747 transition count 6689
Iterating global reduction 4 with 254 rules applied. Total rules applied 5844 place count 6747 transition count 6689
Discarding 254 places :
Symmetric choice reduction at 4 with 254 rule applications. Total rules 6098 place count 6493 transition count 6435
Iterating global reduction 4 with 254 rules applied. Total rules applied 6352 place count 6493 transition count 6435
Discarding 254 places :
Symmetric choice reduction at 4 with 254 rule applications. Total rules 6606 place count 6239 transition count 6181
Iterating global reduction 4 with 254 rules applied. Total rules applied 6860 place count 6239 transition count 6181
Discarding 254 places :
Symmetric choice reduction at 4 with 254 rule applications. Total rules 7114 place count 5985 transition count 5927
Iterating global reduction 4 with 254 rules applied. Total rules applied 7368 place count 5985 transition count 5927
Discarding 254 places :
Symmetric choice reduction at 4 with 254 rule applications. Total rules 7622 place count 5731 transition count 5673
Iterating global reduction 4 with 254 rules applied. Total rules applied 7876 place count 5731 transition count 5673
Discarding 254 places :
Symmetric choice reduction at 4 with 254 rule applications. Total rules 8130 place count 5477 transition count 5419
Iterating global reduction 4 with 254 rules applied. Total rules applied 8384 place count 5477 transition count 5419
Discarding 254 places :
Symmetric choice reduction at 4 with 254 rule applications. Total rules 8638 place count 5223 transition count 5165
Iterating global reduction 4 with 254 rules applied. Total rules applied 8892 place count 5223 transition count 5165
Discarding 254 places :
Symmetric choice reduction at 4 with 254 rule applications. Total rules 9146 place count 4969 transition count 4911
Iterating global reduction 4 with 254 rules applied. Total rules applied 9400 place count 4969 transition count 4911
Discarding 254 places :
Symmetric choice reduction at 4 with 254 rule applications. Total rules 9654 place count 4715 transition count 4657
Iterating global reduction 4 with 254 rules applied. Total rules applied 9908 place count 4715 transition count 4657
Discarding 254 places :
Symmetric choice reduction at 4 with 254 rule applications. Total rules 10162 place count 4461 transition count 4403
Iterating global reduction 4 with 254 rules applied. Total rules applied 10416 place count 4461 transition count 4403
Ensure Unique test removed 254 transitions
Reduce isomorphic transitions removed 254 transitions.
Discarding 50 places :
Implicit places reduction removed 50 places
Iterating post reduction 4 with 304 rules applied. Total rules applied 10720 place count 4411 transition count 4149
Applied a total of 10720 rules in 13858 ms. Remains 4411 /9980 variables (removed 5569) and now considering 4149/9750 (removed 5601) transitions.
// Phase 1: matrix 4149 rows 4411 cols
[2022-05-16 17:40:12] [INFO ] Computed 568 place invariants in 80 ms
[2022-05-16 17:40:12] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 17:40:13] [INFO ] Implicit Places using invariants in 1244 ms returned [2833, 2835, 2871]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1267 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4408/9980 places, 4149/9750 transitions.
Applied a total of 0 rules in 335 ms. Remains 4408 /4408 variables (removed 0) and now considering 4149/4149 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 4408/9980 places, 4149/9750 transitions.
Stuttering acceptance computed with spot in 245 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (OR (NOT p1) p0), (AND (NOT p0) (NOT p2)), p0, (NOT p0), true, (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 4}, { cond=p0, acceptance={0} source=2 dest: 6}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}, { cond=p0, acceptance={} source=4 dest: 6}], [{ cond=p0, acceptance={} source=5 dest: 5}, { cond=(NOT p0), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=true, acceptance={} source=7 dest: 0}]], initial=7, aps=[p1:(AND (LEQ s4114 s565) (LEQ s1275 1)), p0:(LEQ s1543 s1208), p2:(LEQ 1 s1972)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2475 ms.
Product exploration explored 100000 steps with 50000 reset in 2485 ms.
Computed a total of 4408 stabilizing places and 4149 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4408 transition count 4149
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (G p0)), (F (G (NOT p2)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) p0)))
Knowledge based reduction with 10 factoid took 159 ms. Reduced automaton from 8 states, 16 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-11 finished in 21895 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(p0)))'
Support contains 2 out of 9980 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9980/9980 places, 9750/9750 transitions.
Reduce places removed 10 places and 0 transitions.
Discarding 612 places :
Implicit places reduction removed 612 places
Iterating post reduction 0 with 622 rules applied. Total rules applied 622 place count 9358 transition count 9750
Discarding 822 places :
Symmetric choice reduction at 1 with 822 rule applications. Total rules 1444 place count 8536 transition count 8877
Iterating global reduction 1 with 822 rules applied. Total rules applied 2266 place count 8536 transition count 8877
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2317 place count 8485 transition count 8877
Discarding 363 places :
Symmetric choice reduction at 2 with 363 rule applications. Total rules 2680 place count 8122 transition count 8264
Iterating global reduction 2 with 363 rules applied. Total rules applied 3043 place count 8122 transition count 8264
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 102 places :
Implicit places reduction removed 102 places
Iterating post reduction 2 with 204 rules applied. Total rules applied 3247 place count 8020 transition count 8162
Discarding 260 places :
Symmetric choice reduction at 3 with 260 rule applications. Total rules 3507 place count 7760 transition count 7652
Iterating global reduction 3 with 260 rules applied. Total rules applied 3767 place count 7760 transition count 7652
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 102 places :
Implicit places reduction removed 102 places
Iterating post reduction 3 with 204 rules applied. Total rules applied 3971 place count 7658 transition count 7550
Discarding 358 places :
Symmetric choice reduction at 4 with 358 rule applications. Total rules 4329 place count 7300 transition count 7142
Iterating global reduction 4 with 358 rules applied. Total rules applied 4687 place count 7300 transition count 7142
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 4 with 51 rules applied. Total rules applied 4738 place count 7249 transition count 7142
Discarding 255 places :
Symmetric choice reduction at 5 with 255 rule applications. Total rules 4993 place count 6994 transition count 6887
Iterating global reduction 5 with 255 rules applied. Total rules applied 5248 place count 6994 transition count 6887
Discarding 255 places :
Symmetric choice reduction at 5 with 255 rule applications. Total rules 5503 place count 6739 transition count 6632
Iterating global reduction 5 with 255 rules applied. Total rules applied 5758 place count 6739 transition count 6632
Discarding 255 places :
Symmetric choice reduction at 5 with 255 rule applications. Total rules 6013 place count 6484 transition count 6377
Iterating global reduction 5 with 255 rules applied. Total rules applied 6268 place count 6484 transition count 6377
Discarding 255 places :
Symmetric choice reduction at 5 with 255 rule applications. Total rules 6523 place count 6229 transition count 6122
Iterating global reduction 5 with 255 rules applied. Total rules applied 6778 place count 6229 transition count 6122
Discarding 255 places :
Symmetric choice reduction at 5 with 255 rule applications. Total rules 7033 place count 5974 transition count 5867
Iterating global reduction 5 with 255 rules applied. Total rules applied 7288 place count 5974 transition count 5867
Discarding 255 places :
Symmetric choice reduction at 5 with 255 rule applications. Total rules 7543 place count 5719 transition count 5612
Iterating global reduction 5 with 255 rules applied. Total rules applied 7798 place count 5719 transition count 5612
Discarding 255 places :
Symmetric choice reduction at 5 with 255 rule applications. Total rules 8053 place count 5464 transition count 5357
Iterating global reduction 5 with 255 rules applied. Total rules applied 8308 place count 5464 transition count 5357
Discarding 255 places :
Symmetric choice reduction at 5 with 255 rule applications. Total rules 8563 place count 5209 transition count 5102
Iterating global reduction 5 with 255 rules applied. Total rules applied 8818 place count 5209 transition count 5102
Discarding 255 places :
Symmetric choice reduction at 5 with 255 rule applications. Total rules 9073 place count 4954 transition count 4847
Iterating global reduction 5 with 255 rules applied. Total rules applied 9328 place count 4954 transition count 4847
Discarding 255 places :
Symmetric choice reduction at 5 with 255 rule applications. Total rules 9583 place count 4699 transition count 4592
Iterating global reduction 5 with 255 rules applied. Total rules applied 9838 place count 4699 transition count 4592
Discarding 255 places :
Symmetric choice reduction at 5 with 255 rule applications. Total rules 10093 place count 4444 transition count 4337
Iterating global reduction 5 with 255 rules applied. Total rules applied 10348 place count 4444 transition count 4337
Discarding 255 places :
Symmetric choice reduction at 5 with 255 rule applications. Total rules 10603 place count 4189 transition count 4082
Iterating global reduction 5 with 255 rules applied. Total rules applied 10858 place count 4189 transition count 4082
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 5 with 306 rules applied. Total rules applied 11164 place count 4138 transition count 3827
Applied a total of 11164 rules in 13517 ms. Remains 4138 /9980 variables (removed 5842) and now considering 3827/9750 (removed 5923) transitions.
// Phase 1: matrix 3827 rows 4138 cols
[2022-05-16 17:40:33] [INFO ] Computed 464 place invariants in 48 ms
[2022-05-16 17:40:34] [INFO ] Implicit Places using invariants in 1060 ms returned [1723, 2751]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1063 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4136/9980 places, 3827/9750 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 4135 transition count 3826
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 4135 transition count 3826
Applied a total of 2 rules in 626 ms. Remains 4135 /4136 variables (removed 1) and now considering 3826/3827 (removed 1) transitions.
// Phase 1: matrix 3826 rows 4135 cols
[2022-05-16 17:40:35] [INFO ] Computed 462 place invariants in 46 ms
[2022-05-16 17:40:36] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 17:40:36] [INFO ] Implicit Places using invariants in 1023 ms returned [2744, 2751]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1036 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 4133/9980 places, 3826/9750 transitions.
Applied a total of 0 rules in 345 ms. Remains 4133 /4133 variables (removed 0) and now considering 3826/3826 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 4133/9980 places, 3826/9750 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s48 s1178)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 2321 ms.
Product exploration explored 100000 steps with 50000 reset in 2309 ms.
Computed a total of 4133 stabilizing places and 3826 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4133 transition count 3826
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 59 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-12 finished in 22448 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 3 out of 9980 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9980/9980 places, 9750/9750 transitions.
Graph (complete) has 14900 edges and 9980 vertex of which 9716 are kept as prefixes of interest. Removing 264 places using SCC suffix rule.9 ms
Discarding 264 places :
Also discarding 305 output transitions
Drop transitions removed 305 transitions
Reduce places removed 51 places and 51 transitions.
Discarding 612 places :
Implicit places reduction removed 612 places
Drop transitions removed 5555 transitions
Trivial Post-agglo rules discarded 5555 transitions
Performed 5555 trivial Post agglomeration. Transition count delta: 5555
Iterating post reduction 0 with 6167 rules applied. Total rules applied 6168 place count 9053 transition count 3839
Reduce places removed 5555 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 5557 rules applied. Total rules applied 11725 place count 3498 transition count 3837
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 11727 place count 3496 transition count 3837
Performed 661 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 661 Pre rules applied. Total rules applied 11727 place count 3496 transition count 3176
Deduced a syphon composed of 661 places in 1 ms
Ensure Unique test removed 305 places
Reduce places removed 966 places and 0 transitions.
Iterating global reduction 3 with 1627 rules applied. Total rules applied 13354 place count 2530 transition count 3176
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 203 transitions
Trivial Post-agglo rules discarded 203 transitions
Performed 203 trivial Post agglomeration. Transition count delta: 203
Iterating post reduction 3 with 204 rules applied. Total rules applied 13558 place count 2529 transition count 2973
Reduce places removed 203 places and 0 transitions.
Iterating post reduction 4 with 203 rules applied. Total rules applied 13761 place count 2326 transition count 2973
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 13761 place count 2326 transition count 2972
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 13763 place count 2325 transition count 2972
Discarding 567 places :
Symmetric choice reduction at 5 with 567 rule applications. Total rules 14330 place count 1758 transition count 2105
Iterating global reduction 5 with 567 rules applied. Total rules applied 14897 place count 1758 transition count 2105
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 153 places :
Implicit places reduction removed 153 places
Drop transitions removed 257 transitions
Trivial Post-agglo rules discarded 257 transitions
Performed 257 trivial Post agglomeration. Transition count delta: 257
Iterating post reduction 5 with 512 rules applied. Total rules applied 15409 place count 1605 transition count 1746
Reduce places removed 257 places and 0 transitions.
Iterating post reduction 6 with 257 rules applied. Total rules applied 15666 place count 1348 transition count 1746
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 102 Pre rules applied. Total rules applied 15666 place count 1348 transition count 1644
Deduced a syphon composed of 102 places in 1 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 7 with 204 rules applied. Total rules applied 15870 place count 1246 transition count 1644
Discarding 259 places :
Symmetric choice reduction at 7 with 259 rule applications. Total rules 16129 place count 987 transition count 1184
Iterating global reduction 7 with 259 rules applied. Total rules applied 16388 place count 987 transition count 1184
Ensure Unique test removed 458 transitions
Reduce isomorphic transitions removed 458 transitions.
Discarding 153 places :
Implicit places reduction removed 153 places
Drop transitions removed 151 transitions
Trivial Post-agglo rules discarded 151 transitions
Performed 151 trivial Post agglomeration. Transition count delta: 151
Iterating post reduction 7 with 762 rules applied. Total rules applied 17150 place count 834 transition count 575
Reduce places removed 151 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 152 rules applied. Total rules applied 17302 place count 683 transition count 574
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 17303 place count 682 transition count 574
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 102 Pre rules applied. Total rules applied 17303 place count 682 transition count 472
Deduced a syphon composed of 102 places in 0 ms
Ensure Unique test removed 50 places
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 10 with 254 rules applied. Total rules applied 17557 place count 530 transition count 472
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 17558 place count 529 transition count 421
Iterating global reduction 10 with 1 rules applied. Total rules applied 17559 place count 529 transition count 421
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 10 with 1 rules applied. Total rules applied 17560 place count 528 transition count 421
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 17560 place count 528 transition count 420
Deduced a syphon composed of 1 places in 14 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 17562 place count 527 transition count 420
Performed 103 Post agglomeration using F-continuation condition.Transition count delta: 103
Deduced a syphon composed of 103 places in 1 ms
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 11 with 206 rules applied. Total rules applied 17768 place count 424 transition count 317
Reduce places removed 50 places and 50 transitions.
Iterating global reduction 11 with 50 rules applied. Total rules applied 17818 place count 374 transition count 267
Applied a total of 17818 rules in 530 ms. Remains 374 /9980 variables (removed 9606) and now considering 267/9750 (removed 9483) transitions.
// Phase 1: matrix 267 rows 374 cols
[2022-05-16 17:40:43] [INFO ] Computed 108 place invariants in 2 ms
[2022-05-16 17:40:43] [INFO ] Implicit Places using invariants in 282 ms returned [2, 5, 57, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255, 256, 257, 258, 262, 264, 316, 321]
Discarding 107 places :
Implicit Place search using SMT only with invariants took 297 ms to find 107 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 267/9980 places, 267/9750 transitions.
Graph (complete) has 267 edges and 267 vertex of which 216 are kept as prefixes of interest. Removing 51 places using SCC suffix rule.0 ms
Discarding 51 places :
Also discarding 51 output transitions
Drop transitions removed 51 transitions
Reduce places removed 50 places and 50 transitions.
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 166 transition count 112
Reduce places removed 54 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 55 rules applied. Total rules applied 110 place count 112 transition count 111
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 111 place count 111 transition count 111
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 51 Pre rules applied. Total rules applied 111 place count 111 transition count 60
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 213 place count 60 transition count 60
Discarding 48 places :
Symmetric choice reduction at 3 with 48 rule applications. Total rules 261 place count 12 transition count 12
Iterating global reduction 3 with 48 rules applied. Total rules applied 309 place count 12 transition count 12
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 3 with 2 rules applied. Total rules applied 311 place count 11 transition count 11
Applied a total of 311 rules in 32 ms. Remains 11 /267 variables (removed 256) and now considering 11/267 (removed 256) transitions.
// Phase 1: matrix 11 rows 11 cols
[2022-05-16 17:40:43] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 17:40:43] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2022-05-16 17:40:43] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 17:40:43] [INFO ] Implicit Places using invariants and state equation in 31 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 71 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/9980 places, 11/9750 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 10/9980 places, 11/9750 transitions.
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 1 s7), p1:(LEQ s0 s4)], nbAcceptance=1, 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 24 steps with 3 reset in 0 ms.
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00050M0005C002P002G001-LTLCardinality-14 finished in 1053 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U !(G(p1) U (G(p2)&&p0))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2022-05-16 17:40:44] [INFO ] Flatten gal took : 289 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12931383371545218112
[2022-05-16 17:40:44] [INFO ] Too many transitions (9750) to apply POR reductions. Disabling POR matrices.
[2022-05-16 17:40:44] [INFO ] Built C files in 271ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12931383371545218112
Running compilation step : cd /tmp/ltsmin12931383371545218112;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' '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-05-16 17:40:44] [INFO ] Applying decomposition
[2022-05-16 17:40:45] [INFO ] Flatten gal took : 554 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/graph15897614584131632134.txt' '-o' '/tmp/graph15897614584131632134.bin' '-w' '/tmp/graph15897614584131632134.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15897614584131632134.bin' '-l' '-1' '-v' '-w' '/tmp/graph15897614584131632134.weights' '-q' '0' '-e' '0.001'
[2022-05-16 17:40:47] [INFO ] Decomposing Gal with order
[2022-05-16 17:40:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 17:40:53] [INFO ] Removed a total of 2657 redundant transitions.
[2022-05-16 17:40:53] [INFO ] Flatten gal took : 1990 ms
[2022-05-16 17:40:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 1863 labels/synchronizations in 865 ms.
[2022-05-16 17:40:58] [INFO ] Time to serialize gal into /tmp/LTLCardinality16450295001203182066.gal : 162 ms
[2022-05-16 17:40:58] [INFO ] Time to serialize properties into /tmp/LTLCardinality1378928435149841211.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/LTLCardinality16450295001203182066.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1378928435149841211.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/LTLCardina...289
Read 2 LTL properties
Checking formula 0 : !(((F("(((((((gi53.gi4.gi6.gi3.gu680.l32_0+gi53.gi4.gi6.gi3.gu680.l32_1)+(gi53.gi4.gi6.gi3.gu680.l32_2+gi53.gi4.gi6.gi3.gu680.l32_3))+...18186
Formula 0 simplified : !(F"(((((((gi53.gi4.gi6.gi3.gu680.l32_0+gi53.gi4.gi6.gi3.gu680.l32_1)+(gi53.gi4.gi6.gi3.gu680.l32_2+gi53.gi4.gi6.gi3.gu680.l32_3))+(...18175
Compilation finished in 63813 ms.
Running link step : cd /tmp/ltsmin12931383371545218112;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 86 ms.
Running LTSmin : cd /tmp/ltsmin12931383371545218112;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(<>((LTLAPp0==true)) U !([]((LTLAPp1==true)) U ([]((LTLAPp2==true))&&(LTLAPp0==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-16 18:03:15] [INFO ] Flatten gal took : 535 ms
[2022-05-16 18:03:15] [INFO ] Time to serialize gal into /tmp/LTLCardinality16799971106243082225.gal : 72 ms
[2022-05-16 18:03:15] [INFO ] Time to serialize properties into /tmp/LTLCardinality5062643500438505770.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/LTLCardinality16799971106243082225.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5062643500438505770.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/LTLCardina...289
Read 2 LTL properties
Checking formula 0 : !(((F("(((((((l32_0+l32_1)+(l32_2+l32_3))+((l32_4+l32_5)+(l32_6+l32_7)))+(((l32_8+l32_9)+(l32_10+l32_11))+((l32_12+l32_13)+(l32_14+l32...8931
Formula 0 simplified : !(F"(((((((l32_0+l32_1)+(l32_2+l32_3))+((l32_4+l32_5)+(l32_6+l32_7)))+(((l32_8+l32_9)+(l32_10+l32_11))+((l32_12+l32_13)+(l32_14+l32_...8920
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin12931383371545218112;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(<>((LTLAPp0==true)) U !([]((LTLAPp1==true)) U ([]((LTLAPp2==true))&&(LTLAPp0==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin12931383371545218112;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp3==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-16 18:25:32] [INFO ] Flatten gal took : 657 ms
[2022-05-16 18:25:33] [INFO ] Input system was already deterministic with 9750 transitions.
[2022-05-16 18:25:33] [INFO ] Transformed 9980 places.
[2022-05-16 18:25:33] [INFO ] Transformed 9750 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-16 18:26:04] [INFO ] Time to serialize gal into /tmp/LTLCardinality11547650740967430748.gal : 44 ms
[2022-05-16 18:26:04] [INFO ] Time to serialize properties into /tmp/LTLCardinality13296079680476272347.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/LTLCardinality11547650740967430748.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13296079680476272347.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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/LTLCardina...335
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((F("(((((((l32_0+l32_1)+(l32_2+l32_3))+((l32_4+l32_5)+(l32_6+l32_7)))+(((l32_8+l32_9)+(l32_10+l32_11))+((l32_12+l32_13)+(l32_14+l32...8931
Formula 0 simplified : !(F"(((((((l32_0+l32_1)+(l32_2+l32_3))+((l32_4+l32_5)+(l32_6+l32_7)))+(((l32_8+l32_9)+(l32_10+l32_11))+((l32_12+l32_13)+(l32_14+l32_...8920

BK_TIME_CONFINEMENT_REACHED

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="FamilyReunion-PT-L00050M0005C002P002G001"
export BK_EXAMINATION="LTLCardinality"
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 FamilyReunion-PT-L00050M0005C002P002G001, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r078-tall-165260110700731"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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